Hoogle Search

Within Stackage Nightly 2026-07-01 (ghc-9.12.4)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

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

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

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

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

   constrained-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 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. (>>=) :: (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.Monad.Constrained

   No documentation available.

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

   miso	Miso.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.

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

   verset	Verset

   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.

8. data (a6989586621679272962 :: m a) >>=@#@$$ (b1 :: TyFun a ~> m b m b)

   singletons-base	Control.Monad.Singletons

   No documentation available.

9. type family (a6989586621679272962 :: m a) >>=@#@$$$ (a6989586621679272963 :: a ~> m b) :: m b

   singletons-base	Control.Monad.Singletons

   No documentation available.

10. data (a6989586621679272962 :: m a) >>=@#@$$ (b1 :: TyFun a ~> m b m b)

    singletons-base	Prelude.Singletons

    No documentation available.

Page 6 of many | Previous | Next