Hoogle Search

Within LTS Haskell 24.2 (ghc-9.10.2)

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

    base 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 equivialent 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

    base Control.Monad

    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 equivialent 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

    base Control.Monad.Instances

    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 equivialent 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

    base GHC.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 equivialent 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 -> Code m b) -> Code m b

    template-haskell Language.Haskell.TH.CodeDo

    Module over monad operator for Code

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

    hedgehog Hedgehog.Internal.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 equivialent 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. (>>=) :: Bind m => m a -> (a -> m b) -> m b

    semigroupoids Semigroupoids.Do

    No documentation available.

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

    ghc GHC.Prelude.Basic

    No documentation available.

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

    haskell-gi-base Data.GI.Base.ShortPrelude

    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 equivialent 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.

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

    rio RIO.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 equivialent 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.

Page 1 of many | Next