CurryInfo: traversal-3.0.0 / Data.Traversal.mapChildrenM

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