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