Module Logtk.Signature
Signature
type t= private{sym_map : (Type.t * bool) Logtk.ID.Map.t;ty_map : Logtk.ID.Set.t Logtk.Type.Map.t;}A signature maps symbols to types, and there is a map in the backwards direction
val empty : tEmpty signature
val declare : t -> ID.t -> Type.t -> tDeclare the symbol, or
- raises AlreadyDeclared
 if the symbol is already defined
- raises Invalid_argument
 if the type has free variables
val find_exn : t -> ID.t -> Type.tLookup the type of a symbol
- raises Not_found
 if the symbol is not in the signature
val find_by_type : t -> Type.t -> Logtk.ID.Set.tReverse lookup -- given a type return all IDs with that type
val sym_in_conj : ID.t -> t -> boolval set_sym_in_conj : ID.t -> t -> tval arity : t -> ID.t -> int * intArity of the given symbol, or failure. see
Type.arityfor more details about the returned value.- raises Not_found
 if the symbol is not in the signature
val cardinal : t -> intNumber of symbols
val is_ground : t -> boolOnly ground types?
val merge : t -> t -> tMerge two signatures together.
- raises Type.Error
 if they share some symbols with distinct types
val diff : t -> t -> tdiff s1 s2contains the symbols ofs1that do not appear ins2. Useful to remove base symbols.
val well_founded : t -> boolAre there some symbols of arity 0 in the signature?
- returns
 true iff the Herbrand term universe of this signature is non empty
module Seq : sig ... endval to_set : t -> Logtk.ID.Set.tSet of symbols of the signature
val to_list : t -> (ID.t * (Type.t * bool)) listval iter : t -> (ID.t -> (Type.t * bool) -> unit) -> unitval fold : t -> 'a -> ('a -> ID.t -> (Type.t * bool) -> 'a) -> 'aval is_bool : t -> ID.t -> boolHas the symbol a boolean return sort?
- raises Not_found
 if the symbol is not in the signature