| definition: |
scanl1 :: (a -> a -> a) -> [a] -> [a] scanl1 _ [] = [] scanl1 f (x:xs) = scanl f x xs |
| demand: |
argument 2 |
| deterministic: |
deterministic operation |
| documentation: |
--- `scanl1` is a variant of `scanl` that has no starting value argument: --- scanl1 f [x1, x2, ...] == [x1, x1 `f` x2, ...] |
| failfree: |
(_, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,{[]}) |-> {[]} || (_,{:}) |-> {:}}
|
| name: |
scanl1 |
| precedence: |
no precedence defined |
| result-values: |
{:,[]}
|
| signature: |
(a -> a -> a) -> [a] -> [a] |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
yes |
| totally-defined: |
reducible on all ground data terms |