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.

Exact lookup

1. (>>=) :: (Dom m a, Dom m b, CBind m) => m a -> (a -> m b) -> m b

   subcategories	Control.Subcategory.RebindableSyntax

   No documentation available.

2. (>>=) :: Dsl k r a => k r a -> (a -> r) -> r

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

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

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

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

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

5. (>>=) :: BindSyntax x y z => x a -> (a -> y b) -> z b

   do-notation	Language.Haskell.DoNotation

   No documentation available.

6. (>>=) :: NoBind a => a

   kdl-hs	KDL.Applicative

   Gives a compile-time error if used. It seems like QualifiedDo still needs a definition for this, even with ApplicativeDo enabled. https://discourse.haskell.org/t/qualifieddo-applicativedo-still-requires/13491

7. data ((l :: PParser a) >>= (r :: a ~> PParser b)) (s :: FunKind PState PReply b)

   symparsec	Symparsec.Parser.Monad

   >>= for parsers. Sequentially compose two parsers, passing the value from the left parser as an argument to the second.

8. data ((l :: PParser a) >>= (r :: a ~> PParser b)) (s :: FunKind PState PReply b)

   symparsec	Symparsec.Parsers

   >>= for parsers. Sequentially compose two parsers, passing the value from the left parser as an argument to the second.

9. (>>=) :: forall x (xs :: [Type]) (ys :: [Type]) . KnownNat (Length ys) => V (x ': xs) -> (x -> V ys) -> V (Concat ys xs)

   variant	Data.Variant.Syntax

   No documentation available.

10. (>>=) :: (Function f, Monad m f, Object f a, Object f b, Object f (m a), Object f (m b), Object f (m (m b))) => m a -> f a (m b) -> m b

    constrained-categories	Control.Category.Constrained.Prelude

    No documentation available.

Page 5 of many | Previous | Next