|
definition:
|
foldM :: (Monad m) => (b -> a -> m b) -> b -> [a] -> m b
foldM f z0 xs = foldr f' return xs z0
where f' x k z = f z x >>= k
|
|
demand:
|
argument 4
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
--- The 'foldM' function is analogous to 'foldl', except that its result is
--- encapsulated in a monad.
|
|
failfree:
|
(_, _, _, _)
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_,_,_,_) |-> _}
|
|
name:
|
foldM
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
_
|
|
signature:
|
Prelude.Monad c => (a -> b -> c a) -> a -> [b] -> c a
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
yes
|
|
totally-defined:
|
reducible on all ground data terms
|