|
definition: |
foldr1 :: (a -> a -> a) -> [a] -> a foldr1 _ [x] = x foldr1 f (x:xs@(_:_)) = f x (foldr1 f xs) |
|
demand: |
argument 2 |
|
deterministic: |
deterministic operation |
|
documentation: |
| Accumulates a non-empty list from right to left: |
|
failfree: |
(_, {:})
|
|
indeterministic: |
referentially transparent operation |
|
infix: |
no fixity defined |
|
iotype: |
{(_,{:}) |-> _}
|
|
name: |
foldr1 |
|
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 |