CurryInfo: transformers-3.0.0 / Control.Monad.Trans.Cont.withCont

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