| definition: |
bindWM :: WM a -> (a -> WM b) -> WM b bindWM (WM x w1) f = let (WM y w2) = (f x) in WM y (w1 ++ w2) |
| demand: |
argument 1 |
| deterministic: |
deterministic operation |
| documentation: |
--- The Warning Monad's bind function |
| failfree: |
(_, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{({WM},_) |-> {WM}}
|
| name: |
bindWM |
| precedence: |
no precedence defined |
| result-values: |
{WM}
|
| signature: |
WM a -> (a -> WM b) -> WM b |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
yes |
| totally-defined: |
reducible on all ground data terms |