package libzipperposition
Library for Zipperposition
Install
Dune Dependency
Authors
Maintainers
Sources
1.5.1.tar.gz
md5=cc320f66f10555c54822da624419e003
sha512=f8d5f7a5ae790bf0388d74261673803cf375f91f92f7b413b70db1ce5841ef55343a208f98727c8551d66f1840ab892f1c0c943a34861d14d79ce469b235a2f2
doc/libzipperposition.calculi/Libzipperposition_calculi/Rewriting/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 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.
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>