Three Steps for the CPS Transformation

Three Steps for the CPS Transformation (1991)

by Olivier Danvy

Citations:

9 - 4 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Three Steps for the CPS Transformation	user correction - Legacy Corrections
AUTHOR NAME	Olivier Danvy	SVM HeaderParse 0.1
AUTHOR AFFIL	; Department of Computing and Information Sciences; Kansas State University +; The values of all intermediate applications are given a name.	SVM HeaderParse 0.2
ABSTRACT	Transforming a #-term into continuation-passing style (CPS) might seem mystical at first, but in fact it can be characterized by three separate aspects: . The values of all intermediate applications are given a name. . The evaluation of these applications is sequentialized based on a traversal of their syntax tree. This traversal mimics the reduction strategy. . The resulting term is equipped with a continuation --- a #-abstraction whose application to intermediate values yields the final result of the whole evaluation. The first point is fulfilled using the uniform naming mechanism of #-abstraction (Church encoding), which explains why continuations are represented as functions. The second point justifies why CPS terms are evaluation-order independent --- their evaluation order is determined by the syntax tree traversal of the CPS transformation. The third point captures the essence of the CPS transformation. We have staged Fischer and Plotkin's original CPS transformer accordin...	user correction - Legacy Corrections
YEAR	1991	user correction - Legacy Corrections
CITATIONS	15 found	ParsCit 1.0