| Safe Haskell | Safe-Inferred |
|---|---|
| Language | Haskell2010 |
Control.Monad.Compat
Documentation
class Applicative m => Monad (m :: Type -> Type) where #
Minimal complete definition
Instances
| Monad Complex | |
| Monad First | |
| Monad Last | |
| Monad Max | |
| Monad Min | |
| Monad NonEmpty | |
| Monad STM | |
| Monad Identity | |
| Monad First | |
| Monad Last | |
| Monad Dual | |
| Monad Product | |
| Monad Sum | |
| Monad Par1 | |
| Monad P | |
| Monad ReadP | |
| Monad ReadPrec | |
| Monad IO | |
| Monad Maybe | |
| Monad Solo | |
| Monad [] | |
| Monad m => Monad (WrappedMonad m) | |
| ArrowApply a => Monad (ArrowMonad a) | |
| Monad (ST s) | |
| Monad (Either e) | |
| Monad (Proxy :: Type -> Type) | |
| Monad (U1 :: Type -> Type) | |
| Monad (ST s) | |
| Monoid a => Monad ((,) a) | |
| Monad m => Monad (Kleisli m a) | |
| Monad f => Monad (Ap f) | |
| Monad f => Monad (Alt f) | |
| Monad f => Monad (Rec1 f) | |
| (Monoid a, Monoid b) => Monad ((,,) a b) | |
| (Monad f, Monad g) => Monad (Product f g) | |
| (Monad f, Monad g) => Monad (f :*: g) | |
| (Monoid a, Monoid b, Monoid c) => Monad ((,,,) a b c) | |
| Monad ((->) r) | |
| Monad f => Monad (M1 i c f) | |
class Monad m => MonadFail (m :: Type -> Type) where #
Instances
| MonadFail P | |
Defined in GHC.Internal.Text.ParserCombinators.ReadP | |
| MonadFail ReadP | |
Defined in GHC.Internal.Text.ParserCombinators.ReadP | |
| MonadFail ReadPrec | |
Defined in GHC.Internal.Text.ParserCombinators.ReadPrec | |
| MonadFail IO | |
Defined in GHC.Internal.Control.Monad.Fail | |
| MonadFail Maybe | |
Defined in GHC.Internal.Control.Monad.Fail | |
| MonadFail [] | |
Defined in GHC.Internal.Control.Monad.Fail | |
| MonadFail f => MonadFail (Ap f) | |
Defined in GHC.Internal.Data.Monoid | |
class (Alternative m, Monad m) => MonadPlus (m :: Type -> Type) where #
Minimal complete definition
Nothing
Instances
| MonadPlus STM | |
Defined in GHC.Internal.Conc.Sync | |
| MonadPlus P | |
Defined in GHC.Internal.Text.ParserCombinators.ReadP | |
| MonadPlus ReadP | |
Defined in GHC.Internal.Text.ParserCombinators.ReadP | |
| MonadPlus ReadPrec | |
| MonadPlus IO | |
| MonadPlus Maybe | |
| MonadPlus [] | |
Defined in GHC.Internal.Base | |
| (ArrowApply a, ArrowPlus a) => MonadPlus (ArrowMonad a) | |
Defined in GHC.Internal.Control.Arrow | |
| MonadPlus (Proxy :: Type -> Type) | |
| MonadPlus (U1 :: Type -> Type) | |
Defined in GHC.Internal.Generics | |
| MonadPlus m => MonadPlus (Kleisli m a) | |
Defined in GHC.Internal.Control.Arrow | |
| MonadPlus f => MonadPlus (Ap f) | |
| MonadPlus f => MonadPlus (Alt f) | |
| MonadPlus f => MonadPlus (Rec1 f) | |
Defined in GHC.Internal.Generics | |
| (MonadPlus f, MonadPlus g) => MonadPlus (Product f g) | |
| (MonadPlus f, MonadPlus g) => MonadPlus (f :*: g) | |
Defined in GHC.Internal.Generics | |
| MonadPlus f => MonadPlus (M1 i c f) | |
Defined in GHC.Internal.Generics | |
class Functor (f :: Type -> Type) where #
Minimal complete definition
Instances
liftM5 :: Monad m => (a1 -> a2 -> a3 -> a4 -> a5 -> r) -> m a1 -> m a2 -> m a3 -> m a4 -> m a5 -> m r #
when :: Applicative f => Bool -> f () -> f () #
mapM :: (Traversable t, Monad m) => (a -> m b) -> t a -> m (t b) #
sequence :: (Traversable t, Monad m) => t (m a) -> m (t a) #
filterM :: Applicative m => (a -> m Bool) -> [a] -> m [a] #
forever :: Applicative f => f a -> f b #
mapAndUnzipM :: Applicative m => (a -> m (b, c)) -> [a] -> m ([b], [c]) #
replicateM :: Applicative m => Int -> m a -> m [a] #
replicateM_ :: Applicative m => Int -> m a -> m () #
unless :: Applicative f => Bool -> f () -> f () #
zipWithM :: Applicative m => (a -> b -> m c) -> [a] -> [b] -> m [c] #
zipWithM_ :: Applicative m => (a -> b -> m c) -> [a] -> [b] -> m () #
forM :: (Traversable t, Monad m) => t a -> (a -> m b) -> m (t b) #
class Applicative m => Monad (m :: Type -> Type) #
Minimal complete definition
Instances
| Monad Complex | |
| Monad First | |
| Monad Last | |
| Monad Max | |
| Monad Min | |
| Monad NonEmpty | |
| Monad STM | |
| Monad Identity | |
| Monad First | |
| Monad Last | |
| Monad Dual | |
| Monad Product | |
| Monad Sum | |
| Monad Par1 | |
| Monad P | |
| Monad ReadP | |
| Monad ReadPrec | |
| Monad IO | |
| Monad Maybe | |
| Monad Solo | |
| Monad [] | |
| Monad m => Monad (WrappedMonad m) | |
| ArrowApply a => Monad (ArrowMonad a) | |
| Monad (ST s) | |
| Monad (Either e) | |
| Monad (Proxy :: Type -> Type) | |
| Monad (U1 :: Type -> Type) | |
| Monad (ST s) | |
| Monoid a => Monad ((,) a) | |
| Monad m => Monad (Kleisli m a) | |
| Monad f => Monad (Ap f) | |
| Monad f => Monad (Alt f) | |
| Monad f => Monad (Rec1 f) | |
| (Monoid a, Monoid b) => Monad ((,,) a b) | |
| (Monad f, Monad g) => Monad (Product f g) | |
| (Monad f, Monad g) => Monad (f :*: g) | |
| (Monoid a, Monoid b, Monoid c) => Monad ((,,,) a b c) | |
| Monad ((->) r) | |
| Monad f => Monad (M1 i c f) | |
class Monad m => MonadFail (m :: Type -> Type) #
Minimal complete definition
Instances
| MonadFail P | |
Defined in GHC.Internal.Text.ParserCombinators.ReadP | |
| MonadFail ReadP | |
Defined in GHC.Internal.Text.ParserCombinators.ReadP | |
| MonadFail ReadPrec | |
Defined in GHC.Internal.Text.ParserCombinators.ReadPrec | |
| MonadFail IO | |
Defined in GHC.Internal.Control.Monad.Fail | |
| MonadFail Maybe | |
Defined in GHC.Internal.Control.Monad.Fail | |
| MonadFail [] | |
Defined in GHC.Internal.Control.Monad.Fail | |
| MonadFail f => MonadFail (Ap f) | |
Defined in GHC.Internal.Data.Monoid | |
class (Alternative m, Monad m) => MonadPlus (m :: Type -> Type) where #
Minimal complete definition
Nothing
Instances
| MonadPlus STM | |
Defined in GHC.Internal.Conc.Sync | |
| MonadPlus P | |
Defined in GHC.Internal.Text.ParserCombinators.ReadP | |
| MonadPlus ReadP | |
Defined in GHC.Internal.Text.ParserCombinators.ReadP | |
| MonadPlus ReadPrec | |
| MonadPlus IO | |
| MonadPlus Maybe | |
| MonadPlus [] | |
Defined in GHC.Internal.Base | |
| (ArrowApply a, ArrowPlus a) => MonadPlus (ArrowMonad a) | |
Defined in GHC.Internal.Control.Arrow | |
| MonadPlus (Proxy :: Type -> Type) | |
| MonadPlus (U1 :: Type -> Type) | |
Defined in GHC.Internal.Generics | |
| MonadPlus m => MonadPlus (Kleisli m a) | |
Defined in GHC.Internal.Control.Arrow | |
| MonadPlus f => MonadPlus (Ap f) | |
| MonadPlus f => MonadPlus (Alt f) | |
| MonadPlus f => MonadPlus (Rec1 f) | |
Defined in GHC.Internal.Generics | |
| (MonadPlus f, MonadPlus g) => MonadPlus (Product f g) | |
| (MonadPlus f, MonadPlus g) => MonadPlus (f :*: g) | |
Defined in GHC.Internal.Generics | |
| MonadPlus f => MonadPlus (M1 i c f) | |
Defined in GHC.Internal.Generics | |