See this document in CiteSeerX!

Abstracting Control (1990)  (Make Corrections)  (66 citations)
Olivier Danvy, Andrzej Filinski
Proceedings of the 1990 ACM Conference on LISP and Functional Programming, Nice



  Home/Search   Context   Related

Links:   ACM   DBLP

 
View or download:
cmu.edu/user/andrzej/pub/AC.ps.Z
dcs.ed.ac.uk/~aof/papers/AC.ps.Z
daimi.aau.dk/pub/e...linskilfp90.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help
Problem Downloading?
From:  hypatia.dcs.qmw...ional.impmonads (more)
From:  brics.dk/~danvy/research
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: The last few years have seen a renewed interest in continuations for expressing advanced control structures in programming languages, and new models such as Abstract Continuations have been proposed to capture these dimensions. This article investigates an alternative formulation, exploiting the latent expressive power of the standard continuation-passing style (CPS) instead of introducing yet other new concepts. We build on a single foundation: abstracting control as a hierarchy of... (Update)

Cited by:   More
An Operational Foundation for Delimited Continuations.. - Biernacka, Biernacki.. (2004)   (Correct)
From Interpreter to Logic Engine by Defunctionalization - Danvy, Danvy (2004)   (Correct)
Sharing Continuations: Proofnets for Languages with Explicit.. - Lawall, Mairson (2000)   (Correct)

Active bibliography (related documents):   More   All
1.5:   On some Functional Aspects of Control - Danvy (1988)   (Correct)
1.5:   A Functional Abstraction of Typed Contexts - Danvy, Filinski (1989)   (Correct)
0.8:   A Blond Primer - Danvy, Malmkjær (1988)   (Correct)

Similar documents based on text:   More   All
0.4:   Monads and Composable Continuations - Wadler (1993)   (Correct)
0.2:   Representing Control - A Study of the CPS transformation - Danvy, Filinski (1992)   (Correct)
0.2:   Controlling Effects - Filinski (1996)   (Correct)

Related documents from co-citation:   More   All
23:   The theory and practice of first-class prompts (context) - Felleisen - 1988
20:   Representing monads - Filinski - 1994
18:   Definitional interpreters for higher-order programming languages (context) - Reynolds - 1972

BibTeX entry:   (Update)

Olivier Danvy and Andrzej Filinski. Abstracting control. In Proceedings of the 1990 ACM Conference on Lisp and Functional Programming, pages 151--160, Nice, France, June 1990. http://citeseer.ist.psu.edu/danvy90abstracting.html   More

@inproceedings{ danvy90abstracting,
    author = "O. Danvy and A. Filinski",
    title = "Abstracting Control",
    booktitle = "Proceedings of the 1990 {ACM} Conference on {LISP} and Functional Programming, Nice",
    publisher = "ACM",
    address = "New York, NY",
    pages = "151--160",
    year = "1990",
    url = "citeseer.ist.psu.edu/danvy90abstracting.html" }
Citations (may not include all citations):
283   Theoretical Computer Science (context) - Plotkin, Call-by-Value et al. - 1975  ACM
197   Revised 3 Report on the Algorithmic Language Scheme - Rees, Clinger - 1986
116   RABBIT: A Compiler for SCHEME (context) - Jr - 1978  ACM
48   Studies in Logic and the Foundations of Mathematics (context) - Barendregt, Calculus et al. - 1985
30   Ullman: The Design and Analysis of Computer Algorithms (context) - Aho, Hopcroft - 1974
6   A Bonus from van Wijngaarden 's Device (context) - Jr - 1972
4   John Merrill: Beyond Continuations (context) - Felleisen, Friedman et al. - 1987
4   Wadsworth: Continuations: A Mathematical Semantics for Handl.. (context) - Strachey - 1974
4   Duba: Abstract Continuations: A Mathematical Semantics for H.. (context) - Felleisen, Wand et al. - 1988
4   Smith: Reflection and Semantics in a Procedural Language (context) - Brian - 1982
3   Andrzej Filinski: A Functional Abstraction of Typed Contexts (context) - Danvy - 1989
2   Fischer: Lambda Calculus Schemata (context) - Michael - 1972
2   Eugene Kohlbecker: Programming with Continuations (context) - Friedman, Haynes - 1984
2   Mazurkiewicz: Proving Algorithms by Tail Functions (context) - Antoni - 1971
1   AI Memo No (context) - Jr, Sussman et al. - 1976
1   Miller: MultiScheme: A Parallel Processing System Based on M.. (context) - James - 1987
1   Matthias Felleisen: Control Delimiters and their Hierarchies (context) - Sitaram - 1989
1   Steve Hardy: Integrating Prolog in the POPLOG Environment (context) - Mellish - 1984
1   Stoy: The Congruence of Two Programming Language Definitions (context) - Joseph - 1981
1   No 65 on Putting Scheme to Work (context) - Danvy, Tighter et al. - 1989
1   Trevor Jim: Continuation-Passing (context) - Appel - 1989
1   Christopher Strachey: A Theory of Programming Language Seman.. (context) - Milne - 1976
1   Lecture Notes in Computer Science No 14 pp (context) - Reynolds, Relation et al. - 1974
1   Adrian Tang: Constructing Call-by-Value Continuation Semanti.. (context) - Sethi - 1980



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.impmonads.html):   More
Representing Monads - Filinski (1994)   (Correct)
A Framework for Deterministically Interleaved Interactive.. - Achten, Plasmeijer (1994)   (Correct)
The Transformation Calculus and its Typing - Jacques Garrigue (1993)   (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