Olivier Danvy, Andrzej Filinski  Home/Search
Context Related
| daimi.au.dk/~danvy/Papers/fatc.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: daimi.au.dk/~danvy/research (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: ion of Typed Contexts Olivier Danvy & Andrzej Filinski DIKU -- Computer Science Department, University of Copenhagen Universitetsparken 1, 2100 Copenhagen , Denmark uucp: danvy@diku.dk & andrzej@diku.dk Abstract This report investigates abstracting control with functions. This is achieved by defining continuations as functions abstracting lexically a delimited context [C[ ]] rather than dynamically an unlimited one C[ ], as it is usually the case. Because their co-domain is distinguished from... (Update)
Context of citations to this paper: More
...we do not need to extend the system with any additional reduction rules. With C and prompt one could also de ne shift and reset [DF89,DF90] as (shift M) C ( k:M( x:#(kx) This was also observed by Filinsky in [Fil94] We plan to investigate these additional calculi and...
...greatly, though the resulting programs are sometimes rather devious. Composable continuations, as devised by Danvy and Filinski [2, 3, 4], support additional operations shift and reset . These even further increase the programmer s power of expression, and can...
Cited by: More
Reasoning about Continuations - With Control Effects (Correct)
An Operational Foundation for Delimited Continuations.. - Biernacka, Biernacki.. (2004) (Correct)
A Modal Calculus for Effect Handling - Nanevski (2003) (Correct)
Active bibliography (related documents): More All
2.5: Declarative Continuations and Categorical Duality - Filinski (1989) (Correct)
1.5: Abstracting Control - Danvy, Filinski (1990) (Correct)
0.6: On some Functional Aspects of Control - Danvy (1988) (Correct)
Similar documents based on text: More All
0.5: Monads and Composable Continuations - Wadler (1993) (Correct)
0.3: Classical Logic, Continuation Semantics and Abstract Machines - Streicher, Reus (1998) (Correct)
0.2: Intensions and Extensions in a Reflective Tower - Danvy, Malmkjær (1988) (Correct)
Related documents from co-citation: More All
10: The theory and practice of first-class prompts (context) - Felleisen - 1988
8: Abstracting control - Danvy, Filinski - 1990
5: Abstract continuations: A mathematical semantics for handling full functional ju.. (context) - Felleisen, Wand et al. - 1988
BibTeX entry: (Update)
O. Danvy and A. Filinski. A functional abstraction of typed contexts. Technical Report 89/12, DIKU, University of Copenhagen, July 1989. http://citeseer.ist.psu.edu/danvy89functional.html More
@techreport{ danvy89functional,
author = "Olivier Danvy and Andrzej Filinski",
title = "A Functional Abstraction of Typed Contexts",
number = "89/12",
year = "1989",
url = "citeseer.ist.psu.edu/danvy89functional.html" }
Citations (may not include all citations):220 ORBIT: An Optimizing Compiler for Scheme (context) - Kranz - 1986
197 Revised 3 Report on the Algorithmic Language Scheme - Rees, Clinger - 1986
116 RABBIT: a Compiler for SCHEME (context) - Steele - 1978
14 Journal of Computer and System Sciences (context) - Milner, of et al. - 1978
7 Department of Computer Science (context) - Felleisen, of et al. - 1987
5 Computer Science Department (context) - Felleisen, Friedman et al. - 1987
4 Duba: Abstract Continuations: A Mathematical Semantics for H.. (context) - Felleisen, Wand et al. - 1988
4 Wadsworth: Continuations: A Mathematical Semantics for Handl.. (context) - Strachey - 1974
3 Computer Science Department (context) - Plotkin, Approach et al. - 1981
3 Schmidt: Denotational Semantics: A Methodology for Language .. (context) - David - 1986
2 Schmidt: Detecting Global Variables in Denotational Definiti.. (context) - David - 1985
2 Journal of the ACM (context) - Sethi, Tang et al. - 1980
2 Mazurkiewicz: Proving Algorithms by Tail Functions (context) - Antoni - 1971
2 the Ultimate Imperative (context) - Steele, Gerald et al. - 1976
2 Fischer: Lambda Calculus Schemata (context) - Michael - 1972
2 Stoy: Denotational Semantics: The Scott-Strachey Approach to.. (context) - Joseph - 1977
2 Appel and Trevor Jim: Continuation-Passing (context) - Andrew - 1989
2 Reynolds: Definitional Interpreters for Higher-Order Program.. (context) - John - 1972
1 Johnson: GL -- A Denotational Testbed with Continuations and.. (context) - Gregory - 1987
1 BIGRE special issue: Putting the Scheme Language to Work (context) - Danvy, Tighter - 1989
1 Johnson and Dominic Duggan: Stores and Partial Continuations.. (context) - Gregory - 1988
1 Dijkstra: Recursive Programming (context) - Edger - 1960
1 Reynolds: On the Relation between Direct and Continuation Se.. (context) - John - 1974
1 Friedman: The Mystery of the Tower Revealed: A Non-Reflectiv.. (context) - Wand - 1988
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.daimi.au.dk/~danvy/research.html):
Three Steps for the CPS Transformation - Danvy (1991) (Correct)
On some Functional Aspects of Control - Danvy (1988) (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