|
definition:
|
evalChildFamiliesM :: Monad m => Traversable a b -> Traversable b b
-> (b -> m (Maybe b)) -> a -> m a
evalChildFamiliesM tra trb = mapChildrenM tra . evalFamilyM trb
|
|
demand:
|
no demanded arguments
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
--- Monadic version of evalChildFamilies
---
|
|
failfree:
|
(_, _, _)
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_,_,_) |-> {.._#lambda508}}
|
|
name:
|
evalChildFamiliesM
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
{.._#lambda508}
|
|
signature:
|
Prelude.Monad c => (a -> ([b], [b] -> a)) -> (b -> ([b], [b] -> b)) -> (b
-> c (Prelude.Maybe b)) -> a -> c a
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
possibly non-terminating
|
|
totally-defined:
|
reducible on all ground data terms
|