Hoogle Search

Within Stackage Nightly 2026-01-10 (ghc-9.12.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

  1. (>>=) :: Monad m => m a -> (a -> m b) -> m b

    basic-prelude BasicPrelude

    Sequentially compose two actions, passing any value produced by the first as an argument to the second. 'as >>= bs' can be understood as the do expression 

    do a <- as
bs a
    An alternative name for this function is 'bind', but some people may refer to it as 'flatMap', which results from it being equivalent to 
    \x f -> join (fmap f x) :: Monad m => m a -> (a -> m b) -> m b
    which can be seen as mapping a value with Monad m => m a -> m (m b) and then 'flattening' m (m b) to m b using join.

  2. (>>=) :: Monad m => m a -> (a -> m b) -> m b

    basic-prelude CorePrelude

    Sequentially compose two actions, passing any value produced by the first as an argument to the second. 'as >>= bs' can be understood as the do expression 

    do a <- as
bs a
    An alternative name for this function is 'bind', but some people may refer to it as 'flatMap', which results from it being equivalent to 
    \x f -> join (fmap f x) :: Monad m => m a -> (a -> m b) -> m b
    which can be seen as mapping a value with Monad m => m a -> m (m b) and then 'flattening' m (m b) to m b using join.

  3. (>>=) :: Monad m => m a -> (a -> m b) -> m b

    mixed-types-num Numeric.MixedTypes.PreludeHiding

    Sequentially compose two actions, passing any value produced by the first as an argument to the second. 'as >>= bs' can be understood as the do expression 

    do a <- as
bs a
    An alternative name for this function is 'bind', but some people may refer to it as 'flatMap', which results from it being equivalent to 
    \x f -> join (fmap f x) :: Monad m => m a -> (a -> m b) -> m b
    which can be seen as mapping a value with Monad m => m a -> m (m b) and then 'flattening' m (m b) to m b using join.

  4. (>>=) :: Monad m => m a -> (a -> m b) -> m b

    universum Universum.Monad.Reexport

    Sequentially compose two actions, passing any value produced by the first as an argument to the second. 'as >>= bs' can be understood as the do expression 

    do a <- as
bs a
    An alternative name for this function is 'bind', but some people may refer to it as 'flatMap', which results from it being equivalent to 
    \x f -> join (fmap f x) :: Monad m => m a -> (a -> m b) -> m b
    which can be seen as mapping a value with Monad m => m a -> m (m b) and then 'flattening' m (m b) to m b using join.

  5. (>>=) :: Monad m => m a -> (a -> m b) -> m b

    LambdaHack Game.LambdaHack.Core.Prelude

    Sequentially compose two actions, passing any value produced by the first as an argument to the second. 'as >>= bs' can be understood as the do expression 

    do a <- as
bs a
    An alternative name for this function is 'bind', but some people may refer to it as 'flatMap', which results from it being equivalent to 
    \x f -> join (fmap f x) :: Monad m => m a -> (a -> m b) -> m b
    which can be seen as mapping a value with Monad m => m a -> m (m b) and then 'flattening' m (m b) to m b using join.

  6. (>>=) :: Monad m => m a -> (a -> m b) -> m b

    LambdaHack Game.LambdaHack.Core.Prelude

    Sequentially compose two actions, passing any value produced by the first as an argument to the second. 'as >>= bs' can be understood as the do expression 

    do a <- as
bs a
    An alternative name for this function is 'bind', but some people may refer to it as 'flatMap', which results from it being equivalent to 
    \x f -> join (fmap f x) :: Monad m => m a -> (a -> m b) -> m b
    which can be seen as mapping a value with Monad m => m a -> m (m b) and then 'flattening' m (m b) to m b using join.

  7. (>>=) :: Monad m => m a -> (a -> m b) -> m b

    cabal-install-solver Distribution.Solver.Compat.Prelude

    Sequentially compose two actions, passing any value produced by the first as an argument to the second. 'as >>= bs' can be understood as the do expression 

    do a <- as
bs a
    An alternative name for this function is 'bind', but some people may refer to it as 'flatMap', which results from it being equivalent to 
    \x f -> join (fmap f x) :: Monad m => m a -> (a -> m b) -> m b
    which can be seen as mapping a value with Monad m => m a -> m (m b) and then 'flattening' m (m b) to m b using join.

  8. (>>=) :: Monad m => m a -> (a -> m b) -> m b

    incipit-base Incipit.Base

    Sequentially compose two actions, passing any value produced by the first as an argument to the second. 'as >>= bs' can be understood as the do expression 

    do a <- as
bs a
    An alternative name for this function is 'bind', but some people may refer to it as 'flatMap', which results from it being equivalent to 
    \x f -> join (fmap f x) :: Monad m => m a -> (a -> m b) -> m b
    which can be seen as mapping a value with Monad m => m a -> m (m b) and then 'flattening' m (m b) to m b using join.

  9. (>>=) :: Monad m => m a % 1 -> (a % 1 -> m b) % 1 -> m b

    linear-base Control.Functor.Linear

    x >>= g applies a linear function g linearly (i.e., using it exactly once) on the value of type a inside the value of type m a

  10. (>>=) :: (MonadS m, Traceable a) => m a -> (a -> m b) -> m b

    network-transport-tests Network.Transport.Tests.Traced

    Redefinition of >>=

Page 4 of many | Previous | Next