Monad Complex | |
Instance detailsDefined in Data.Complex |
Monad Identity | |
Instance detailsDefined in Data.Functor.Identity |
Monad First | |
Instance detailsDefined in Data.Monoid Methods (>>=) :: First a -> (a -> First b) -> First b # (>>) :: First a -> First b -> First b # return :: a -> First a # |
Monad Last | |
Instance detailsDefined in Data.Monoid Methods (>>=) :: Last a -> (a -> Last b) -> Last b # (>>) :: Last a -> Last b -> Last b # return :: a -> Last a # |
Monad Down | |
Instance detailsDefined in Data.Ord |
Monad First | |
Instance detailsDefined in Data.Semigroup Methods (>>=) :: First a -> (a -> First b) -> First b # (>>) :: First a -> First b -> First b # return :: a -> First a # |
Monad Last | |
Instance detailsDefined in Data.Semigroup Methods (>>=) :: Last a -> (a -> Last b) -> Last b # (>>) :: Last a -> Last b -> Last b # return :: a -> Last a # |
Monad Max | |
Instance detailsDefined in Data.Semigroup Methods (>>=) :: Max a -> (a -> Max b) -> Max b # (>>) :: Max a -> Max b -> Max b # return :: a -> Max a # |
Monad Min | |
Instance detailsDefined in Data.Semigroup Methods (>>=) :: Min a -> (a -> Min b) -> Min b # (>>) :: Min a -> Min b -> Min b # return :: a -> Min a # |
Monad Dual | |
Instance detailsDefined in Data.Semigroup.Internal Methods (>>=) :: Dual a -> (a -> Dual b) -> Dual b # (>>) :: Dual a -> Dual b -> Dual b # return :: a -> Dual a # |
Monad Product | |
Instance detailsDefined in Data.Semigroup.Internal Methods (>>=) :: Product a -> (a -> Product b) -> Product b # (>>) :: Product a -> Product b -> Product b # return :: a -> Product a # |
Monad Sum | |
Instance detailsDefined in Data.Semigroup.Internal Methods (>>=) :: Sum a -> (a -> Sum b) -> Sum b # (>>) :: Sum a -> Sum b -> Sum b # return :: a -> Sum a # |
Monad STM | |
Instance detailsDefined in GHC.Conc.Sync |
Monad Par1 | |
Instance detailsDefined in GHC.Generics Methods (>>=) :: Par1 a -> (a -> Par1 b) -> Par1 b # (>>) :: Par1 a -> Par1 b -> Par1 b # return :: a -> Par1 a # |
Monad P | |
Instance detailsDefined in Text.ParserCombinators.ReadP |
Monad ReadP | |
Instance detailsDefined in Text.ParserCombinators.ReadP Methods (>>=) :: ReadP a -> (a -> ReadP b) -> ReadP b # (>>) :: ReadP a -> ReadP b -> ReadP b # return :: a -> ReadP a # |
Monad Put | |
Instance detailsDefined in Data.ByteString.Builder.Internal Methods (>>=) :: Put a -> (a -> Put b) -> Put b # (>>) :: Put a -> Put b -> Put b # return :: a -> Put a # |
Monad Seq | |
Instance detailsDefined in Data.Sequence.Internal |
Monad IO | |
Instance detailsDefined in GHC.Base |
Monad NonEmpty | |
Instance detailsDefined in GHC.Base |
Monad Maybe | |
Instance detailsDefined in GHC.Base |
Monad Solo | |
Instance detailsDefined in GHC.Base Methods (>>=) :: Solo a -> (a -> Solo b) -> Solo b # (>>) :: Solo a -> Solo b -> Solo b # return :: a -> Solo a # |
Monad [] | |
Instance detailsDefined in GHC.Base |
Monad m => Monad (WrappedMonad m) | |
Instance detailsDefined in Control.Applicative Methods (>>=) :: WrappedMonad m a -> (a -> WrappedMonad m b) -> WrappedMonad m b # (>>) :: WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m b # return :: a -> WrappedMonad m a # |
ArrowApply a => Monad (ArrowMonad a) | |
Instance detailsDefined in Control.Arrow Methods (>>=) :: ArrowMonad a a0 -> (a0 -> ArrowMonad a b) -> ArrowMonad a b # (>>) :: ArrowMonad a a0 -> ArrowMonad a b -> ArrowMonad a b # return :: a0 -> ArrowMonad a a0 # |
Monad (Either e) | |
Instance detailsDefined in Data.Either |
Monad (Proxy :: Type -> Type) | |
Instance detailsDefined in Data.Proxy |
Monad (U1 :: Type -> Type) | |
Instance detailsDefined in GHC.Generics |
Monad (ST s) | |
Instance detailsDefined in GHC.ST |
Monad m => Monad (ListT m) | |
Instance detailsDefined in Control.Monad.Trans.List Methods (>>=) :: ListT m a -> (a -> ListT m b) -> ListT m b # (>>) :: ListT m a -> ListT m b -> ListT m b # return :: a -> ListT m a # |
Monad m => Monad (MaybeT m) | |
Instance detailsDefined in Control.Monad.Trans.Maybe Methods (>>=) :: MaybeT m a -> (a -> MaybeT m b) -> MaybeT m b # (>>) :: MaybeT m a -> MaybeT m b -> MaybeT m b # return :: a -> MaybeT m a # |
Monoid a => Monad ((,) a) | |
Instance detailsDefined in GHC.Base Methods (>>=) :: (a, a0) -> (a0 -> (a, b)) -> (a, b) # (>>) :: (a, a0) -> (a, b) -> (a, b) # return :: a0 -> (a, a0) # |
Monad m => Monad (Kleisli m a) | |
Instance detailsDefined in Control.Arrow Methods (>>=) :: Kleisli m a a0 -> (a0 -> Kleisli m a b) -> Kleisli m a b # (>>) :: Kleisli m a a0 -> Kleisli m a b -> Kleisli m a b # return :: a0 -> Kleisli m a a0 # |
Monad f => Monad (Ap f) | |
Instance detailsDefined in Data.Monoid Methods (>>=) :: Ap f a -> (a -> Ap f b) -> Ap f b # (>>) :: Ap f a -> Ap f b -> Ap f b # return :: a -> Ap f a # |
Monad f => Monad (Alt f) | |
Instance detailsDefined in Data.Semigroup.Internal Methods (>>=) :: Alt f a -> (a -> Alt f b) -> Alt f b # (>>) :: Alt f a -> Alt f b -> Alt f b # return :: a -> Alt f a # |
Monad f => Monad (Rec1 f) | |
Instance detailsDefined in GHC.Generics Methods (>>=) :: Rec1 f a -> (a -> Rec1 f b) -> Rec1 f b # (>>) :: Rec1 f a -> Rec1 f b -> Rec1 f b # return :: a -> Rec1 f a # |
(Applicative f, Monad f) => Monad (WhenMissing f x) | |
Instance detailsDefined in Data.IntMap.Internal Methods (>>=) :: WhenMissing f x a -> (a -> WhenMissing f x b) -> WhenMissing f x b # (>>) :: WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x b # return :: a -> WhenMissing f x a # |
(Monad m, Error e) => Monad (ErrorT e m) | |
Instance detailsDefined in Control.Monad.Trans.Error Methods (>>=) :: ErrorT e m a -> (a -> ErrorT e m b) -> ErrorT e m b # (>>) :: ErrorT e m a -> ErrorT e m b -> ErrorT e m b # return :: a -> ErrorT e m a # |
Monad m => Monad (ExceptT e m) | |
Instance detailsDefined in Control.Monad.Trans.Except |
Monad m => Monad (IdentityT m) | |
Instance detailsDefined in Control.Monad.Trans.Identity Methods (>>=) :: IdentityT m a -> (a -> IdentityT m b) -> IdentityT m b # (>>) :: IdentityT m a -> IdentityT m b -> IdentityT m b # return :: a -> IdentityT m a # |
Monad m => Monad (ReaderT r m) | |
Instance detailsDefined in Control.Monad.Trans.Reader |
Monad m => Monad (StateT s m) | |
Instance detailsDefined in Control.Monad.Trans.State.Lazy |
Monad m => Monad (StateT s m) | |
Instance detailsDefined in Control.Monad.Trans.State.Strict Methods (>>=) :: StateT s m a -> (a -> StateT s m b) -> StateT s m b # (>>) :: StateT s m a -> StateT s m b -> StateT s m b # return :: a -> StateT s m a # |
(Monoid w, Monad m) => Monad (WriterT w m) | |
Instance detailsDefined in Control.Monad.Trans.Writer.Lazy Methods (>>=) :: WriterT w m a -> (a -> WriterT w m b) -> WriterT w m b # (>>) :: WriterT w m a -> WriterT w m b -> WriterT w m b # return :: a -> WriterT w m a # |
(Monoid w, Monad m) => Monad (WriterT w m) | |
Instance detailsDefined in Control.Monad.Trans.Writer.Strict Methods (>>=) :: WriterT w m a -> (a -> WriterT w m b) -> WriterT w m b # (>>) :: WriterT w m a -> WriterT w m b -> WriterT w m b # return :: a -> WriterT w m a # |
(Monoid a, Monoid b) => Monad ((,,) a b) | |
Instance detailsDefined in GHC.Base Methods (>>=) :: (a, b, a0) -> (a0 -> (a, b, b0)) -> (a, b, b0) # (>>) :: (a, b, a0) -> (a, b, b0) -> (a, b, b0) # return :: a0 -> (a, b, a0) # |
(Monad f, Monad g) => Monad (Product f g) | |
Instance detailsDefined in Data.Functor.Product Methods (>>=) :: Product f g a -> (a -> Product f g b) -> Product f g b # (>>) :: Product f g a -> Product f g b -> Product f g b # return :: a -> Product f g a # |
(Monad f, Monad g) => Monad (f :*: g) | |
Instance detailsDefined in GHC.Generics |
(Monad f, Applicative f) => Monad (WhenMatched f x y) | |
Instance detailsDefined in Data.IntMap.Internal Methods (>>=) :: WhenMatched f x y a -> (a -> WhenMatched f x y b) -> WhenMatched f x y b # (>>) :: WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y b # return :: a -> WhenMatched f x y a # |
(Applicative f, Monad f) => Monad (WhenMissing f k x) | |
Instance detailsDefined in Data.Map.Internal Methods (>>=) :: WhenMissing f k x a -> (a -> WhenMissing f k x b) -> WhenMissing f k x b # (>>) :: WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x b # return :: a -> WhenMissing f k x a # |
(Monoid a, Monoid b, Monoid c) => Monad ((,,,) a b c) | |
Instance detailsDefined in GHC.Base Methods (>>=) :: (a, b, c, a0) -> (a0 -> (a, b, c, b0)) -> (a, b, c, b0) # (>>) :: (a, b, c, a0) -> (a, b, c, b0) -> (a, b, c, b0) # return :: a0 -> (a, b, c, a0) # |
Monad ((->) r) | |
Instance detailsDefined in GHC.Base Methods (>>=) :: (r -> a) -> (a -> r -> b) -> r -> b # (>>) :: (r -> a) -> (r -> b) -> r -> b # return :: a -> r -> a # |
Monad f => Monad (M1 i c f) | |
Instance detailsDefined in GHC.Generics |
(Monad f, Applicative f) => Monad (WhenMatched f k x y) | |
Instance detailsDefined in Data.Map.Internal Methods (>>=) :: WhenMatched f k x y a -> (a -> WhenMatched f k x y b) -> WhenMatched f k x y b # (>>) :: WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y b # return :: a -> WhenMatched f k x y a # |
(Monoid w, Monad m) => Monad (RWST r w s m) | |
Instance detailsDefined in Control.Monad.Trans.RWS.Lazy Methods (>>=) :: RWST r w s m a -> (a -> RWST r w s m b) -> RWST r w s m b # (>>) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m b # return :: a -> RWST r w s m a # |
(Monoid w, Monad m) => Monad (RWST r w s m) | |
Instance detailsDefined in Control.Monad.Trans.RWS.Strict Methods (>>=) :: RWST r w s m a -> (a -> RWST r w s m b) -> RWST r w s m b # (>>) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m b # return :: a -> RWST r w s m a # |