Amr Sabry  Home/Search
Context Related
| rice.edu/CS/PLT/Pu...thesissabry.ps.gz neu.edu/scheme/pub...thesissabry.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 Problem Downloading? From: rice.edu/CS/PLT/Publications/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Compilers for higher-order programming languages like Scheme, ML, and Lisp can be broadly characterized as either "direct compilers" or "continuation-passing style (CPS) compilers", depending on their main intermediate representation. Our central result is a precise correspondence between the two compilation strategies. Starting from the theoretical foundations of direct and CPS compilers, we develop relationships between the main components of each compilation strategy: generation of the... (Update)
Context of citations to this paper: More
.... the corresponding reduction steps in direct style thus required Plotkin to develop a so called colon translation [17] which has stuck [12,19]. In the late 80 s, however, a new CPS transformation was developed that operates in one pass and performs administrative reductions at...
.... corresponding reduction steps in direct style thus required Plotkin to develop a so called colon translation [17] which has stuck [12, 19]. In the late 80 s, however, a new CPS transformation was developed that operates in one pass and performs administrative reductions at...
Cited by: More
On proving syntactic properties of CPS programs - Danvy, Dzafic, Pfenning (1999) (Correct)
Web Interactions - Graunke (2003) (Correct)
Advanced Control Flows for Flexible Graphical User.. - Graunke, Krishnamurthi (2002) (Correct)
Similar documents (at the sentence level):
75.7%: The Formal Relationship Between Direct and Continuation-Passing.. - Sabry (1994) (Correct)
6.8%: Reasoning about Programs in Continuation-Passing Style - Sabry (Correct)
6.5%: Is Continuation-Passing Useful for Data Flow Analysis? - Amr Sabry (1994) (Correct)
Active bibliography (related documents): More All
0.7: Revised^4 Report on the Algorithmic Language Scheme - Clinger, (ed.), Rees.. (1991) (Correct)
0.6: Reasoning with Continuations III: A Complete Calculus of Control - Sabry, Felleisen (1992) (Correct)
0.5: Revised^3 Report on the Algorithmic Language Scheme - Rees, (ed.), Clinger.. (1991) (Correct)
Similar documents based on text: More All
0.4: 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.2: Models of Control and Their Implications for Programming Language .. - Sitaram (1994) (Correct)
Related documents from co-citation: More All
9: Reasoning about programs in continuation-passing style - Sabry, Felleisen
6: Theoretical Computer Science (context) - Plotkin, call-by-value et al. - 1975
6: Compiling with Continuations (context) - Appel - 1992
BibTeX entry: (Update)
Amr Sabry. The Formal Relationship between Direct and Continuation-Passing Style Optimizing Compilers: a Synthesis of Two Paradigms. PhD thesis, Rice University, 1994. http://citeseer.ist.psu.edu/article/sabry94formal.html More
@techreport{ sabry98formal,
author = "Amr A. Sabry",
title = "The Formal Relationship between Direct and Continuation-Passing Style Optimizing Compilers: {A} Synthesis of Two Paradigms",
number = "TR94-241",
month = "3,",
pages = "157",
year = "1998",
url = "citeseer.ist.psu.edu/article/sabry94formal.html" }
Citations (may not include all citations):1399 Compilers---Principles (context) - Aho, Sethi et al. - 1985
815 Abstract interpretation: A unified lattice model for static .. (context) - Cousot, Cousot - 1977
729 The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
521 Compiling with Continuations (context) - Appel - 1992 ACM
369 Information and Computation (context) - Moggi - 1991 DBLP
346 Denotational Semantics: The Scott-Strachey Approach to Progr.. (context) - Stoy - 1981
306 LCF considered as a programming language (context) - Plotkin - 1977 DBLP
283 Theoretical Computer Science (context) - Plotkin - 1975
259 Combinatory Logic (context) - Curry, Feys - 1958
254 Revised 4 report on the algorithmic language Scheme - Clinger, Rees - 1991
220 Orbit: An optimizing compiler for Scheme (context) - Kranz, Kelsey et al. - 1986
184 Definitional interpreters for higher-order programming langu.. (context) - Reynolds - 1972
158 Reasoning about programs in continuation-passing style - Sabry, Felleisen - 1992 ACM DBLP
158 Reasoning about Programs in Continuation-Passing Style - Sabry, Felleisen - 1992 ACM DBLP
155 The essence of compiling with continuations - Flanagan, Sabry et al. - 1993 ACM DBLP
152 Semantics of Programming Languages (context) - Carl - 1992 ACM
138 The revised report on the syntactic theories of sequential c.. - Felleisen, Hieb - 1992 ACM DBLP
125 Outline of a mathematical theory of computation (context) - Scott - 1970
116 Monotone data flow analysis frameworks (context) - Kam, Ullman - 1977 ACM DBLP
110 A formulae-as-types notion of control - Griffin - 1990 DBLP
108 Communications of the ACM (context) - Hoare, Hayes et al. - 1987
106 Essentials of Programming Languages (context) - Friedman, Wand et al. - 1992 ACM
97 Mathematical Structures in Computer Science (context) - Milner - 1992
89 closure-passing style (context) - Appel, Jim - 1989
81 The theory and practice of first-class prompts (context) - Felleisen - 1988 ACM DBLP
81 The Zinc Experiment: An Economical Implementation of the ML .. - Leroy - 1990
76 Toward a mathematical semantics for computer languages (context) - Scott, Strachey - 1971
76 Control operators (context) - Felleisen, Friedman - 1986
76 a better support of static data flow - Consel, Danvy - 1991
67 Representing control in the presence of first-class continua.. - Hieb, Dybvig et al. - 1990 ACM DBLP
67 Representing monads - Filinski - 1994
67 Representing monads - Filinski - 1994 ACM DBLP
66 Continuation semantics in typed lambda-calculi - Meyer, Wand - 1985
65 Equivalence in functional languages with effects - Mason, Talcott - 1991 DBLP
61 Control-Flow Analysis of Higher-Order Languages or Taming La.. - Shivers - 1991
61 Continuations: A Mathematical Semantics for Handling Full Ju.. (context) - Strachey, Wadsworth - 1974 DBLP
60 Extracting Constructive Content from Classical Proofs (context) - Murthy - 1990
55 Representing control: A study of the CPS transformation - Danvy, Filinski - 1992 DBLP
53 Realistic compilation by program transformation - Kelsey, Hudak - 1989 DBLP
52 the relation between direct and continuation semantics (context) - Reynolds - 1974
46 Assignments for applicative languages (context) - Swarup, Reddy et al. - 1991 ACM DBLP
41 Continuation-based partial evaluation - Lawall, Danvy - 1994 ACM DBLP
41 An evaluation semantics for classical proofs (context) - Murthy - 1991 DBLP
41 Equality between functionals (context) - Friedman - 1973
40 A denotational framework for data flow analysis (context) - Nielson - 1982
39 Compilation of functional languages by program transformatio.. (context) - Fradet, M'etayer - 1991 ACM DBLP
39 Massachusetts Institute of Technology (context) - Steele, Rabbit - 1978
39 Improving binding times without explicit CPS-conversion (context) - Bondorf - 1992
39 Properties of data flow frameworks: A unified model (context) - Marlowe, Ryder - 1990
38 and the lambda calculus (context) - Odersky, Rabin et al. - 1993
37 Back to direct style II: First-class continuations - Danvy, Lawall - 1992 DBLP
37 A generic account of continuation-passing styles - Hatcliff, Danvy - 1994 ACM DBLP
36 Reasoning with continuations II: Full abstraction for models.. - Sitaram, Felleisen - 1990 ACM DBLP
36 Parameter-passing and the lambda calculus - Crank, Felleisen - 1991
32 ACM Transactions on Programming Languages and Systems (context) - Hudak, Young - 1991
29 Is Continuation-Passing Useful for Data Flow Analysis - Sabry, Felleisen - 1994
29 Is continuation-passing useful for data flow analysis - Sabry, Felleisen - 1994
28 The Scheme 311 compiler: An exercise in denotational semanti.. (context) - Clinger - 1984
27 A simple rewriting semantics for realistic imperative progra.. (context) - Field - 1992
27 Lisp and Symbolic Computation (context) - Sitaram, Felleisen - 1990
24 Lisp and Symbolic Computation (context) - Reynolds - 1993
22 Correctness of procedure representations in higher-order ass.. (context) - Wand - 1992 ACM DBLP
20 A scheme for a higher-level semantic algebra (context) - Clinger, Friedman et al. - 1985
19 Side effects and aliasing can have simple axiomatic descript.. (context) - Boehm - 1985
19 CONS should not CONS its arguments (context) - Baker - 1994
18 Programming with continuations (context) - Friedman, Haynes et al. - 1985
16 Call-by-need and continuation-passing style - Okasaki, Lee et al. - 1994
16 A calculus for assignments in higher-order languages (context) - Felleisen, Friedman - 1987 ACM DBLP
15 Reasoning about explicit and implicit representations of sta.. - Sabry, Field - 1993
15 Sound and complete axiomatisations of call-by-value control .. - Hofmann - 1993 DBLP
15 Obtaining coroutines from continuations (context) - Haynes, Friedman et al. - 1986
13 Three Steps for the CPS Transformation - Danvy - 1992
13 Continuations may be unreasonable (context) - Meyer, Riecke - 1988 ACM DBLP
13 Delimiting the scope of effects - Riecke - 1993 ACM DBLP
12 The implementation of PC Scheme (context) - Bartley, Jensen - 1986
12 Continuation passing transformation and abstract interpretat.. (context) - Filho, Muylaert - 1993
12 Proving algorithms by tail functions (context) - Mazurkiewicz - 1971 DBLP
11 Formal Language Description Languages for Computer Programmi.. (context) - Steel - 1966
11 CS: An extended -calculus for Scheme (context) - Felleisen - 1988
11 A Practical Introduction to Denotational Semantics (context) - Allison - 1986 ACM
11 Making variables abstract: An equational theory for Russell (context) - Demers, Donahue - 1983 DBLP
10 The congruence of two programming language definitions (context) - Stoy - 1981
9 Towards a formal semantics (context) - Strachey - 1966
9 Constructing call-by-value continuation semantics (context) - Sethi, Tang - 1980 ACM DBLP
9 Handling control - Sitaram - 1993 ACM DBLP
8 Scheme 311 Version 4 Reference Manual (context) - Fessenden, Clinger et al. - 1983
5 Separating stages in the continuation-passing transform (context) - Lawall, Danvy - 1993
5 Improving abstract interpretations with CPS-translation (context) - Filho - 1993
4 Implementing Russel (context) - Boehm, Demers - 1986
4 Call-by-value combinatory logic and the lambdavalue calculus - Gateley, Duba - 1991
4 MIT Department of Electrical Engineering and Computer Scienc.. (context) - Rozas - 1984
3 ftp://cs.rice.edu/public/ wright/match.ps.Z (context) - Wright, Duba - 1993
3 Completeness for the continuous type frame (context) - Plotkin
2 the ultimate label or a simple optimizing compiler for Schem.. (context) - Clinger, Hansen - 1994
2 A simplifier for untyped lambda expressions (context) - Galbiati, Talcott - 1990 ACM DBLP
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.rice.edu/CS/PLT/Publications/): More
Synthesizing Object-Oriented and Functional Design.. - Krishnamurthi.. (1998) (Correct)
Reasoning about Explicit and Implicit Representations of State - Sabry, Field (1993) (Correct)
A Practical Soft Type System for Scheme - Wright, Cartwright (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