Retraction Approach to CPS Transform

  • Authors:

  • Jakov Kučan

  • Affiliations:

  • Department of Computer Science, Brandeis University, Waltham, MA, USA. kucan@cs.brandeis.edu

  • Venue:
  • Higher-Order and Symbolic Computation
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

We study the continuation passing style (CPS) transform and itsgeneralization, the computational transform, in which the notionof computation is generalized from continuation passing to anarbitrary one. To establish a relation between direct style andcontinuation passing style interpretation of sequentialcall-by-value programs, we prove the Retraction Theorem which saysthat a lambda term can be recovered from its CPS form via aλ-definable retraction. The Retraction Theorem is proved inthe logic of computational lambda calculus for the simply typableterms.