map -base -containers +transformers

mapCont :: (r -> r) -> Cont r a -> Cont r a
transformers Control.Monad.Trans.Cont
Apply a function to transform the result of a continuation-passing computation. *  (mapCont f m) = f . runCont
mapContT :: (m r -> m r) -> ContT r m a -> ContT r m a
transformers Control.Monad.Trans.Cont
Apply a function to transform the result of a continuation-passing computation. *  (mapContT f m) = f . runContT
mapErrorT :: (m (Either e a) -> n (Either e' b)) -> ErrorT e m a -> ErrorT e' n b
transformers Control.Monad.Trans.Error
Map the unwrapped computation using the given function. *  (mapErrorT f m) = f (runErrorT >  
mapIdentityT :: (m a -> n b) -> IdentityT m a -> IdentityT n b
transformers Control.Monad.Trans.Identity
Lift a unary operation to the new monad.
mapListT :: (m [a] -> n [b]) -> ListT m a -> ListT n b
transformers Control.Monad.Trans.List
Map between ListT computations. *  (mapListT f m) = f (runListT >  
mapMaybeT :: (m (Maybe a) -> n (Maybe b)) -> MaybeT m a -> MaybeT n b
transformers Control.Monad.Trans.Maybe
Transform the computation inside a MaybeT. *  (mapMaybeT f m) = f (runMaybeT >  
mapReader :: (a -> b) -> Reader r a -> Reader r b
transformers Control.Monad.Trans.Reader
Transform the value returned by a Reader. *  (mapReader f m) = f . > runReader
mapReaderT :: (m a -> n b) -> ReaderT r m a -> ReaderT r n b
transformers Control.Monad.Trans.Reader
Transform the computation inside a ReaderT. *  (mapReaderT f m) = f . > runReaderT
mapRWS :: ((a, s, w) -> (b, s, w')) -> RWS r w s a -> RWS r w' s b
transformers Control.Monad.Trans.RWS.Lazy, transformers Control.Monad.Trans.RWS.Strict
Map the return value, final state and output of a computation using the given function. *  (mapRWS f m) r s = f (runRWS m r >  
mapRWST :: (m (a, s, w) -> n (b, s, w')) -> RWST r w s m a -> RWST r w' s n b
transformers Control.Monad.Trans.RWS.Lazy, transformers Control.Monad.Trans.RWS.Strict
Map the inner computation using the given function. *  (mapRWST f m) r s = f (runRWST m > r  
mapState :: ((a, s) -> (b, s)) -> State s a -> State s b
transformers Control.Monad.Trans.State.Lazy, transformers Control.Monad.Trans.State.Strict
Map both the return value and final state of a computation using the given function. *  (mapState f m) = f . runState
mapStateT :: (m (a, s) -> n (b, s)) -> StateT s m a -> StateT s n b
transformers Control.Monad.Trans.State.Lazy, transformers Control.Monad.Trans.State.Strict
Map both the return value and final state of a computation using the given function. *  (mapStateT f m) = f . > runStateT
mapWriter :: ((a, w) -> (b, w')) -> Writer w a -> Writer w' b
transformers Control.Monad.Trans.Writer.Lazy, transformers Control.Monad.Trans.Writer.Strict
Map both the return value and output of a computation using the given function. *  (mapWriter f m) = f (runWriter >  
mapWriterT :: (m (a, w) -> n (b, w')) -> WriterT w m a -> WriterT w' n b
transformers Control.Monad.Trans.Writer.Lazy, transformers Control.Monad.Trans.Writer.Strict
Map both the return value and output of a computation using the given function. *  (mapWriterT f m) = f > (runWriterT