Control.Monad.Morph

Documentation

class MFunctor t where

Minimal complete definition

mmap

Methods

mmap :: (forall a. m a -> n a) -> t m a -> t n a

Instances

MFunctor k k (IdentityT k)

Methods

mmap :: (forall a. m a -> n a) -> t m a -> t n a

MFunctor k k (ReaderT k r)

Methods

mmap :: (forall a. m a -> n a) -> t m a -> t n a

MFunctor k k (Sum k f)

Methods

mmap :: (forall a. m a -> n a) -> t m a -> t n a

MFunctor k k (Product k f)

Methods

mmap :: (forall a. m a -> n a) -> t m a -> t n a

Functor f => MFunctor k k (Compose k * f)

Methods

mmap :: (forall a. m a -> n a) -> t m a -> t n a

(MFunctor k1 k2 s, MFunctor k2 k t) => MFunctor k1 k (ComposeT (k -> *) k1 (k2 -> *) s t)

Methods

mmap :: (forall a. m a -> n a) -> t m a -> t n a

MFunctor * * MaybeT

Methods

mmap :: (forall a. m a -> n a) -> t m a -> t n a

MFunctor * * (WriterT w)

Methods

mmap :: (forall a. m a -> n a) -> t m a -> t n a

MFunctor * * (StateT s)

Methods

mmap :: (forall a. m a -> n a) -> t m a -> t n a

MFunctor * * (ExceptT e)

Methods

mmap :: (forall a. m a -> n a) -> t m a -> t n a

class (MonadTrans t, MFunctor t) => MMonad t where

Methods

mjoin :: Monad m => t (t m) a -> t m a

mbind :: Monad n => (forall a. m a -> t n a) -> t m a -> t n a

Instances

MMonad MaybeT

Methods

mjoin :: Monad m => MaybeT (MaybeT m) a -> MaybeT m a

mbind :: Monad n => (forall a. m a -> MaybeT n a) -> MaybeT m a -> MaybeT n a

Monoid w => MMonad (WriterT w)

Methods

mjoin :: Monad m => WriterT w (WriterT w m) a -> WriterT w m a

mbind :: Monad n => (forall a. m a -> WriterT w n a) -> WriterT w m a -> WriterT w n a

MMonad (IdentityT *)

Methods

mjoin :: Monad m => IdentityT * (IdentityT * m) a -> IdentityT * m a

mbind :: Monad n => (forall a. m a -> IdentityT * n a) -> IdentityT * m a -> IdentityT * n a

MMonad (ExceptT e)

Methods

mjoin :: Monad m => ExceptT e (ExceptT e m) a -> ExceptT e m a

mbind :: Monad n => (forall a. m a -> ExceptT e n a) -> ExceptT e m a -> ExceptT e n a

MMonad (ReaderT * r)

Methods

mjoin :: Monad m => ReaderT * r (ReaderT * r m) a -> ReaderT * r m a

mbind :: Monad n => (forall a. m a -> ReaderT * r n a) -> ReaderT * r m a -> ReaderT * r n a