|
definition:
|
foldChildren :: Traversable a b -> Traversable b b
-> (a -> [rb] -> ra) -> (b -> [rb] -> rb) -> a -> ra
foldChildren tra trb f g a = f a (map (fold trb g) (children tra a))
|
|
demand:
|
argument 3
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
--- Fold the children and combine the results.
---
|
|
failfree:
|
(_, _, _, _, _)
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_,_,_,_,_) |-> _}
|
|
name:
|
foldChildren
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
_
|
|
signature:
|
(a -> ([b], [b] -> a)) -> (b -> ([b], [b] -> b)) -> (a -> [c] -> d) -> (b -> [c]
-> c) -> a -> d
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
possibly non-terminating
|
|
totally-defined:
|
reducible on all ground data terms
|