package logtk

  1. Overview
  2. Docs
Legend:
Library
Module
Module type
Parameter
Class
Class type
type t
type elt
module Leaf : LEAF with type elt = elt
val name : string
val empty : unit -> t
val is_empty : t -> bool
val size : t -> int
val add : t -> term -> elt -> t
val add_seq : t -> (term * elt) Iter.t -> t
val add_list : t -> (term * elt) list -> t
val remove : t -> term -> elt -> t
val remove_seq : t -> (term * elt) Iter.t -> t
val remove_list : t -> (term * elt) list -> t
val iter : t -> (term -> elt -> unit) -> unit
val fold : t -> ('a -> term -> elt -> 'a) -> 'a -> 'a
val retrieve_unifiables : t Scoped.t -> term Scoped.t -> (term * elt * Unif_subst.t) Iter.t

Retrieves a decidable fragment of unifiables. Only one unifier per subterm.

val retrieve_unifiables_complete : ?unif_alg:(Term.t Scoped.t -> Term.t Scoped.t -> Unif_subst.t option OSeq.t) -> t Scoped.t -> term Scoped.t -> (term * elt * Unif_subst.t option OSeq.t) Iter.t

Retrieves all unifiables. The set of unifiers is potentially infinite. Because HO unification is undecidable, the sequence is intersperced with `None`s to ensure termination for each element of the sequence.

val retrieve_generalizations : ?subst:subst -> t Scoped.t -> term Scoped.t -> (term * elt * subst) Iter.t
val retrieve_specializations : ?subst:subst -> t Scoped.t -> term Scoped.t -> (term * elt * subst) Iter.t

print oneself in DOT into the given file

OCaml

Innovation. Community. Security.