package libzipperposition
Library for Zipperposition
Install
Dune Dependency
Authors
Maintainers
Sources
1.6.tar.gz
md5=97cdb2f90468e9e27c7bbe3b4fb160bb
sha512=fee73369f673a91dfa9e265fc69be08b32235e10a495f3af6477d404fcd01e3452a0d012b150f3d7f97c00af2f6045019ad039164bf698f70d771231cc4efe5d
doc/libzipperposition.calculi/Libzipperposition_calculi/Fool/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)"
>