Module `Dolmen_std.Term`Source

Standard implementation of terms

Type definitions

Sourcetype location = ParseLocation.t

Sourcetype builtin =

| Wildcard
(*
Wildcard symbol, i.e placeholder for an expression to be inferred, typically during type-checking.
*)
| Ttype
(*
Builtin symbol for the type of Types.
*)
| Prop
(*
Builtin symbol for the type of propositions.
*)
| True
(*
The true propositional constant.
*)
| False
(*
The false propositional constant.
*)
| Eq
(*
Should all arguments be pariwise equal ?
*)
| Distinct
(*
Should all arguments be pairwise distinct ?
*)
| Ite
(*
Condional, usually applied to 3 terms (the condition, the then branch and the else branch).
*)
| Sequent
(*
Sequent as term, usually takes two argument (left side, and right side of the sequent), which are respectively a conjunction and a disjunction of propositional formulas.
*)
| Int
(*
Builtin integer type. Currently specific to Zipperposition format; other languages might use constants with pre-defined name, such as tptp's "$int".
*)
| Minus
(*
Arithmetic unary minus.
*)
| Add
(*
Arithmetic addition.
*)
| Sub
(*
Arithmetic substraction.
*)
| Mult
(*
Arithmetic multiplication.
*)
| Lt
(*
Arithmetic "less than" comparison (strict).
*)
| Leq
(*
Arithmetic "lesser or equal" comparison.
*)
| Gt
(*
Arithmetic "greater than" comparison.
*)
| Geq
(*
Arithmetic "greater or equal" comparison.
*)
| Subtype
(*
Subtyping relation
*)
| Product
(*
Product type constructor
*)
| Union
(*
Union type constructor
*)
| Not
(*
Propositional negation
*)
| And
(*
Propositional conjunction
*)
| Or
(*
Propositional disjunction
*)
| Nand
(*
Propositional not-and connective
*)
| Xor
(*
Propositional exclusive disjunction
*)
| Nor
(*
Propositional not-or
*)
| Imply
(*
Propositional implication
*)
| Implied
(*
Propositional left implication (i.e implication with reversed arguments).
*)
| Equiv
(*
Propositional equivalence
*)

The type of builtins symbols for terms. Some languages have specific syntax for logical connectives (tptp's'&&' or '||' for isntance) whereas some (smtlib for instance) don't and treat them as constants.

Sourcetype binder =

| All
(*
Universal quantification. Each term in the list of quantified terms should represent a variable (optionnally typed using the Colon constructor.
*)
| Ex
(*
Existencial quantification Each term in the list of quantified terms should represent a variable (optionnally typed using the Colon constructor.
*)
| Pi
(*
Polymorphic type quantification in function type Each term in the list of quantified terms should represent a variable (optionnally typed using the Colon constructor.
*)
| Arrow
(*
The arrow binder, for function types. Allows for curified types, if wanted.
*)
| Let
(*
Let bindings (either propositional or for terms). Term boud by a let can have many forms depending on the language, but usual shapes are:
- an equality (using the builtin Eq) between a variable (optionnally typed using the Colon constructor), and a term (e.g. in tptp)
- an equivalence (using the builtin Equiv) between a variable (optionnally typed using the Colon constructor), and a term/proposition (e.g. in tptp)
- a variable and a term juxtaposed using the Colon constructor (e.g. in smtlib)
*)
| Fun
(*
Lambda, i.e function abstraction binder. Boud terms are the variables bound by the lambda, optionnally typed using the Colon constructor.
*)
| Choice
(*
Indefinite description, or epsilon terms. Likely to have its usual shape change fllowing tptp's recent changes.
*)
| Description
(*
Definite description. Likely to have its usual shape change fllowing tptp's recent changes.
*)

The type of binders, these are pretty much always builtin in all languages.

Sourcetype descr =

| Symbol of Id.t
(*
Constants, variables, etc... any string-identified non-builtin atomic term.
*)
| Builtin of builtin
(*
Predefined builtins, i.e constants with lexical or syntaxic defintion in the source language.
*)
| Colon of t * t
(*
Juxtaposition of terms, usually used to annotate a term with its type (for quantified variables, functions arguments, etc...).
*)
| App of t * t list
(*
Higher-order application
*)
| Binder of binder * t list * t
(*
Binder (quantifiers, local functions, ...), see the binder type for more information.
*)
| Match of t * (t * t) list
(*
Pattern matching, the list contains tuples of the form (pattern,branch).
*)

The AST for terms

Sourceand t = {

term : descr;
attr : t list;
loc : location option;

}

The type of terms. A record containing an optional location, and a description of the term.

Standard functions

Sourceval equal : t -> t -> bool

Sourceval compare : t -> t -> int

Equality and comparison

Sourceval pp : Buffer.t -> t -> unit

Sourceval print : Format.formatter -> t -> unit

Sourceval print_builtin : Format.formatter -> builtin -> unit

Printing functionson buffer and formatters.

Implemented interfaces

Include the Logic interface. This interface defines almost all term building functions that you may want to use.

include Dolmen_intf.Term.Logic
  with type t := t
   and type id := Id.t
   and type location := location

Predefined terms

Sourceval eq_t : ?loc:location -> unit -> t

Sourceval neq_t : ?loc:location -> unit -> t

The terms representing equality and disequality, respectively.

Sourceval wildcard : ?loc:location -> 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.

Sourceval tType : ?loc:location -> 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.

Sourceval ty_int : ?loc:location -> 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") .

Sourceval prop : ?loc:location -> 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).

Sourceval true_ : ?loc:location -> unit -> t

Sourceval false_ : ?loc:location -> 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).

Sourceval not_t : ?loc:location -> unit -> t

Sourceval or_t : ?loc:location -> unit -> t

Sourceval and_t : ?loc:location -> unit -> t

Sourceval xor_t : ?loc:location -> unit -> t

Sourceval nor_t : ?loc:location -> unit -> t

Sourceval nand_t : ?loc:location -> unit -> t

Sourceval equiv_t : ?loc:location -> unit -> t

Sourceval implied_t : ?loc:location -> unit -> t

Sourceval implies_t : ?loc:location -> 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".

Sourceval data_t : ?loc:location -> 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

Sourceval var : ?loc:location -> Id.t -> t

Sourceval const : ?loc:location -> Id.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.

Sourceval atom : ?loc:location -> 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.

Sourceval distinct : ?loc:location -> Id.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\""

Sourceval int : ?loc:location -> string -> t

Sourceval rat : ?loc:location -> string -> t

Sourceval real : ?loc:location -> string -> t

Sourceval hexa : ?loc:location -> string -> t

Sourceval binary : ?loc:location -> string -> t

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

Term constructors

Sourceval colon : ?loc:location -> 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.

Sourceval eq : ?loc:location -> t -> t -> t

Sourceval not_ : ?loc:location -> t -> t

Sourceval or_ : ?loc:location -> t list -> t

Sourceval and_ : ?loc:location -> t list -> t

Sourceval imply : ?loc:location -> t -> t -> t

Sourceval equiv : ?loc:location -> 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).

Sourceval apply : ?loc:location -> 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.

Sourceval ite : ?loc:location -> t -> t -> t -> t

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

Sourceval match_ : ?loc:location -> 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.

Sourceval pi : ?loc:location -> t list -> t -> t

Sourceval letin : ?loc:location -> t list -> t -> t

Sourceval forall : ?loc:location -> t list -> t -> t

Sourceval exists : ?loc:location -> t list -> t -> t

Sourceval lambda : ?loc:location -> t list -> t -> t

Sourceval choice : ?loc:location -> t list -> t -> t

Sourceval description : ?loc:location -> 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

Sourceval arrow : ?loc:location -> 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).

Sourceval product : ?loc:location -> t -> t -> t

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

Sourceval union : ?loc:location -> t -> t -> t

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

Sourceval subtype : ?loc:location -> t -> t -> t

Subtype relation for types.

Arithmetic constructors

Sourceval uminus : ?loc:location -> t -> t

Arithmetic unary minus.

Sourceval add : ?loc:location -> t -> t -> t

Arithmetic addition.

Sourceval sub : ?loc:location -> t -> t -> t

Arithmetic substraction.

Sourceval mult : ?loc:location -> t -> t -> t

Arithmetic multiplication.

Sourceval lt : ?loc:location -> t -> t -> t

Arithmetic "lesser than" comparison (strict).

Sourceval leq : ?loc:location -> t -> t -> t

Arithmetic "lesser or equal" comparison.

Sourceval gt : ?loc:location -> t -> t -> t

Arithmetic "greater than" comparison (strict).

Sourceval geq : ?loc:location -> t -> t -> t

Arithmetic "greater or equal" comparison.

Special constructions

Sourceval quoted : ?loc:location -> string -> t

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

Sourceval sequent : ?loc:location -> t list -> t list -> t

Sequents as terms

Sourceval annot : ?loc:location -> 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.

Sourceval sexpr : ?loc:location -> t list -> t

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

Term inspection

Sourceval fv : t -> Id.t list

Return the list of free variables (i.e currently, Ids that are in the Var namespace).

Additional functions

Sourceval builtin : builtin -> ?loc:location -> unit -> t

Make a builtin.

Sourceval fun_ty : ?loc:location -> t list -> t -> t

Multi-arguments function type constructor.

Sourceval add_attr : t -> t -> t

add_attr attr term rturns a term t equal to term, but with attr added to the list of attributes.

Sourceval add_attrs : t list -> t -> t

Same as add_attr but adds a list of attributes.

Sourceval set_attrs : t list -> t -> t

Set the given list of terms as th attributes of the given term. Will fail (with an assertion) if the given term already have some assertion. In such cases, use add_attr instead.

Term mapping

The main use of terms mapper is to map fuctions over some terms. Traditionally, a mapping will usually only care about a few syntax cases and leav all other untouched. In these cases, it is useful to override the identity mapper, redefining only the fields needed.

Sourcetype 'a mapper = {

symbol : 'a mapper -> attr:t list -> loc:location option -> Id.t -> 'a;
builtin : 'a mapper -> attr:t list -> loc:location option -> builtin -> 'a;
colon : 'a mapper -> attr:t list -> loc:location option -> t -> t -> 'a;
app : 'a mapper -> attr:t list -> loc:location option -> t -> t list -> 'a;
binder : 'a mapper -> attr:t list -> loc:location option -> binder -> t list -> t -> 'a;
pmatch : 'a mapper -> attr:t list -> loc:location option -> t -> (t * t) list -> 'a;

}

The type of a mapper on terms.

Sourceval id_mapper : t mapper

The identity mapper: maps any term to itself.

Sourceval map : 'a mapper -> t -> 'a

Apply a mapper to a term.

Install

Dune Dependency

Authors

Maintainers

Sources

doc/dolmen.std/Dolmen_std/Term/index.html

Module `Dolmen_std.Term`Source

Type definitions

Standard functions

Implemented interfaces

Predefined terms

Terms leaf constructors

Term constructors

Type constructors

Arithmetic constructors

Special constructions

Term inspection

Additional functions

Term mapping

package dolmen

Install

Dune Dependency

Authors

Maintainers

Sources

doc/dolmen.std/Dolmen_std/Term/index.html

Module Dolmen_std.TermSource

Type definitions

Standard functions

Implemented interfaces

Predefined terms

Terms leaf constructors

Term constructors

Type constructors

Arithmetic constructors

Special constructions

Term inspection

Additional functions

Term mapping

Module `Dolmen_std.Term`Source