Hoogle Search

Within LTS Haskell 24.52 (ghc-9.10.3)

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

Exact lookup

1. type Provable = ProvableM IO

   sbv	Data.SBV.Trans

   Provable is specialization of ProvableM to the IO monad. Unless you are using transformers explicitly, this is the type you should prefer.

2. class ExtractIO m => ProvableM (m :: Type -> Type) a

   sbv	Data.SBV.Trans

   A type a is provable if we can turn it into a predicate, i.e., it has to return a boolean. This class captures essentially prove calls.

3. ProduceAbducts :: Bool -> SMTOption

   sbv	Data.SBV.Trans.Control

   No documentation available.

4. ProduceAssertions :: Bool -> SMTOption

   sbv	Data.SBV.Trans.Control

   No documentation available.

5. ProduceAssignments :: Bool -> SMTOption

   sbv	Data.SBV.Trans.Control

   No documentation available.

6. ProduceInterpolants :: Bool -> SMTOption

   sbv	Data.SBV.Trans.Control

   No documentation available.

7. ProduceProofs :: Bool -> SMTOption

   sbv	Data.SBV.Trans.Control

   No documentation available.

8. ProduceUnsatAssumptions :: Bool -> SMTOption

   sbv	Data.SBV.Trans.Control

   No documentation available.

9. ProduceUnsatCores :: Bool -> SMTOption

   sbv	Data.SBV.Trans.Control

   No documentation available.

10. type Program = Mostek -> Mostek

    sbv	Documentation.SBV.Examples.BitPrecise.Legato

    Programs are essentially state transformers (on the machine state)

Page 996 of many | Previous | Next