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 => (a -> m b) -> (b -> m c) -> a -> m c

   basic-prelude	BasicPrelude

   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
   

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

   basic-prelude	CorePrelude

   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

   classy-prelude	ClassyPrelude

   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

   classy-prelude	ClassyPrelude

   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. (>=>) :: Monad m => (a -> m b) -> (b -> m c) -> a -> m c

   persistent-test	Init

   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
   

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

   foundation	Foundation

   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
   

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

   turtle	Turtle

   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
   

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

   base-prelude	BasePrelude.Operators

   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
   

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

   LambdaHack	Game.LambdaHack.Core.Prelude

   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
   

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

    envparse	Env

    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
    

Page 2 of many | Previous | Next