package libzipperposition

  1. Overview
  2. Docs
Library for Zipperposition

Install 

dune-project
 Dependency

github.com Readme Changelog Edit opam file Versions (4)

Authors

  1. S
    Simon Cruanes
  2. P
    Petar Vukmirovic
  3. A
    Alexander Bentkamp
  4. S
    Sophie Tourret
  5. V
    Visa Nummelin

Maintainers

  1. S
    simon.cruanes.2.17@m4x.org

Sources

2.1.tar.gz
md5=e72de75e9f0f87da9e6e8c0a4d4c89f9
sha512=81becfc9badd686ab3692cd9312172aa4c4e3581b110e81770bb01e0ffbc1eb8495d0dd6d43b98f3d06e6b8c8a338174c13ebafb4e9849a3ddf89f9a3a72c287

doc/libzipperposition.induction/Libzipperposition_induction/Make/argument-1-E/ProofState/TermIndex/index.html

Module ProofState.TermIndex

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