CurryInfo: base-3.4.0 / Prelude.Monad

 
class Applicative m => Monad m where
  (>>=) :: m a -> (a -> m b) -> m b
  (>>) :: m a -> m b -> m b
  return :: a -> m a

  return = pure
  m >> k = m >>= \_ -> k

 
The class `Monad` defines operators for the sequential composition
of computations.
For instances of `Monad`, the standard `do` notation can be used.

 ["(>>=) :: a b -> (b -> a c) -> a c","(>>) 2 :: a b -> a c -> a c","return 0 :: b -> a b"]

 Monad