| definition: |
mapCont :: (r -> r) -> Cont r a -> Cont r a mapCont f = mapContT (Identity . f . runIdentity) |
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| failfree: |
_ |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_) |-> {mapContT}}
|
| name: |
mapCont |
| precedence: |
no precedence defined |
| result-values: |
{mapContT}
|
| signature: |
(a -> a) -> ContT a Data.Functor.Identity.Identity b -> ContT a Data.Functor.Identity.Identity b |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
yes |
| totally-defined: |
reducible on all ground data terms |