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.

  1. asum :: (Generator c, Alternative f, f a ~ Elem c) => c -> f a

    reducers Data.Generator.Combinators

    The sum of a collection of actions, generalizing concat 

    reduceWith getAlt

  2. msum :: (Generator c, MonadPlus m, m a ~ Elem c) => c -> m a

    reducers Data.Generator.Combinators

    The sum of a collection of actions, generalizing concat 

    reduceWith getMonadSum

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

    reducers Data.Semigroup.MonadPlus

    A MonadSum turns any MonadPlus instance into a Monoid.

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

    reducers Data.Semigroup.MonadPlus

    No documentation available.

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

    reducers Data.Semigroup.MonadPlus

    No documentation available.

  6. preludeSummary :: PreludeMacro -> String

    regex Text.RE.TDFA

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

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

    regex Text.RE.TestBench

    generate a plain text summary of a macro

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

    regex Text.RE.ZeInternals

    generate a textual summary of the prelude macros

  9. ProduceUnsatAssumptions :: Bool -> SMTOption

    sbv Data.SBV.Control

    No documentation available.

  10. 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

Page 176 of many | Previous | Next