(Enter summary)
Abstract: We prove an occurrence property about formal parameters of continuations in Continuation-Passing
Style (CPS) terms that have been automatically produced by CPS transformation of pure, call-byvalue
-terms. Essentially, parameters of continuations obey a stack-like discipline.
This property was introduced, but not formally proven, in an earlier work on the Direct-Style
transformation (the inverse of the CPS transformation). The proof has been implemented in Elf,
a constraint logic programming... (Update)
Cited by: More
Natural Deduction for Intuitionistic Non-Commutative Linear.. - Polakow, Pfenning (1999)
(Correct)
Relating Natural Deduction and Sequent Calculus for.. - Polakow, Pfenning (1999)
(Correct)
Properties of Terms in Continuation-Passing Style - In An Ordered
(Correct)
Similar documents (at the sentence level):
6.0%: On proving syntactic properties of CPS programs - Danvy, Dzafic, Pfenning (1999)
(Correct)
Active bibliography (related documents): More All
0.5: The Occurrence of Continuation Parameters in CPS Terms - Danvy, Pfenning (1995)
(Correct)
0.2: Back to Direct Style II: First-Class Continuations - Danvy, Lawall (1995)
(Correct)
0.2: The Essence of Eta-Expansion in Partial Evaluation - Danvy, Malmkjaer, Palsberg (1995)
(Correct)
Similar documents based on text: More All
0.3: Back to Direct Style - Olivier Danvy Department (1992)
(Correct)
0.3: CPS Transformation of Beta-Redexes - Danvy, Nielsen (2004)
(Correct)
0.2: An Operational Foundation for Delimited Continuations.. - Biernacka, Biernacki.. (2004)
(Correct)
Related documents from co-citation: More All
12: A framework for defining logics
- Harper, Honsell et al. - 1987
11: Formalizing program transformations (context) - Dzafic - 1998
10: Natural deduction for intuitionistic non-commutative linear logic
- Polakow, Pfenning - 1999
BibTeX entry: (Update)
Olivier Danvy and Frank Pfenning. The occurrence of continuation parameters in CPS terms. Technical Report CMU-CS-95-121, Department of Computer Science, Carnegie Mellon University, February 1995. http://citeseer.ist.psu.edu/article/danvy95occurrence.html More
@techreport{ olivier95the,
author = "Danvy, Olivier and Pfenning, Frank",
title = "{T}he {O}ccurrence of {C}ontinuation {P}arameters in {CPS} {T}erms",
number = "CMU-CS-95-121",
month = "February",
year = "1995",
url = "citeseer.ist.psu.edu/article/danvy95occurrence.html" }
Citations (may not include all citations):
283
Theoretical Computer Science (context) - Plotkin, call-by-value et al. - 1975
210
Logic programming in the LF logical framework
- Pfenning - 1991
172
Higher-order abstract syntax (context) - Pfenning, Elliott - 1988
158
Reasoning about programs in continuation-passing style
- Sabry, Felleisen
158
Reasoning about programs in continuation-passing style
- Sabry, Felleisen - 1993
121
Intensional interpretation of functionals of finite type (context) - Tait - 1967
70
Mathematical Structures in Computer Science (context) - Danvy, Filinski et al. - 1992
50
Artificial Intelligence Laboratory (context) - Jr, for et al. - 1978
38
volume 34 of Cambridge Tracts in Theoretical Computer Scienc.. (context) - Nielson, Nielson et al. - 1992
37
Back to direct style II: First-class continuations
- Danvy, Lawall
32
Implementing the meta-theory of deductive systems
- Pfenning, Rohwedder - 1992
29
A proof of the Church-Rosser theorem and its representation ..
- Pfenning - 1992
27
Proving the correctness of storage representations
- Wand, Oliva
24
Science of Computer Programming (context) - Danvy, direct - 1994
21
Separating stages in the continuation-passing style transfor..
- Lawall, Danvy - 1993
5
Continuation Introduction and Elimination in Higher-Order Pr.. (context) - Lawall - 1994
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.cmu.edu/afs/cs/user/fp/www/lfs-bib.html): More
A Proof of the Church-Rosser Theorem and its Representation in a .. - Pfenning (1992)
(Correct)
Structural Cut Elimination in Linear Logic - Pfenning (1994)
(Correct)
Higher-order syntax with induction in Coq - Despeyroux, Hirschowitz
(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