| definition: |
mapWriterT :: (m (a, w) -> n (b, w')) -> WriterT w m a -> WriterT w' n b mapWriterT f = WriterT . f . runWriterT |
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| documentation: |
-- | Maps both the value and the output of a writer computation. |
| failfree: |
_ |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_) |-> {.._#lambda508}}
|
| name: |
mapWriterT |
| precedence: |
no precedence defined |
| result-values: |
{.._#lambda508}
|
| signature: |
(a (b, c) -> d (e, f)) -> WriterT c a b -> WriterT f d e |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
yes |
| totally-defined: |
reducible on all ground data terms |