Hoogle Search

Within LTS Haskell 24.34 (ghc-9.10.3)

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

  1. mapMultiGSTT :: forall ts (cts :: [CanReadWrite Type]) m a m' a' . ts ~ HListM cts => (m (a, ts) -> m' (a', ts)) -> MultiGSTT cts m a -> MultiGSTT cts m' a'

    multistate Control.Monad.Trans.MultiGST

    No documentation available.

  2. mapMultiGSTT :: forall ts (cts :: [CanReadWrite Type]) m a m' a' . ts ~ HListM cts => (m (a, ts) -> m' (a', ts)) -> MultiGSTT cts m a -> MultiGSTT cts m' a'

    multistate Control.Monad.Trans.MultiGST.Lazy

    No documentation available.

  3. mapMultiGSTT :: forall ts (cts :: [CanReadWrite Type]) m a m' a' . ts ~ HListM cts => (m (a, ts) -> m' (a', ts)) -> MultiGSTT cts m a -> MultiGSTT cts m' a'

    multistate Control.Monad.Trans.MultiGST.Strict

    No documentation available.

  4. mapMultiRWST :: forall ss (r :: [Type]) (w :: [Type]) (s :: [Type]) m a m' a' . ss ~ (HList r, HList w, HList s) => (m (a, ss) -> m' (a', ss)) -> MultiRWST r w s m a -> MultiRWST r w s m' a'

    multistate Control.Monad.Trans.MultiRWS

    No documentation available.

  5. mapMultiRWST :: forall ss (r :: [Type]) (w :: [Type]) (s :: [Type]) m a m' a' . ss ~ (HList r, HList w, HList s) => (m (a, ss) -> m' (a', ss)) -> MultiRWST r w s m a -> MultiRWST r w s m' a'

    multistate Control.Monad.Trans.MultiRWS.Lazy

    No documentation available.

  6. mapMultiRWST :: forall ss (r :: [Type]) (w :: [Type]) (s :: [Type]) m a m' a' . ss ~ (HList r, HList w, HList s) => (m (a, ss) -> m' (a', ss)) -> MultiRWST r w s m a -> MultiRWST r w s m' a'

    multistate Control.Monad.Trans.MultiRWS.Strict

    No documentation available.

  7. mapMultiReaderT :: forall m a (w :: [Type]) m' a' . (m (a, HList w) -> m' (a', HList w)) -> MultiReaderT w m a -> MultiReaderT w m' a'

    multistate Control.Monad.Trans.MultiReader

    Map both the return value and the environment of a computation using the given function. Note that there is a difference to mtl's ReaderT, where it is not possible to modify the environment.

  8. mapMultiReaderT :: forall m a (w :: [Type]) m' a' . (m (a, HList w) -> m' (a', HList w)) -> MultiReaderT w m a -> MultiReaderT w m' a'

    multistate Control.Monad.Trans.MultiReader.Lazy

    Map both the return value and the environment of a computation using the given function. Note that there is a difference to mtl's ReaderT, where it is not possible to modify the environment.

  9. mapMultiReaderT :: forall m a (w :: [Type]) m' a' . (m (a, HList w) -> m' (a', HList w)) -> MultiReaderT w m a -> MultiReaderT w m' a'

    multistate Control.Monad.Trans.MultiReader.Strict

    Map both the return value and the environment of a computation using the given function. Note that there is a difference to mtl's ReaderT, where it is not possible to modify the environment.

  10. mapMultiStateT :: forall m a (w :: [Type]) m' a' . (m (a, HList w) -> m' (a', HList w)) -> MultiStateT w m a -> MultiStateT w m' a'

    multistate Control.Monad.Trans.MultiState

    Map both the return value and the state of a computation using the given function.

Page 255 of many | Previous | Next