package term-indexing

  1. Overview
  2. Docs
Term indexing library

Install 

dune-project
 Dependency

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

Authors

  1. I
    Ilias Garnier

Maintainers

  1. I
    igarnier@protonmail.com

Sources

0.0.1.tar.gz
md5=9ba5dcf909fde539e173daf8f13abffd
sha512=e84fb1104c420db346181416a1e95e60aeb1b757ed7456a6028a6dfd5096bb7888af7c1ad6ea1acb25e99318e86d1f75c82a072bbdc3ba8218e5b16778199dfe

doc/term-indexing/Term_indexing/Term/Make_hash_consed/argument-1-P/index.html

Parameter Make_hash_consed.P

include Intf.Hashed
type t
val compare : t -> t -> int

compare is a total order.

val equal : t -> t -> bool

equal s1 s2 tests whether s1 and s2 are equal.

val hash : t -> int

hash s is a hash of s.

val pp : Format.formatter -> t -> unit

pp fmt s prints a representation of s to the formatter fmt.

val arity : t -> int

arity s is the arity of s, i.e. a term with head s must have exactly arity s sub-terms.