Hoogle Search

Within LTS Haskell 24.3 (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

    numeric-prelude NumericPrelude.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.

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

    numhask NumHask.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.

  3. type family (ma :: monad a) >>= (f :: a ~> monad b) :: monad b

    type-spec Test.TypeSpec.Internal.Apply

    Bind to actions.

  4. (>>=) :: 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 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 -> 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 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.

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

    classy-prelude ClassyPrelude

    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. (>>=) :: Monad m => m a -> (a -> m b) -> m b

    ghc-lib-parser GHC.Prelude.Basic

    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.

  8. (>>=) :: forall e s (a :: TYPE ra) (b :: TYPE rb) . Bind ra rb => Parser e s a -> (a -> Parser e s b) -> Parser e s b

    bytesmith Data.Bytes.Parser.Rebindable

    No documentation available.

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

    foundation Foundation

    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

    prelude-compat Prelude2010

    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 3 of many | Previous | Next