Hoogle Search

Within LTS Haskell 24.46 (ghc-9.10.3)

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

  1. newtype MonadSum (f :: Type -> Type) a

    reducers Data.Semigroup.MonadPlus

    A MonadSum turns any MonadPlus instance into a Monoid.

  2. MonadSum :: f a -> MonadSum (f :: Type -> Type) a

    reducers Data.Semigroup.MonadPlus

    No documentation available.

  3. getMonadSum :: MonadSum (f :: Type -> Type) a -> f a

    reducers Data.Semigroup.MonadPlus

    No documentation available.

  4. preludeSummary :: PreludeMacro -> String

    regex Text.RE.TDFA

    a summary of the macros in the standard environment for this back end in plain text

  5. formatMacroSummary :: RegexType -> MacroEnv -> MacroID -> String

    regex Text.RE.TestBench

    generate a plain text summary of a macro

  6. preludeMacroSummary :: RegexType -> PreludeMacro -> String

    regex Text.RE.ZeInternals

    generate a textual summary of the prelude macros

  7. ProduceUnsatAssumptions :: Bool -> SMTOption

    sbv Data.SBV.Control

    No documentation available.

  8. checkSatAssuming :: [SBool] -> Query CheckSatResult

    sbv Data.SBV.Control

    Check for satisfiability, under the given conditions. Similar to checkSat except it allows making further assumptions as captured by the first argument of booleans. (Also see checkSatAssumingWithUnsatisfiableSet for a variant that returns the subset of the given assumptions that led to the Unsat conclusion.) NB. For a version which generalizes over the underlying monad, see checkSatAssuming

  9. checkSatAssumingWithUnsatisfiableSet :: [SBool] -> Query (CheckSatResult, Maybe [SBool])

    sbv Data.SBV.Control

    Check for satisfiability, under the given conditions. Returns the unsatisfiable set of assumptions. Similar to checkSat except it allows making further assumptions as captured by the first argument of booleans. If the result is Unsat, the user will also receive a subset of the given assumptions that led to the Unsat conclusion. Note that while this set will be a subset of the inputs, it is not necessarily guaranteed to be minimal. You must have arranged for the production of unsat assumptions first via

    setOption $ ProduceUnsatAssumptions True
    
    for this call to not error out! Usage note: getUnsatCore is usually easier to use than checkSatAssumingWithUnsatisfiableSet, as it allows the use of named assertions, as obtained by namedConstraint. If getUnsatCore fills your needs, you should definitely prefer it over checkSatAssumingWithUnsatisfiableSet. NB. For a version which generalizes over the underlying monad, see checkSatAssumingWithUnsatisfiableSet

  10. ProduceUnsatAssumptions :: Bool -> SMTOption

    sbv Data.SBV.Trans.Control

    No documentation available.

Page 177 of many | Previous | Next