Name
Abstract | ||
|---|---|---|
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 λ-calculus. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1017/S0956796801004221 | J. Funct. Program. |
Keywords | Field | DocType |
recursive-descent traversal,new two-stage cps algorithm,trivial partial continuation,nontail call,plotkin-style cps transformation,stage plant,tail call | Programming language,Tree traversal,Computer science,Theoretical computer science | Journal |
Volume | Issue | ISSN |
12 | 6 | 0956-7968 |
Citations | PageRank | References |
0 | 0.34 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daniel P. Friedman | 1 | 877 | 310.02 |
| Amr Sabry | 2 | 520 | 35.46 |