Hoogle Search
Within LTS Haskell 24.18 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
typst Typst.Syntax No documentation available.
BoolProperty :: Bool -> Propertywhat4 Test.Verification No documentation available.
type
BoolExpr t = Expr t BaseBoolTypewhat4 What4.Expr No documentation available.
BoolExpr :: forall t . !Bool -> !ProgramLoc -> Expr t 'BaseBoolTypewhat4 What4.Expr No documentation available.
-
what4 What4.Expr No documentation available.
BoolExpr :: forall t . !Bool -> !ProgramLoc -> Expr t 'BaseBoolTypewhat4 What4.Expr.App No documentation available.
type
BoolExpr t = Expr t BaseBoolTypewhat4 What4.Expr.App No documentation available.
-
what4 What4.Expr.AppTheory No documentation available.
-
Declares a datatype for representing n-way conjunctions or disjunctions in a way that efficiently captures important algebraic laws like commutativity, associativity and resolution.
data
BoolMap (f :: BaseType -> Type)what4 What4.Expr.BoolMap This data structure keeps track of a collection of expressions together with their polarities. Such a collection might represent either a conjunction or a disjunction of expressions. The implementation uses a map from expression values to their polarities, and thus automatically implements the associative, commutative and idempotency laws common to both conjunctions and disjunctions. Moreover, if the same expression occurs in the collection with opposite polarities, the entire collection collapses via a resolution step to an "inconsistent" map. For conjunctions this corresponds to a contradiction and represents false; for disjunction, this corresponds to the law of the excluded middle and represents true.