package electrod

  1. Overview
  2. Docs
package electrod
Legend:
Library
Module
Module type
Parameter
Class
Class type

Type for "raw" ASTs yielded by the Electrod parser.

type raw_problem = {
  1. file : string option;
  2. raw_univ : raw_urelements list;
  3. raw_decls : raw_declaration list;
    (*

    does not contain 'univ'

    *)
  4. raw_goal : raw_goal;
  5. raw_invar : raw_block;
    (*

    may be empty

    *)
  6. raw_inst : raw_assignment list;
    (*

    may be empty

    *)
  7. raw_syms : raw_symmetry list;
    (*

    may be empty

    *)
}
and raw_urelements = private
  1. | UIntvl of raw_interval
  2. | UPlain of Raw_ident.t
and raw_declaration = private
  1. | DConst of Raw_ident.t * int option * raw_scope
  2. | DVar of Raw_ident.t * int option * raw_scope * raw_scope option

The int option is the optionally-declared arity (compulsory for an empty scope).

and raw_multiplicity = [ `Lone | `One ] option
and raw_scope = private
  1. | SExact of raw_bound
  2. | SInexact of raw_bound * raw_multiplicity * raw_bound
and raw_bound = private
  1. | BUniv
  2. | BRef of Raw_ident.t
    (*

    reference to a previously-defined set

    *)
  3. | BProd of raw_bound * raw_multiplicity * raw_bound
    (*

    None/Some (lone/one)

    *)
  4. | BUnion of raw_bound * raw_bound
  5. | BElts of raw_element list
and raw_element = private
  1. | EIntvl of raw_interval
    (*

    1-tuples

    *)
  2. | ETuple of raw_tuple
and raw_tuple = Raw_ident.t list

A n-tuple (incl. n = 1). inv: nonempty list

and raw_interval = Raw_ident.t * Raw_ident.t
and raw_assignment = Raw_ident.t * raw_tuple list

asignemnt of tuples to a relation

may be empty

and raw_symmetry = (Raw_ident.t * raw_tuple) list * (Raw_ident.t * raw_tuple) list
type raw_paragraph =
  1. | ParGoal of raw_goal
  2. | ParInst of raw_assignment list
  3. | ParSym of raw_symmetry list
  4. | ParInv of raw_block

This definition is here just to be used in the parser ((to avoid cyclic dependencies). The puprose of paragraphs is to deal easily and efficiently with permutation of these (see Parse_main for more information).)

Constructors

val interval : Raw_ident.t -> Raw_ident.t -> raw_interval
val etuple : Raw_ident.t list -> raw_element
val eintvl : raw_interval -> raw_element
val buniv : raw_bound
val bref : Raw_ident.t -> raw_bound
val bunion : raw_bound -> raw_bound -> raw_bound
val belts : raw_element list -> raw_bound
val sexact : raw_bound -> raw_scope
val dconst : Raw_ident.t -> int option -> raw_scope -> raw_declaration
val dvar : Raw_ident.t -> int option -> raw_scope -> raw_scope option -> raw_declaration
val uplain : Raw_ident.t -> raw_urelements
val problem : string option -> raw_urelements list -> raw_declaration list -> raw_goal -> raw_block -> raw_assignment list -> raw_symmetry list -> raw_problem

Accessors

val decl_id : raw_declaration -> Raw_ident.t