| definition: |
foldl1 :: (a -> a -> a) -> [a] -> a foldl1 f (x:xs) = foldl f x xs |
| demand: |
argument 2 |
| deterministic: |
deterministic operation |
| documentation: |
--- Accumulates a non-empty list from left to right. |
| failfree: |
(_, {:})
|
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,{:}) |-> _}
|
| name: |
foldl1 |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
(a -> a -> a) -> [a] -> a |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
yes |
| totally-defined: |
possibly non-reducible on same data term |