package term-indexing

You can search for identifiers within the package.

in-package search v0.2.0

Term indexing library

Install

Dune Dependency

github.com Readme Changelog MIT License Edit opam file Versions (1)

Authors

I

Ilias Garnier

Maintainers

I

igarnier@protonmail.com

Sources

0.0.1.tar.gz

md5=9ba5dcf909fde539e173daf8f13abffd

sha512=e84fb1104c420db346181416a1e95e60aeb1b757ed7456a6028a6dfd5096bb7888af7c1ad6ea1acb25e99318e86d1f75c82a072bbdc3ba8218e5b16778199dfe

doc/term-indexing/Term_indexing/Term/index.html

Module `Term_indexing.Term`Source

Sourcetype 'prim term = 'prim desc Hashcons.hash_consed

The type of hash-consed terms

Sourceand 'prim desc = private

| Prim of 'prim * 'prim term array * Int_option.t
(*
Prim (prim, ts, ub) represents a term with head symbol equal to prim and subterms ts. ub is equal to Int_option.none if the term is ground. Otherwise, ub is an upper bound on the value of variables contained in ts.
*)
| Var of int
(*
Var v is a variable equal to v.
*)

Sourceval fold : ('a term -> Path.t -> 'b -> 'b) -> 'b -> 'a term -> 'b

Sourceexception Get_subterm_oob of Path.forward * int

Source

module Make_hash_consed
  (P : Intf.Signature)
  (M : Intf.Map with type key = int) : 
  Intf.Term
    with type prim = P.t
     and type t = P.t term
     and type 'a var_map = 'a M.t

The following functor instantiates a module to manipulate hash-consed terms over the signature P, using an implementation of persistent maps given by M.

Sourcemodule Default_map : Intf.Map with type key = int

Default_map is a reasonable implementation of Intf.Map usable with Make_hash_consed