Hoogle Search

Within LTS Haskell 24.39 (ghc-9.10.3)

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

  1. 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.

  2. 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.

  3. 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.

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

  5. 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.

  6. 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.

  7. 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.Lazy

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

  8. 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.Strict

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

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

    multistate Control.Monad.Trans.MultiWriter

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

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

    multistate Control.Monad.Trans.MultiWriter.Lazy

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

Page 296 of many | Previous | Next