Hoogle Search

Within LTS Haskell 24.2 (ghc-9.10.2)

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

  1. hoist :: forall m n (b :: k) . (MFunctor t, Monad m) => (forall a . () => m a -> n a) -> t m b -> t n b

    pipes Pipes

    Lift a monad morphism from m to n into a monad morphism from (t m) to (t n) The first argument to hoist must be a monad morphism, even though the type system does not enforce this

  2. hoist :: forall m n (b :: k) . (MFunctor t, Monad m) => (forall a . () => m a -> n a) -> t m b -> t n b

    mmorph Control.Monad.Morph

    Lift a monad morphism from m to n into a monad morphism from (t m) to (t n) The first argument to hoist must be a monad morphism, even though the type system does not enforce this

  3. hoist :: forall m n (b :: k) . (MFunctor t, Monad m) => (forall a . () => m a -> n a) -> t m b -> t n b

    streaming Streaming

    Lift a monad morphism from m to n into a monad morphism from (t m) to (t n) The first argument to hoist must be a monad morphism, even though the type system does not enforce this

  4. hoist :: (Recursive s, Corecursive t) => (forall a . () => Base s a -> Base t a) -> s -> t

    recursion-schemes Data.Functor.Foldable

    Convert from one recursive type to another. 

    >>> showTree $ hoist (\(NonEmptyF h t) -> NodeF [h] (maybeToList t)) ( 'a' :| "bcd")
(a (b (c d)))

  5. hoist :: (forall a1 . () => m a1 -> n a1) -> (forall a1 . () => n a1 -> m a1) -> UnfoldlM m a -> UnfoldlM n a

    deferred-folds DeferredFolds.UnfoldlM

    Change the base monad using invariant natural transformations

  6. hoist :: Free c ff => (forall x . () => f x -> g x) -> ff f a -> ff g a

    data-effects-core Control.Effect

    No documentation available.

  7. hoist :: forall m n (b :: k) . (MFunctor t, Monad m) => (forall a . () => m a -> n a) -> t m b -> t n b

    list-transformer List.Transformer

    Lift a monad morphism from m to n into a monad morphism from (t m) to (t n) The first argument to hoist must be a monad morphism, even though the type system does not enforce this

  8. hoist :: Free c ff => (forall x . () => f x -> g x) -> ff f a -> ff g a

    heftia Control.Monad.Hefty

    No documentation available.

  9. hoist :: Functor n => (forall x . () => m x -> n x) -> MooreT m a b -> MooreT n a b

    machines Data.Machine.MooreT

    No documentation available.

  10. hoist :: (Monad m, Monad n) => (forall x . () => m x -> n x) -> StreamK m a -> StreamK n a

    streamly-core Streamly.Internal.Data.StreamK

    No documentation available.

Page 1 of many | Next