(Enter summary)
Abstract: ing Control
So far we have been investigating how to perform the CPS transformation. This section
explores properties and extensions of the transformation function.
5.1. Reynolds's escape operator
Not every -calculus term is obtainable as a result of the CPS transformation. Some of the
"unused" terms correspond to control operators in the source language. For example, the
operator escape (interdefinable with Scheme's call/cc) can be defined by the equation:
[[escape c in M ]] = :let c
0
=... (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)
Similar documents (at the sentence level):
72.3%: Representing Control - A Study of the CPS transformation - Danvy, Filinski (1992)
(Correct)
5.1%: Representing Control: A Study of the CPS Transformation - Danvy, Filinski (1992)
(Correct)
Active bibliography (related documents): More All
0.6: CPS Transformation after Strictness Analysis - Danvy, Hatcliff (1993)
(Correct)
0.3: Towards Leakage Containment - Lawall, Friedman
(Correct)
0.2: An Operational Foundation for Delimited Continuations.. - Biernacka, Biernacki.. (2004)
(Correct)
Similar documents based on text: More All
0.2: Operational Interpretations of an Extension of F-omega with .. - Harper, Lillibridge (1995)
(Correct)
0.2: Explicit Polymorphism and CPS Conversion - Harper, Lillibridge (1993)
(Correct)
0.2: Controlling Effects - Filinski (1996)
(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):
1074
The Definition of Standard ML (context) - Milner, Tofte et al. - 1990
521
Compiling with Continuations (context) - Appel - 1992
293
The essence of functional programming
- Wadler - 1992
291
Computational lambda-calculus and monads
- Moggi - 1989
254
Revised 4 report on the algorithmic language Scheme
- Clinger, Rees - 1991
184
Definitional interpreters for higher-order programming langu.. (context) - Reynolds - 1972
158
Reasoning about programs in continuation-passing style
- Sabry, Felleisen - 1992
116
Rabbit: A compiler for Scheme (context) - Jr - 1978
98
MIX: A self-applicable partial evaluator for experiments in .. (context) - Jones, Sestoft et al. - 1989
96
Automatic autoprojection of recursive equations with global ..
- Bondorf, Danvy - 1991
83
Automatic autoprojection of higher-order recursive equations (context) - Bondorf - 1991
81
The theory and practice of first-class prompts (context) - Felleisen - 1988
76
a better support of static data flow
- Consel, Danvy
76
The Icon Programming Language (context) - Griswold, Griswold - 1983
71
Lambda calculus schemata
- Fischer - 1972
69
Typing first-class continuations in ML
- Duba, Harper et al. - 1991
66
Abstracting control
- Danvy, Filinski - 1990
60
Extracting Constructive Content from Classical Proofs (context) - Murthy - 1990
48
Polymorphic type assignment and CPS conversion
- Harper, Lillibridge - 1992
42
Call-by-name (context) - Plotkin - 1975
41
The semantics of Scheme control-flow analysis
- Shivers - 1991
39
Compilation of functional languages by program transformatio.. (context) - Fradet, Le M'etayer - 1991
37
Back to direct style II: First-class continuations
- Danvy, Filinski et al. - 1992
36
Reasoning with continuations II: Full abstraction for models..
- Sitaram, Felleisen - 1990
35
Abstract continuations: A mathematical semantics for handlin.. (context) - Felleisen, Wand et al. - 1988
35
Two-level semantics and code generation (context) - Nielson, Nielson - 1988
34
Reasoning with continuations (context) - Felleisen, Friedman et al. - 1986
28
Linear continuations
- Filinski - 1992
22
Correctness of procedure representations in higher-order ass.. (context) - Wand - 1991
20
Back to direct style
- Danvy - 1992
7
Integrating Prolog in the POPLOG environment (context) - Mellish, Hardy - 1984
5
Computer Science Department (context) - Felleisen, Friedman et al.
3
Programming with tighter control (context) - Danvy - 1989
2
and Talcott (context) - Danvy - 1992
1
Two-level semantics and abstract interpretation (context) - Control - 1989
1
Static and dynamic semantics processing (context) - Pointers, -- et al. - 1991
1
A formulae-as-types notion of control (context) - on, Languages et al. - 1990
1
Should a function continue
- Riecke - 1989
1
The Scheme 311 compiler (context) - Clinger - 1984
1
Control operators (context) - Murthy - 1992
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://hypatia.dcs.qmw.ac.uk/SEL-HPC/Articles/GeneratedHtml/functional.trans.html): More
Eliminating Intermediate Lists in pH using Local Transformations - Maessen (1994)
(Correct)
Transformations of Evolving Algebras - Diehl (1997)
(Correct)
Transformations of Evolving Algebras - Diehl (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