| definition: |
withContT :: ((b -> m r) -> (a -> m r)) -> ContT r m a -> ContT r m b withContT f m = ContT $ runContT m . f |
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| failfree: |
(_, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,_) |-> _}
|
| name: |
withContT |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
((a -> b c) -> d -> b c) -> ContT c b d -> ContT c b a |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
yes |
| totally-defined: |
reducible on all ground data terms |