On the dynamic extent of delimited continuations

Information Processing Letters

Volumn 96, Issue 1, 2005, Pages 7-17

  Biernacki, Dariusz ^a   Danvy, Olivier ^a   Shan, Chung Chieh ^b  

^a AARHUS UNIVERSITY   (Denmark)

^b HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL OPERATORS; PROBLEM SOLVING;

BREADTH-FIRST TRAVERSAL; LITERATURE;

CONTROL SYSTEM ANALYSIS;

EID: 24144448075     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2005.04.003     Document Type: Article

References (22)

1. V. Balat, Une étude des sommes fortes: isomorphismes et formes normales, PhD thesis, PPS, Université Denis Diderot (Paris VII), Paris, France, December 2002
2. M. Biernacka, D. Biernacki, O. Danvy, An operational foundation for delimited continuations in the CPS hierarchy (revised version), Technical report BRICS RS-05-11, DAIMI, Department of Computer Science, University of Aarhus, Aarhus, Denmark, March 2005. A preliminary version was presented at the Fourth ACM SIGPLAN Workshop on Continuations (CW 2004)
3. D. Biernacki, O. Danvy, A simple proof of a folklore theorem about delimited control, Technical Report BRICS RS-05-10, DAIMI, Department of Computer Science, University of Aarhus, Aarhus, Denmark, March 2005
4. D. Biernacki, O. Danvy, C. Shan, On the dynamic extent of delimited continuations, Technical report BRICS RS-05-13, DAIMI, Department of Computer Science, University of Aarhus, Aarhus, Denmark, April 2005. Extended version of the present article
5. O. Danvy, On evaluation contexts, continuations, and the rest of the computation, in: H. Thielecke (Ed.), Proc. 4th ACM SIGPLAN Workshop on Continuations, Technical report CSR-04-1, Department of Computer Science, Queen Mary's College, Venice, Italy, January 2004, pp. 13-23. Invited talk
6. O. Danvy, A. Filinski, Abstracting control, in: M. Wand (Ed.), Proc. 1990 ACM Conf. on Lisp and Functional Programming, Nice, France, ACM Press, June 1990, pp. 151-160
7. O. Danvy, L.R. Nielsen, Defunctionalization at work, in: H. Søndergaard (Ed.), Proc. 3rd Internat. ACM SIGPLAN Conf. on Principles and Practice of Declarative Programming (PPDP'01), Firenze, Italy, ACM Press, September 2001, pp. 162-174. Extended version available as the Technical report BRICS RS-01-23
8. M. Felleisen, The theory and practice of first-class prompts, in: J. Ferrante, P. Mager (Eds.), Proc. 15th Annual ACM Symp. on Principles of Programming Languages, San Diego, CA, ACM Press, January 1988, pp. 180-190
9. M. Felleisen, and D.P. Friedman Control operators, the SECD machine, and the λ-calculus M. Wirsing Formal Description of Programming Concepts III 1986 Elsevier Science Publishers B.V. (North-Holland) Amsterdam 193 217
10. M. Felleisen, M. Wand, D.P. Friedman, B.F. Duba, Abstract continuations: A mathematical semantics for handling full functional jumps, in: R.C. Cartwright (Ed.), Proc. 1988 ACM Conf. on Lisp and Functional Programming, Snowbird, UT, ACM Press, July 1988, pp. 52-62
11. A. Filinski, Representing monads, in: H.-J. Boehm (Ed.), Proc. 21st Annual ACM Symp. on Principles of Programming Languages, Portland, OR, ACM Press, January 1994, pp. 446-457
12. C. Gunter, D. Rémy, J.G. Riecke, A generalization of exceptions and control in ML-like languages, in: S. Peyton Jones (Ed.), Proc. 7th ACM Conf. on Functional Programming and Computer Architecture, La Jolla, CA, ACM Press, June 1995, pp. 12-23
13. J. McCarthy Another samefringe SIGART Newslett. 61 1977
14. A. Nanevski, Functional programming with names and necessity, PhD thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, Pennsylvania, June 2004. Technical report CMU-CS-04-151
15. C. Okasaki, Breadth-first numbering: lessons from a small exercise in algorithm design, in: P. Wadler (Ed.), Proc. 2000 ACM SIGPLAN Internat. Conf. on Functional Programming, in: SIGPLAN Notices, vol. 35, ACM Press, Montréal, Canada, September 2000, pp. 131-136
16. G.D. Plotkin Call-by-name, call-by-value and the λ-calculus Theoret. Comput. Sci. 1 1975 125 159
17. J.C. Reynolds Definitional interpreters for higher-order programming languages Higher-Order Symbolic Comput. 11 4 1998 363 397 Reprinted from the Proceedings of the 25th ACM National Conference, 1972, with a foreword
18. C. Shan, Shift to control, in: O. Shivers, O. Waddell (Eds.), Proc. 2004 ACM SIGPLAN Workshop on Scheme and Functional Programming, Snowbird, UT, September 2004
19. G.L. Steele Jr., Rabbit: A compiler for Scheme, Master's thesis, Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA, May 1978. Technical report AI-TR-474
20. C. Strachey, and C.P. Wadsworth Continuations: A mathematical semantics for handling full jumps Higher-Order Symbolic Comput. 13 1/2 2000 135 152 Reprint of the Technical Monograph PRG-11, Oxford University Computing Laboratory, 1974, with a foreword
21. G.J. Sussman, and G.L. Steele Jr. Scheme: An interpreter for extended lambda calculus Higher-Order Symbolic Comput. 11 4 1998 405 439 Reprinted from the AI Memo 349, MIT (1975), with a foreword
22. M. Wand Continuation-based program transformation strategies J. ACM 27 1 1980 164 180