package libzipperposition

  1. Overview
  2. Docs
Library for Zipperposition

Install

Dune Dependency

Authors

Maintainers

Sources

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

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

Module UnitIndex.E

Module that describes indexed equations

type t = Logtk.Term.t * Logtk.Term.t * bool * C.t
type rhs = Logtk.Term.t

An equation can have something other than a term as a right-hand side, for instance a formula.

val compare : t -> t -> int

Total order on equations

val extract : t -> Logtk.Index_intf.term * rhs * bool

Obtain a representation of the (in)equation. The sign indicates whether it is an equation l = r (if true) or an inequation l != r (if false)

val priority : t -> int

How "useful" this equation is. Can be safely ignored by always returning the same number.

OCaml

Innovation. Community. Security.