CurryInfo: base-3.4.0 / Prelude.foldl
definition: 
|
foldl :: (a -> b -> a) -> a -> [b] -> a foldl _ z [] = z foldl f z (x:xs) = foldl f (f z x) xs |
|
demand:
|
argument 3 |
|
deterministic:
|
deterministic operation |
|
documentation:
|
| Accumulates all list elements by applying a binary operator from left to right. |
|
failfree:
|
(_, _, _) |
|
indeterministic:
|
referentially transparent operation |
|
infix:
|
no fixity defined |
|
iotype:
|
{(_,_,{[]}) |-> _ || (_,_,{:}) |-> _}
|
|
name:
|
foldl |
|
precedence:
|
no precedence defined |
|
result-values:
|
_ |
|
signature:
|
(a -> b -> a) -> a -> [b] -> a |
|
solution-complete:
|
operation might suspend on free variables |
|
terminating:
|
yes |
|
totally-defined:
|
reducible on all ground data terms |