Higher-Order and Symbolic Computation, 11(2)145-175
Retraction Approach to CPS Transform
Jakov Kucan, Department of Computer Science, Brandeis University, Waltham, MA, USA
Abstract: We study the continuation passing style (CPS)
transform and its generalization, the computational transform, in
which the notion of computation is generalized from continuation
passing to an arbitrary one. To establish a relation between direct
style and continuation passing style interpretation of sequential
call-by-value programs, we prove the Retraction Theorem which says
that a lambda term can be recovered from its CPS form via a
lambda-definable retraction. The Retraction Theorem is proved in the
logic of computational lambda calculus for the simply typable terms.
Keywords: continuations, continuation passing style, CPS
transform, retractions, monads
|
This article can be downloaded [here].
|
|