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