| definition: |
(>=>) :: Monad m => (a -> m b) -> (b -> m c) -> (a -> m c) f >=> g = \x -> f x >>= g |
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| documentation: |
--- Left-to-right composition of Kleisli arrows. |
| failfree: |
(_, _, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
infixr |
| iotype: |
{(_,_,_) |-> {>=>._#lambda3}}
|
| name: |
>=> |
| precedence: |
1 |
| result-values: |
{>=>._#lambda3}
|
| signature: |
Prelude.Monad b => (a -> b c) -> (c -> b d) -> a -> b d |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
yes |
| totally-defined: |
reducible on all ground data terms |