| definition: |
fold :: Traversable a a -> (a -> [r] -> r) -> a -> r fold tr f = foldChildren tr tr f f |
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| documentation: |
--- Implements a traversal similar to a fold with possible default cases. --- |
| failfree: |
(_, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,_) |-> {foldChildren}}
|
| name: |
fold |
| precedence: |
no precedence defined |
| result-values: |
{foldChildren}
|
| signature: |
(a -> ([a], [a] -> a)) -> (a -> [b] -> b) -> a -> b |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
reducible on all ground data terms |