Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

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

Exact lookup

1. hoist' :: (forall x . () => m1 x -> m2 x) -> OptimizedStreamT m1 a -> OptimizedStreamT m2 a

   automaton	Data.Stream.Optimized

   Like hoist, but without the Monad m2 constraint.

2. hoistMaybe :: forall (m :: Type -> Type) a . Monad m => Maybe a -> MaybeT m a

   relational-query-HDBC	Database.HDBC.Schema.Driver

   Hoist from Maybe context into MaybeT.

3. hoistFailT :: (forall a . () => m a -> n a) -> FailT e m b -> FailT e n b

   FailT	Control.Monad.Trans.Fail

   Change the underlying monad with the hoisting function.

4. hoistFailT :: (forall a . () => m a -> n a) -> FailT m b -> FailT n b

   FailT	Control.Monad.Trans.Fail.String

   Version of hoistFailT restricted to String Change the underlying monad with the hoisting function

5. hoistFailT :: (forall a . () => m a -> n a) -> FailT m b -> FailT n b

   FailT	Control.Monad.Trans.Fail.Text

   Version of hoistFailT restricted to Text Change the underlying monad with the hoisting function

6. hoistReader :: (forall b . () => m b -> n b) -> ReaderT r m a -> ReaderT r n a

   bluefin-internal	Bluefin.Internal

   No documentation available.

7. hoistDiT :: (forall x . () => n x -> m x) -> (forall x . () => m x -> n x) -> DiT level path msg m a -> DiT level path msg n a

   di-monad	Di.Monad

   Lift a monad morphism from m to n to a monad morphism from DiT level path msg m to DiT level path msg n. Notice that DiT itself is not a functor in the category of monads, so it can't be an instance of MFunctor from the mmorph package. However, it becomes one if you pair it with a natural transformation nat :: forall x. n x -> m x. That is:

   forall nat.  such that nat is a natural transformation
   hoistDiT nat  ==  hoist
   

   In practical terms, it means that most times you can “hoist” a DiT anyway, just not through hoist.

8. hoistAlt :: forall f g b . Functor g => (forall a . () => f a -> g a) -> Alt f b -> Alt g b

   envparse	Env.Internal.Free

   No documentation available.

9. hoistFree :: forall (f :: Type -> Type) (g :: Type -> Type) . (f ~> g) -> Free f ~> Free g

   functor-combinators	Control.Monad.Freer.Church

   Swap out the underlying functor over a Free. This preserves all of the structure of the Free.

10. hoistFree1 :: forall (f :: Type -> Type) (g :: Type -> Type) . (f ~> g) -> Free1 f ~> Free1 g

    functor-combinators	Control.Monad.Freer.Church

    Map the underlying functor under a Free1.

Page 10 of many | Previous | Next