Name
Abstract | ||
|---|---|---|
This paper examines the transformation of call-by-need ? terms into continuation-passing style (CPS). It begins by presenting a simple transformation of call-by-need ? terms into program graphs and a reducer for such graphs. From this, an informal derivation is carried out, resulting in a translation from ? terms into self-reducing program graphs, where the graphs are represented as CPS terms involving storage operations. Though informal, the derivation proceeds in simple steps, and the resulting translation is taken to be our canonical CPS transformation for call-by-need ? terms. |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1007/BF01019945 | Lisp and Symbolic Computation |
Keywords | Field | DocType |
call-by-need,continuation-passing style,functional programming,lazy evaluation,continuations,continuation passing style,programming language | Graph,Programming language,Algebra,Functional programming,Computer science,Continuation,Lazy evaluation,Compiler,Philosophy of language,Reducer,Continuation-passing style | Journal |
Volume | Issue | Citations |
7 | 1 | 16 |
PageRank | References | Authors |
1.21 | 22 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chris Okasaki | 1 | 228 | 22.34 |
| Peter Lee 0001 | 2 | 975 | 147.71 |
| David Tarditi | 3 | 258 | 25.74 |