package dolmen

You can search for identifiers within the package.

in-package search v0.2.0

On This Page

Predefined terms
Terms leaf constructors
Term constructors
Type constructors
Arithmetic constructors
Special constructions

dolmen
- Dolmen
  - Intf
dolmen.class
- Dolmen_class
  - Logic
    
    Make
    
    I
    
    L
    
    S
    
    Lexer
    
    Parser
    
    Incremental
    
    MenhirInterpreter
    
    T
dolmen.dimacs
- Dolmen_dimacs
  - Make
    
    L
    
    Lexer
    
    Parser
    
    Incremental
    
    MenhirInterpreter
    
    S
    
    T
  - Statement
  - Term
dolmen.icnf
- Dolmen_icnf
  - Make
    
    L
    
    Lexer
    
    Parser
    
    Incremental
    
    MenhirInterpreter
    
    S
    
    T
  - Statement
  - Term
dolmen.intf
- Dolmen_intf
  - Id
    
    Logic
  - Language
    
    S
    
    Lexer
    
    Parser
    
    Incremental
    
    MenhirInterpreter
  - Lex
    
    S
  - Location
    
    S
  - Parse
    
    S
    
    Incremental
    
    MenhirInterpreter
  - Stmt
    
    Logic
  - Term
    
    Logic
dolmen.line
- Dolmen_line
dolmen.smtlib
- Dolmen_smtlib
  - Id
  - Make
    
    I
    
    L
    
    Lexer
    
    Parser
    
    Incremental
    
    MenhirInterpreter
    
    S
    
    T
  - Statement
  - Term
dolmen.std
- Dolmen_std
  - Id
  - Misc
  - Normalize
    
    Smtlib
    
    Tptp
  - ParseLocation
  - Statement
  - Term
  - Transformer
    
    Make
    
    Lex
    
    Loc
    
    Parse
    
    Incremental
    
    MenhirInterpreter
    
    Ty
dolmen.tptp
- Dolmen_tptp
  - Id
  - Make
    
    I
    
    L
    
    Lexer
    
    Parser
    
    Incremental
    
    MenhirInterpreter
    
    S
    
    T
  - Statement
  - Term
dolmen.zf
- Dolmen_zf
  - Id
  - Make
    
    I
    
    L
    
    Lexer
    
    Parser
    
    Incremental
    
    MenhirInterpreter
    
    S
    
    T
  - Statement
  - Term

Legend:
Library
Module
Module type
Parameter
Class
Class type

Signature used by the Logic class, which parses languages such as tptp, smtlib, etc... Mainly used to parse first-order terms, it is also used to parse tptp's THF language, which uses higher order terms, so some first-order constructs such as conjunction, equality, etc... also need to be represented by standalone terms.

type t

The type of terms.

Predefined terms

val eq_t : ?loc:L.t -> unit -> t

val neq_t : ?loc:L.t -> unit -> t

The terms representing equality and disequality, respectively.

val wildcard : ?loc:L.t -> unit -> t

The wildcard term, usually used in place of type arguments to explicit polymorphic functions to not explicit types that can be inferred by the type-checker.

val tType : ?loc:L.t -> unit -> t

The type of types, defined as specific token by the Zipperposition format; in other languages, will be represented as a constant (the "$tType" constant in tptp for instance). Used to define new types, or quantify type variables in languages that support polymorphism.

val ty_int : ?loc:L.t -> unit -> t

The type of integers, defined as a specific token by the Zipperposition format; in other languages, it might be represented as a constant with a specific name (for isntance, tptp's "$int") .

val prop : ?loc:L.t -> unit -> t

The type of propositions. Also defined as a lexical token by the Zipperposition format. Will be defined as a constant in most other languages (for instance, "$o" in tptp).

val true_ : ?loc:L.t -> unit -> t

val false_ : ?loc:L.t -> unit -> t

The constants for the true and false propositional constants. Again defined as lexical token in the Zipperposition format, while treated as a constant in other languages ("$true" in tptp).

val not_t : ?loc:L.t -> unit -> t

val or_t : ?loc:L.t -> unit -> t

val and_t : ?loc:L.t -> unit -> t

val xor_t : ?loc:L.t -> unit -> t

val nor_t : ?loc:L.t -> unit -> t

val nand_t : ?loc:L.t -> unit -> t

val equiv_t : ?loc:L.t -> unit -> t

val implied_t : ?loc:L.t -> unit -> t

val implies_t : ?loc:L.t -> unit -> t

Standard logical connectives viewed as terms. implies_t is usual right implication, i.e apply implies_t [p; q] is "p implies q", while apply implied_t [p; q ] means "p is implied by q" or "q implies p".

val data_t : ?loc:L.t -> unit -> t

Term without semantic meaning, used for creating "data" terms. Used in tptp's annotations, and with similar meaning as smtlib's s-expressions (as used in the sexpr function defined later).

Terms leaf constructors

val var : ?loc:L.t -> I.t -> t

val const : ?loc:L.t -> I.t -> t

Variable and constant constructors. While in some languages they can distinguished at the lexical level (in tptp for instance), in most languages, it is an issue dependant on scoping rules, so terms parsed from an smtlib file will have all variables parsed as constants.

val atom : ?loc:L.t -> int -> t

Atoms are used for dimacs cnf parsing. Positive integers denotes variables, and negative integers denote the negation of the variable corresponding to their absolute value.

val distinct : ?loc:L.t -> I.t -> t

Used in tptp to specify constants different from other constants, for instance the 'distinct' "Apple" should be syntactically different from the "Apple" constant. Can be safely aliased to the const function as the distinct function is always given strings already enclosed with quotes, so in the example above, const would be called with "Apple" as string argument, while distinct would be called with the string "\"Apple\""

val int : ?loc:L.t -> string -> t

val rat : ?loc:L.t -> string -> t

val real : ?loc:L.t -> string -> t

val hexa : ?loc:L.t -> string -> t

val binary : ?loc:L.t -> string -> t

Constructors for words defined as numeric formats by the languages specifications. These also can be safely aliased to const.

Term constructors

val colon : ?loc:L.t -> t -> t -> t

Represents juxtaposition of two terms, usually denoted "t : t'" in most languages, and mainly used to annotated terms with their supposed, or defined, type.

val eq : ?loc:L.t -> t -> t -> t

val not_ : ?loc:L.t -> t -> t

val or_ : ?loc:L.t -> t list -> t

val and_ : ?loc:L.t -> t list -> t

val imply : ?loc:L.t -> t -> t -> t

val equiv : ?loc:L.t -> t -> t -> t

Proposition construction functions. The conjunction and disjunction are n-ary instead of binary mostly because they are in smtlib (and that is subsumes the binary case).

val apply : ?loc:L.t -> t -> t list -> t

Application constructor, seen as higher order application rather than first-order application for the following reasons: being able to parse tptp's THF, having location attached to function symbols.

val ite : ?loc:L.t -> t -> t -> t -> t

Conditional constructor, both for first-order terms and propositions. Used in the following schema: ite condition then_branch else_branch.

val match_ : ?loc:L.t -> t -> (t * t) list -> t

Pattern matching. The first term is the term to match, and each tuple in the list is a match case, which is a pair of a pattern and a match branch.

val pi : ?loc:L.t -> t list -> t -> t

val letin : ?loc:L.t -> t list -> t -> t

val forall : ?loc:L.t -> t list -> t -> t

val exists : ?loc:L.t -> t list -> t -> t

val lambda : ?loc:L.t -> t list -> t -> t

val choice : ?loc:L.t -> t list -> t -> t

val description : ?loc:L.t -> t list -> t -> t

Binders for variables. Takes a list of terms as first argument for simplicity, the lists will almost always be a list of variables, optionally typed using the colon term constructor.

Pi is the polymorphic type quantification, for instance the polymorphic identity function has type: "Pi alpha. alpha -> alpha"
Letin is local binding, takes a list of equality of equivalences whose left hand-side is a variable.
Forall is universal quantification
Exists is existential quantification
Lambda is used for function construction
Choice is the choice operator, also called indefinite description, or also epsilon terms, i.e "Choice x. p(x)" is one "x" such that "p(x)" is true.
Description is the definite description, i.e "Description x. p(x)" is the only "x" that satisfies p.

Type constructors

val arrow : ?loc:L.t -> t -> t -> t

Function type constructor, for curryfied functions. Functions that takes multiple arguments in first-order terms (and so naturally not curryfied) will take a product as only argument (see the following product function).

val product : ?loc:L.t -> t -> t -> t

Product type constructor, used for instance in the types of functions that takes multiple arguments in a non-curry way.

val union : ?loc:L.t -> t -> t -> t

Union type constructor, currently used in tptp's THF format.

val subtype : ?loc:L.t -> t -> t -> t

Subtype relation for types.

Arithmetic constructors

val uminus : ?loc:L.t -> t -> t

Arithmetic unary minus.

val add : ?loc:L.t -> t -> t -> t

Arithmetic addition.

val sub : ?loc:L.t -> t -> t -> t

Arithmetic substraction.

val mult : ?loc:L.t -> t -> t -> t

Arithmetic multiplication.

val lt : ?loc:L.t -> t -> t -> t

Arithmetic "lesser than" comparison (strict).

val leq : ?loc:L.t -> t -> t -> t

Arithmetic "lesser or equal" comparison.

val gt : ?loc:L.t -> t -> t -> t

Arithmetic "greater than" comparison (strict).

val geq : ?loc:L.t -> t -> t -> t

Arithmetic "greater or equal" comparison.

Special constructions

val quoted : ?loc:L.t -> string -> t

Create an attribute from a quoted string (in Zf).

val sequent : ?loc:L.t -> t list -> t list -> t

Sequents as terms

val annot : ?loc:L.t -> t -> t list -> t

Attach a list of attributes (also called annotations) to a term. Attributes have no logical meaning (they can be safely ignored), but may serve to give hints or meta-information.

val sexpr : ?loc:L.t -> t list -> t

S-expressions (for smtlib attributes), should probably be related to the data_t term.