(Enter summary)
Abstract: [Anybody taye in the first paragraph? Thanks!] The central result of this paper is an extension of the lambda(v)-C-calculus for a complete set of control operators and a correspondence theorem between the new theory and the lambda/beta/eta-calculus. Technically, the theorem shows that the two calculi prove the same equations with respect to the well-known continuation-passing style translation (and its inverse), which is the standard tool for defining control operators via translation into a... (Update)
Similar documents (at the sentence level):
11.9%: The Formal Relationship between Direct and Continuation-Passing.. - Sabry (1994)
(Correct)
10.7%: The Formal Relationship Between Direct and Continuation-Passing.. - Sabry (1994)
(Correct)
Active bibliography (related documents): More All
0.1: Reasoning about Programs in Continuation-Passing Style - Sabry
(Correct)
0.1: The Revised Report on the Syntactic Theories of.. - Matthias Felleisen.. (1992)
(Correct)
0.1: Typing First-Class Continuations in ML - Harper, Duba, MacQueen (1992)
(Correct)
Similar documents based on text: More All
0.3: A Reflection on Call-by-Value - Sabry, Wadler (1996)
(Correct)
0.3: CPS Transformation of Flow Information - Palsberg (1998)
(Correct)
0.2: Monadic Encapsulation of Effects: A Revised Approach (Extended .. - Moggi, Sabry (2000)
(Correct)
BibTeX entry: (Update)
@incollection{ sabry92reasoning,
author = "Amr Sabry and Matthias Felleisen",
title = "Reasoning about Programs in Continuation-Passing Style",
booktitle = "Proceedings 1992 {ACM} Conf.\ on Lisp and Functional Programming, San Francisco, {CA}, {USA}, 22--24 June 1992",
publisher = "ACM Press",
address = "New York",
pages = "288--298",
year = "1992",
url = "citeseer.ist.psu.edu/article/sabry92reasoning.html" }
Citations (may not include all citations):
729
The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
306
LCF considered as a programming language (context) - Plotkin - 1977 DBLP
184
Definitional interpreters for higher-order programming langu.. (context) - Reynolds - 1972 ACM DBLP
158
Reasoning about programs in continuation-passing style
- Sabry, Felleisen - 1992
116
RABBIT: A compiler for SCHEME (context) - Steele - 1978
110
A formulae-as-types notion of control
- Griffin - 1990 DBLP
81
The theory and practice of first-class prompts (context) - Felleisen - 1988 ACM DBLP
76
a better support of static data flow
- Consel, Danvy - 1991
76
Control operators (context) - Felleisen, Friedman - 1986
67
Representing control in the presence of first-class continua..
- Hieb, Dybvig et al. - 1990 ACM DBLP
66
Continuation semantics in typed lambda-calculi
- Meyer, Wand - 1985
61
Control-flow Analysis of Higher-Order Languages or Taming La..
- Shivers - 1991
55
Representing control: A study of the CPS transformation
- Danvy, Filinski - 1991 DBLP
40
A denotational framework for data flow analysis (context) - Nielson - 1982 DBLP
37
Back to Direct Style II: First-class continuations
- Danvy, Lawall - 1992 DBLP
36
Reasoning with continuations II: Full abstraction for models..
- Sitaram, Felleisen - 1990
18
call-by-value (context) - Plotkin - 1975
17
The Essence of Rum---A Theory of the Intensional and Extensi.. (context) - Talcott - 1985
15
Obtaining coroutines from continuations (context) - Haynes, Friedman et al. - 1986
3
Completeness for the continuous type frame (context) - Plotkin
1
Imperial College of Science (context) - Muylaert-Filho, Burn - 1992
Documents on the same site (http://www.cs.uoregon.edu/~sabry/papers/): More
Correctness of Monadic State: An Imperative Call-by-Need Calculus - Ariola, Sabry (1998)
(Correct)
Is Continuation-Passing Useful for Data Flow Analysis? - Amr Sabry (1994)
(Correct)
Debugging Reactive Systems in Haskell - Sabry, Sparud (1997)
(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