Hoogle Search

Within LTS Haskell 24.34 (ghc-9.10.3)

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

Exact lookup

1. (>=>) :: (Monad m k, Object k a, Object k b, Object k c, Object k (m b), Object k (m c), Object k (m (m c))) => k a (m b) -> k b (m c) -> k a (m c)

   constrained-categories	Control.Monad.Constrained

   No documentation available.

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

   quaalude	Essentials

   Left-to-right composition of Kleisli arrows. '(bs >=> cs) a' can be understood as the do expression

   do b <- bs a
   cs b
   

   or in terms of (>>=) as

   bs a >>= cs
   

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

   verset	Verset

   Left-to-right composition of Kleisli arrows. '(bs >=> cs) a' can be understood as the do expression

   do b <- bs a
   cs b
   

   or in terms of (>>=) as

   bs a >>= cs
   

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

   xmonad-contrib	XMonad.Util.Dzen

   Left-to-right composition of Kleisli arrows. '(bs >=> cs) a' can be understood as the do expression

   do b <- bs a
   cs b
   

   or in terms of (>>=) as

   bs a >>= cs
   

5. data (a6989586621681227069 :: a ~> m b) >=>@#@$$ (b1 :: TyFun b ~> m c a ~> m c)

   singletons-base	Control.Monad.Singletons

   No documentation available.

6. data ((a6989586621681227069 :: a ~> m b) >=>@#@$$$ (a6989586621681227070 :: b ~> m c)) (c1 :: TyFun a m c)

   singletons-base	Control.Monad.Singletons

   No documentation available.

7. (%>=>) :: forall a (m :: Type -> Type) b c (t1 :: a ~> m b) (t2 :: b ~> m c) (t3 :: a) . SMonad m => Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply ((>=>@#@$) :: TyFun (a ~> m b) ((b ~> m c) ~> (a ~> m c)) -> Type) t1) t2) t3)

   singletons-base	Control.Monad.Singletons

   No documentation available.

8. (.>=>) :: (MonadTryMerge m, Mergeable a, Mergeable b, Mergeable c) => (a -> m b) -> (b -> m c) -> a -> m c

   grisette	Grisette.Lib.Control.Monad

   >=> with MergingStrategy knowledge propagation.

9. (.>=>) :: (MonadTryMerge m, Mergeable a, Mergeable b, Mergeable c) => (a -> m b) -> (b -> m c) -> a -> m c

   grisette	Grisette.Unified.Lib.Control.Monad

   >=> with MergingStrategy knowledge propagation.

10. (>>=>>!) :: Monad m => m Bool -> m () -> m ()

    IfElse	Control.Monad.IfElse

    unless the (monadic) left side is true, perform the right action

Page 4 of many | Previous | Next