Hoogle Search
Within Stackage Nightly 2025-08-15 (ghc-9.12.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
(
>>= ) :: Monad m => m a -> (a -> m b) -> m bLambdaHack 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.(
>>= ) :: Monad m => m a -> (a -> m b) -> m bLambdaHack 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.(
>>= ) :: Monad m => m a -> (a -> m b) -> m bcabal-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.(
>>= ) :: Monad m => m a -> (a -> m b) -> m bincipit-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.(
>>= ) :: Monad m => m a % 1 -> (a % 1 -> m b) % 1 -> m blinear-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
(
>>= ) :: (MonadS m, Traceable a) => m a -> (a -> m b) -> m bnetwork-transport-tests Network.Transport.Tests.Traced Redefinition of >>=
(
>>= ) :: (Dom m a, Dom m b, CBind m) => m a -> (a -> m b) -> m bsubcategories Control.Subcategory.RebindableSyntax No documentation available.
(
>>= ) :: Dsl k r a => k r a -> (a -> r) -> rcontrol-dsl Control.Dsl The implementation of <- statements in a do block, which forwards to runCont if k is Cont, otherwise forwards to runPolyCont from PolyCont.
(
>>= ) :: 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 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.(
>>= ) :: 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 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.