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.
(
>>= ) :: Monad m => m a -> (a -> m b) -> m bcontrol-monad-free Control.Monad.Free 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.(
>>= ) :: Monad m => m a -> (a -> m b) -> m bdimensional Numeric.Units.Dimensional.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.(
>>= ) :: Monad m => m a -> (a -> m b) -> m bdistribution-opensuse OpenSuse.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.(
>>= ) :: Monad m => m a -> (a -> m b) -> m bdistribution-opensuse OpenSuse.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.(
>>= ) :: BindSyntax x y z => x a -> (a -> y b) -> z bdo-notation Language.Haskell.DoNotation No documentation available.
(
>>= ) :: (MonadParallelUnion m, Mergeable b, NFData b) => m a -> (a -> m b) -> m bgrisette Grisette.Experimental.Qualified.ParallelUnionDo Parallel (>>=) operation.
(
>>= ) :: Monad m => m a -> (a -> m b) -> m bclassy-prelude-yesod ClassyPrelude.Yesod 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.-
constrained-categories Control.Category.Constrained.Prelude No documentation available.
(
>>= ) :: Monad m => m a -> (a -> m b) -> m bconstrained-categories Control.Category.Hask 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.-
constrained-categories Control.Monad.Constrained No documentation available.