Hoogle Search

Within LTS Haskell 24.64 (ghc-9.10.3)

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

  1. (.>=>) :: (MonadTryMerge m, Mergeable a, Mergeable b, Mergeable c) => (a -> m b) -> (b -> m c) -> a -> m c

    grisette Grisette.Lib.Control.Monad

    >=> with MergingStrategy knowledge propagation.

  2. (.>>) :: (MonadTryMerge m, Mergeable a, Mergeable b) => m a -> m b -> m b

    grisette Grisette.Lib.Control.Monad

    >> with MergingStrategy knowledge propagation. This is usually more efficient than calling the original >> and merge the results.

  3. (.>>=) :: (MonadTryMerge u, Mergeable a, Mergeable b) => u a -> (a -> u b) -> u b

    grisette Grisette.Lib.Control.Monad

    >>= with MergingStrategy knowledge propagation.

  4. (.$>) :: (TryMerge f, Mergeable a, Mergeable b, Functor f) => f a -> b -> f b

    grisette Grisette.Lib.Data.Functor

    $> with MergingStrategy knowledge propagation.

  5. (.<$) :: (TryMerge f, Mergeable a, Mergeable b, Functor f) => b -> f a -> f b

    grisette Grisette.Lib.Data.Functor

    <$ with MergingStrategy knowledge propagation.

  6. (.<$>) :: (TryMerge f, Mergeable a, Mergeable b, Functor f) => (a -> b) -> f a -> f b

    grisette Grisette.Lib.Data.Functor

    <$> with MergingStrategy knowledge propagation.

  7. (.<&>) :: (TryMerge f, Mergeable a, Mergeable b, Functor f) => f a -> (a -> b) -> f b

    grisette Grisette.Lib.Data.Functor

    <&> with MergingStrategy knowledge propagation.

  8. (.!?) :: 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.

  9. (.\\) :: (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.

  10. (.#) :: 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.

Page 60 of many | Previous | Next