Amr Sabry  Home/Search
Context Related
Links: ACM DBLP | indiana.edu/pub/schem...ricetr180.ps.gz indiana.edu/indra/sch...ricetr180.ps.gz rice.edu/CS/PLT/Public...tr92180.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: indiana.edu/sch...oc.publications (more) From: indiana.edu (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Plotkin's -value calculus is sound but incomplete for reasoning about fij-transfor- mations on programs in continuation-passing style (CPS). To find a complete extension, we define a new, compactifying CPS transformation and an "inverse" mapping, un-CPS, both of which are interesting in their own right. Using the new CPS transformation, we can determine the precise language of CPS terms closed under fij-transformations. Using the un-CPS transformation, we can derive a set of axioms such that... (Update)
Cited by: More
Dependent Types in Practical Programming (Extended Abstract) - Xi, Pfenning (1999) (Correct)
Typed Memory Management via Static Capabilities - David Walker Carnegie (2000) (Correct)
The Occurrence of Continuation Parameters in CPS Terms - Danvy, Pfenning (1995) (Correct)
Similar documents (at the sentence level):
35.5%: Reasoning about Programs in Continuation-Passing Style - Amr Sabry (Correct)
20.4%: The Formal Relationship between Direct and Continuation-Passing.. - Sabry (1994) (Correct)
17.6%: The Formal Relationship Between Direct and Continuation-Passing.. - Sabry (1994) (Correct)
Active bibliography (related documents): More All
0.1: Separating Stages in the Continuation-Passing Style.. - Lawall, Danvy (1993) (Correct)
0.1: Reasoning with Continuations III: A Complete Calculus of Control - Sabry, Felleisen (1992) (Correct)
0.1: A Generic Account of Continuation-Passing Styles - Hatcliff, Danvy (1994) (Correct)
Similar documents based on text: More All
0.5: A Reflection on Call-by-Value - Sabry, Wadler (1996) (Correct)
0.3: Monadic Encapsulation of Effects: A Revised Approach (Extended .. - Moggi, Sabry (2000) (Correct)
0.3: CPS Transformation of Flow Information - Palsberg (1998) (Correct)
Related documents from co-citation: More All
51: Theoretical Computer Science (context) - Plotkin, call-by-value et al. - 1975
41: The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
33: Compiling with Continuations (context) - Appel - 1992
BibTeX entry: (Update)
Amr Sabry and Matthias Felleisen. Reasoning about programs in continuation-passing style. In Clinger [1], pages 288--298. http://citeseer.ist.psu.edu/12127.html More
@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/12127.html" }
Citations (may not include all citations):729 The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
220 ORBIT: An optimizing compiler for Scheme (context) - Kranz - 1986 ACM DBLP
218 The mechanical evaluation of expressions (context) - Landin - 1964
184 Definitional interpreters for higher-order programming langu.. (context) - Reynolds - 1972 ACM DBLP
116 RABBIT: A compiler for SCHEME (context) - Steele - 1978
106 Essentials of Programming Languages (context) - Friedman, Wand et al. - 1992 ACM
105 Technical Report - Leroy - 1990
89 closure-passing style (context) - Appel, Jim - 1982
76 Control operators (context) - Felleisen, Friedman - 1986
71 Lambda calculus schemata - Fischer - 1972 ACM
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
48 Polymorphic type assignment and cps conversion - Harper, Lillibridge - 1992 ACM DBLP
41 Equality between functionals (context) - Friedman - 1973
37 Back to direct style II: First-class continuations - Danvy, Lawall - 1992
20 Back to direct style - Danvy - 1992 ACM DBLP
18 call-by-value (context) - Plotkin - 1975
13 Continuations may be unreasonable (context) - Meyer, Riecke - 1988 ACM DBLP
13 Three steps for the CPS transformation - Danvy - 1992
4 Call-by-value combinatory logic and the lambdavalue calculus - Gateley, Duba - 1991
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.indiana.edu/scheme-repository/doc.publications.html): More
A Parallel Virtual Machine for Efficient Scheme Compilation - Feeley, Miller (1990) (Correct)
Register Allocation Using Lazy Saves, Eager Restores, and .. - Burger, Waddell, Dybvig (1995) (Correct)
A Scheme Shell - Shivers (1994) (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