On the Dynamic Extent of Delimited Continuations

On the Dynamic Extent of Delimited Continuations (2005)

Cached

Download Links

by Dariusz Biernacki , Olivier Danvy

Citations:

BibTeX

@MISC{Biernacki05onthe,
    author = {Dariusz Biernacki and Olivier Danvy},
    title = { On the Dynamic Extent of Delimited Continuations},
    year = {2005}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Citations

573	The Definition of Standard ML (Revised - Milner, Tofte, et al. - 1997
263	Definitional interpreters for higher-order programming languages - Reynolds - 1972
206	A formulae-as-types notion of control - Griffin - 1990
174	Call-by-name, call-by-value and the λ-calculus - Plotkin - 1976
122	The theory and practice of first-class prompts - Felleisen - 1988
116	Representing monads - Filinski - 1994
101	Danvy and Andrzej Filinski. Representing control, a study of the CPS transformation - Olivier - 1992
97	C.P.: Continuations: A mathematical semantics for handling full jumps - Strachey, Wadsworth - 1974
91	RABBIT: a compiler for SCHEME - JR, L - 1978
83	How to replace failure by a list of successes - Wadler - 1985
79	Abstracting control - Danvy, Filinski - 1990
78	CONS Should Not Evaluate its Arguments - Friedman, Wise - 1976
73	Jr., A lazy evaluator - Henderson, Morris - 1976
70	D.P.: Control operators, the SECD machine and the λcalculus - Felleisen, Friedman - 1986
64	Continuation semantics in typed lambda-calculi (summary - Meyer, Wand - 1985
64	Scheme: an interpreter for the extended lambda calculus - Steele, Sussman - 1975
61	Extracting Constructive Content from Classical Proofs - Murthy - 1990
60	Categorical Structure of Continuation Passing Style - Thielecke - 1997
59	Defunctionalization at work - Danvy, Nielsen - 2001
58	A functional abstraction of typed contexts - Danvy, Filinski - 1989
57	Abstract continuations: A mathematical semantics for handling full functional jumps - Felleisen, Wand, et al.
54	A generalization of exceptions and control in ML-like languages - Gunter, Rémy, et al. - 1995
51	with Julie Sussman, Structure and Interpretation of Computer Programs - Abelson, Sussman - 1985
49	Danvy and Andrzej Filinski. Abstracting control - Olivier - 1990
49	Continuation-based program transformation strategies - Wand - 1980
45	Controlling Effects - Filinski - 1996
40	Recycling continuations - Sobel, Friedman - 1998
38	The Calculi of λ-v-CS Conversion: A Syntactic Theory of Control and State in Imperative Higher-Order Programming Languages - Felleisen - 1987
33	Ordered Linear Logic and Applications - Polakow - 2001
31	A scheme for a higher-level semantic algebra - Clinger, Friedman, et al. - 1985
31	A semantic analysis of control - Laird - 1998
30	A dynamic extent control operator for partial continuations - Queinnec, Serpette - 1991
30	A Generalization of Jumps and Labels - Landin - 1965
29	Reasoning with continuations ii: full abstraction for models of control. Pages 161–175 of: Lfp ’90 - Sitaram, Felleisen - 1990
27	Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums - Balat, Cosmo, et al.
25	Deriving backtracking monad transformers - Hinze - 2000
23	and Partial Continuations as First-Class Objects in a Language and its Environment - Johnson, Duggan - 1988
21	Steele Jr. "Scheme: An Interpreter for Ex tended Lambda Calculus - Sussman, Lewis - 1975
20	On evaluation contexts, continuations, and the rest of the computation - Danvy - 2004
20	Shift to control - Shan - 2004
20	S.: Combinators for logic programming - Spivey, Seres
19	O.: From interpreter to logic engine by defunctionalization - Biernacki, Danvy - 2003
19	Partial continuations as the difference of continuations. A duumvirate of control operators. Lecture notes in computer science - Moreau, Queinnec - 1994
19	Breadth-First Numbering: Lessons from a Small Exercise - Okasaki - 2000
17	An operational foundation for delimited continuations in the CPS hierarchy - Biernacka, Biernacki, et al. - 2005
17	A syntactic correspondence between context-sensitive calculi and abstract machines - Biernacka, Danvy - 2007
14	Memoization in type-directed partial evaluation - Balat, Danvy - 2002
14	On implementing Prolog in functional programming - Carlsson - 1984
14	How to remove a dynamic prompt: Static and dynamic delimited continuation operators are equally expressible - Kiselyov - 2005
13	A simple proof of a folklore theorem about delimited control - Biernacki, Danvy