Hoogle Search

Within LTS Haskell 24.31 (ghc-9.10.3)

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

  1. hoistMiddlewareT :: (Monad m, Monad n) => (forall a . () => m a -> n a) -> (forall a . () => n a -> m a) -> MiddlewareT m -> MiddlewareT n

    wai-transformers Network.Wai.Trans

    No documentation available.

  2. hoistWebSocketsApp :: (forall a . () => m a -> n a) -> (forall a . () => n a -> m a) -> WebSocketsApp m receive send -> WebSocketsApp n receive send

    websockets-simple Network.WebSockets.Simple

    No documentation available.

  3. hoistFreeT :: forall (f :: Type -> Type) m n b . (Functor f, Functor m) => (forall a . () => m a -> n a) -> FreeT f m b -> FreeT f n b

    bowtie Bowtie.Free

    No documentation available.

  4. 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 Di

    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.

  5. hoistStorage :: StorageSurgeon t m world => world ('WorldOf m) -> world ('WorldOf (t m))

    ecstasy Data.Ecstasy.Internal

    Hoist storage through a monad transformer.

  6. hoistStateIntoStateT :: forall s (r :: [(Type -> Type) -> Type -> Type]) a . Sem ((State s :: (Type -> Type) -> Type -> Type) ': r) a -> StateT s (Sem r) a

    incipit-core IncipitCore

    Hoist a State effect into a StateT monad transformer. This can be useful when writing interpreters that need to interop with MTL.

  7. hoistFreeIx :: forall f g (m :: Type -> Type) (i :: k) (j :: k) x . (IxMonadTransFree freeIx, IxFunctor f, IxFunctor g, Monad m) => (forall (i1 :: k) (j1 :: k) x1 . () => f i1 j1 x1 -> g i1 j1 x1) -> freeIx f i j m x -> freeIx g i j m x

    indexed-transformers Control.Monad.Trans.Indexed.Free

    No documentation available.

  8. hoistEither :: forall (m :: Type -> Type) x a . Monad m => Either x a -> EitherT x m a

    transformers-either Control.Monad.Trans.Either

    Hoist an Either into an EitherT m.

  9. hoistEitherT :: (forall b . () => m b -> n b) -> EitherT x m a -> EitherT x n a

    transformers-either Control.Monad.Trans.Either

    Hoist Either m into an Either n.

  10. hoistMaybe :: forall (m :: Type -> Type) x a . Monad m => x -> Maybe a -> EitherT x m a

    transformers-either Control.Monad.Trans.Either

    Hoist Maybe a into Right a.

Page 15 of many | Previous | Next