Hoogle Search

Within LTS Haskell 24.34 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. uniformRBool :: Generator g m => (Bool, Bool) -> g -> m Bool

   pcg-random	System.Random.PCG.Unique

   No documentation available.

2. metaDocBool :: Bool -> MetaDoc ann

   prettyprinter-combinators	Prettyprinter.MetaDoc

   No documentation available.

3. C_Bool :: PrimClassifier Bool

   recover-rtti	Debug.RecoverRTTI

   No documentation available.

4. KBool :: Kind

   sbv	Data.SBV

   No documentation available.

5. class QuantifiedBool a

   sbv	Data.SBV

   A value that can be used as a quantified boolean

6. type SBool = SBV Bool

   sbv	Data.SBV

   A symbolic boolean/bit

7. fromBool :: Bool -> SBool

   sbv	Data.SBV

   Conversion from Bool to SBool

8. isBoolean :: HasKind a => a -> Bool

   sbv	Data.SBV

   No documentation available.

9. quantifiedBool :: QuantifiedBool a => a -> SBool

   sbv	Data.SBV

   Turn a quantified boolean into a regular boolean. That is, this function turns an exists/forall quantified formula to a simple boolean that can be used as a regular boolean value. An example is:

   quantifiedBool $ \(Forall x) (Exists y) -> y .> (x :: SInteger)
   

   is equivalent to sTrue. You can think of this function as performing quantifier-elimination: It takes a quantified formula, and reduces it to a simple boolean that is equivalent to it, but has no quantifiers.

10. sBool :: String -> Symbolic SBool

    sbv	Data.SBV

    Declare a named SBool NB. For a version which generalizes over the underlying monad, see sBool

Page 139 of many | Previous | Next