package libzipperposition

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

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

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.

print oneself in DOT into the given file

OCaml

Innovation. Community. Security.

GitHub Discord Twitter Peertube RSS
About
Changelog Releases Industrial Users Academic Users Why OCaml
Ecosystem
Packages Community Events OCaml Planet Jobs
Resources
Install OCaml Get Started Platform Tools Language Manual Standard Library API Books Exercises Papers OCaml Playground Logo
Policies
Carbon Footprint Governance Privacy Code of Conduct