(Enter summary)
Abstract: This paper investigates the transformation of v -terms into continuation-passing style
(CPS). We show that by appropriate j-expansion of Fischer and Plotkin's two-pass
equational specification of the CPS transform, we can obtain a static and context-free
separation of the result terms into "essential" and "administrative" constructs. Interpreting
the former as syntax builders and the latter as directly executable code,
we obtain a simple and efficient one-pass transformation algorithm, easily ... (Update)
Cited by: More
Reliable Frameworks for Extensible Compilers - Jason Hickey Nathan
(Correct)
From System F to Typed Assembly Language - Greg Morrisett David (1998)
(Correct)
Typed Memory Management via Static Capabilities - David Walker Carnegie (2000)
(Correct)
Active bibliography (related documents): More All
0.3: Representing Control: A Study of the CPS Transformation - Danvy, Filinski (1992)
(Correct)
0.3: On the Overhead of CPS - Danvy, Dzafic, Pfenning (1996)
(Correct)
0.0: Transformation by Interpreter Specialisation - Jones (2004)
(Correct)
Similar documents based on text: More All
0.5: THEORETICAL PEARLS - CPS in Little Pieces: Composing Partial.. - Friedman, Sabry (1993)
(Correct)
0.4: Representing control: a study of the CPS transformation - Danvy, Filinski (1992)
(Correct)
0.4: Final Shift for Call/cc: Direct Implementation of Shift and.. - Gasbichler, Sperber (2002)
(Correct)
Related documents from co-citation: More All
28: Compiling with Continuations (context) - Appel - 1992
24: Reasoning about programs in continuation-passing style
- Sabry, Felleisen
18: Lambda calculus schemata
- Fischer - 1972
BibTeX entry: (Update)
Olivier Danvy and Andrzej Filinski. Representing control: A study of the CPS transformation. Mathematical Structures in Computer Science, 2(4):361-- 391, December 1992. http://citeseer.ist.psu.edu/article/danvy92representing.html More
@article{ danvy92representing,
author = "Olivier Danvy and Andrzej Filinski",
title = "Representing Control: {A} study of the {CPS} transformation",
journal = "Mathematical Structures in Computer Science",
volume = "2",
number = "4",
pages = "361--391",
year = "1992",
url = "citeseer.ist.psu.edu/article/danvy92representing.html" }
Citations (may not include all citations):
521
Compiling with Continuations (context) - Appel - 1992
254
Revised 4 report on the algorithmic language Scheme
- Clinger, Rees - 1991
96
Automatic autoprojection of recursive equations with global ..
- Bondorf, Danvy - 1991
83
Automatic autoprojection of higher-order recursive equations (context) - Bondorf - 1991
3
an exercise in Denotational Semantics (context) - Clinger, compiler - 1984
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://foxnet.cs.cmu.edu/afs/cs.cmu.edu/project/fox/mosaic/people/spot/bit-addr/bib.html):
Type-Directed Partial Evaluation - Danvy (1996)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC