Hoogle Search

Within LTS Haskell 24.20 (ghc-9.10.3)

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

  1. (.!?) :: forall a uf int . (MonadUnion uf, Mergeable a, Num int, SymEq int) => [a] -> int -> uf (Maybe a)

    grisette Grisette.Lib.Data.List

    Symbolic version of !?, the result would be merged and propagate the mergeable knowledge. Can generate O(1) cases and O(n) sized branch constraints.

  2. (.\\) :: (MonadUnion u, Mergeable a, SymEq a) => [a] -> [a] -> u [a]

    grisette Grisette.Lib.Data.List

    Symbolic version of \\, the result would be merged and propagate the mergeable knowledge. Can generate O(len(lhs)) cases, and O(len(lhs)^2 * len(rhs)) sized constraints.

  3. (.#) :: forall f a r (mode :: EvalModeTag) u . (Function f a r, UnifiedSimpleMergeable mode r, UnionView u, UnionViewMode mode u) => f -> u a -> r

    grisette Grisette.Unified

    No documentation available.

  4. (./=) :: forall (mode :: EvalModeTag) a . (DecideEvalMode mode, UnifiedSymEq mode a) => a -> a -> GetBool mode

    grisette Grisette.Unified

    Unified (./=). Note that you may sometimes need to write type annotations for the result when the mode isn't clear:

    a ./= b :: GetBool mode
    
    One example when it isn't clear is when this is used in unified mrgIf.

  5. (.<) :: forall (mode :: EvalModeTag) a . (DecideEvalMode mode, UnifiedSymOrd mode a) => a -> a -> GetBool mode

    grisette Grisette.Unified

    Unified (.<).

  6. (.<=) :: forall (mode :: EvalModeTag) a . (DecideEvalMode mode, UnifiedSymOrd mode a) => a -> a -> GetBool mode

    grisette Grisette.Unified

    Unified (.<=). Note that you may sometimes need to write type annotations for the result when the mode isn't clear:

    a .<= b :: GetBool mode
    
    One example when it isn't clear is when this is used in unified mrgIf.

  7. (.==) :: forall (mode :: EvalModeTag) a . (DecideEvalMode mode, UnifiedSymEq mode a) => a -> a -> GetBool mode

    grisette Grisette.Unified

    Unified (.==). Note that you may sometimes need to write type annotations for the result when the mode isn't clear:

    a .== b :: GetBool mode
    
    One example when it isn't clear is when this is used in unified mrgIf.

  8. (.>) :: forall (mode :: EvalModeTag) a . (DecideEvalMode mode, UnifiedSymOrd mode a) => a -> a -> GetBool mode

    grisette Grisette.Unified

    Unified (.>).

  9. (.>=) :: forall (mode :: EvalModeTag) a . (DecideEvalMode mode, UnifiedSymOrd mode a) => a -> a -> GetBool mode

    grisette Grisette.Unified

    Unified (.>=).

  10. (.*>) :: (Applicative f, TryMerge f, Mergeable a, Mergeable b) => f a -> f b -> f b

    grisette Grisette.Unified.Lib.Control.Applicative

    *> with MergingStrategy knowledge propagation.

Page 65 of many | Previous | Next