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.2007@m4x.org

Sources

2.0.tar.gz
md5=7a8e57388083ed763d12d18324c8a086
sha512=5c5ac312ada6b42907d1e91e349454a8375f7bf8165d3459721a40b707a840a3d6b3dc968a66f1040cb4de7aedf5c1c13f3e90b51337eae5ea6de41651d7bd63

doc/libzipperposition.calculi/Libzipperposition_calculi/Superposition/Make/argument-1-Env/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.