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