Theoretical pearl - CPS in little pieces: composing partial continuations

被引：0

作者：

Friedman, DP ^{[1
]}

Sabry, A ^{[1
]}

机构：

[1] Indiana Univ, Dept Comp Sci, Bloomington, IN 47405 USA

来源：

JOURNAL OF FUNCTIONAL PROGRAMMING | 2002年 / 12卷 / 06期

关键词：

Algorithms - Computer simulation - Problem solving - Recursive functions;

D O I：

10.1017/S0956796801004221

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

This paper presents a new two-stage CPS algorithm. The first stage plants trivial partial continuations via a recursive-descent traversal and the second stage is a rewrite system that transforms all nontail calls into tail calls. The algorithm combines the metaphors of the Plotkin-style CPS transformation along with reduction in the lambda-calculus.

引用

页码：617 / 622

页数：6