CurryInfo: base-3.4.0 / Control.Monad.>=>

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