On the static and dynamic extents of delimited continuations

Science of Computer Programming

Volumn 60, Issue 3, 2006, Pages 274-297

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

^a AARHUS UNIVERSITY   (Denmark)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

Continuation passing style (CPS); Control and prompt; Control operators; CPS transformation; Defunctionalization; Delimited continuations; Direct style; Shift and reset

Indexed keywords

MATHEMATICAL OPERATORS; QUEUEING THEORY;

CONTINUATION-PASSING STYLE (CPS); CONTROL AND PROMPT; CONTROL OPERATORS; CPS TRANSFORMATION; DEFUNCTIONALIZATION; DELIMITED CONTINUATIONS; DIRECT STYLE; SHIFT AND RESET;

COMPUTER PROGRAMMING;

EID: 33646054858     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.scico.2006.01.002     Document Type: Article

References (85)

1. Abelson H., Sussman G.J., and Sussman J. Structure and Interpretation of Computer Programs (1985), The MIT Press, Cambridge, Massachusetts
2. Vincent Balat, Une étude des sommes fortes: isomorphismes et formes normales, Ph.D. Thesis, PPS, Université Denis Diderot (Paris VII), Paris, France, December 2002
3. Balat V., Di Cosmo R., and Fiore M.P. Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums. In: Leroy X. (Ed). Proceedings of the Thirty-First Annual ACM Symposium on Principles of Programming Languages. Venice, Italy (January 2004), ACM Press 64-76
4. Balat V., and Danvy O. Memorization in type-directed partial evaluation. In: Batory D., Consel C., and Taha W. (Eds). Proceedings of the 2002 ACM SIGPLAN/SIGSOFT Conference on Generative Programming and Component Engineering, October 2002, Pittsburgh, Pennsylvania. Lecture Notes in Computer Science vol. 2487 (2002), Springer-Verlag 78-92
5. Josh Berdine, Linear and Affine Typing of Continuation-Passing Style, Ph.D. Thesis, Queen Mary, University of London, 2004
6. Małgorzata Biernacka, A Derivational Approach to the Operational Semantics of Functional Languages, Ph.D. Thesis, BRICS Ph.D. School, University of Aarhus, Aarhus, Denmark, January 2006
7. Biernacka M., Biernacki D., and Danvy O. An operational foundation for delimited continuations in the CPS hierarchy. Logical Methods in Computer Science 1 2:5 (2005) 1-39 A preliminary version was presented at the Fourth ACM SIGPLAN Workshop on Continuations (CW 2004)
8. Małgorzata Biernacka, Olivier Danvy, A syntactic correspondence between context-sensitive calculi and abstract machines, Research Report BRICS RS-05-38, DAIMI, Department of Computer Science, University of Aarhus, Aarhus, Denmark, December 2005
9. Dariusz Biernacki, The Theory and Practice of Programming Languages with Delimited Continuations, Ph.D. Thesis, BRICS Ph.D. School, University of Aarhus, Aarhus, Denmark, December 2005
10. Biernacki D., and Danvy O. From interpreter to logic engine by defunctionalization. In: Bruynooghe M. (Ed). Logic Based Program Synthesis and Transformation, 13th International Symposium, LOPSTR 2003. Uppsala, Sweden. Lecture Notes in Computer Science vol. 3018 (August 2003), Springer-Verlag 143-159
11. Dariusz Biernacki, Olivier Danvy, A simple proof of a folklore theorem about delimited control, Research Report BRICS RS-05-25, DAIMI, Department of Computer Science, University of Aarhus, Aarhus, Denmark, August 2005, Theoretical Pearl, Journal of Functional Programming (in press)
12. Dariusz Biernacki, Olivier Danvy, Kevin Millikin, A dynamic continuation-passing style for dynamic delimited continuations, Research Report BRICS RS-05-16, DAIMI, Department of Computer Science, University of Aarhus, Aarhus, Denmark, May 2005
13. Biernacki D., Danvy O., and Shan C.-c. On the dynamic extent of delimited continuations. Information Processing Letters 96 1 (2005) 7-17
14. Carlsson M. On implementing Prolog in functional programming. New Generation Computing 2 4 (1984) 347-359
15. In: Cartwright R.(C.) (Ed). Proceedings of the Eighteenth Annual ACM Symposium on Principles of Programming Languages (January 1991), ACM Press, Orlando, Florida
16. Charniak E., Riesbeck C., and McDermott D. Artificial Intelligence Programming (1980), Lawrence Earlbaum Associates
17. Clinger W., Friedman D.P., and Wand M. A scheme for a higher-level semantic algebra. In: Reynolds J., and Nivat M. (Eds). Algebraic Methods in Semantics (1985), Cambridge University Press 237-250
18. Olivier Danvy, On some functional aspects of control, in: Thomas Johnsson, Simon Peyton Jones, Kent Karlsson (Eds.) Proceedings of the Workshop on Implementation of Lazy Functional Languages, Program Methodology Group, University of Göteborg and Chalmers University of Technology, September 1988, pp. 445-449, Report 53
19. Olivier Danvy, Programming with tighter control, Bigre Journal: Putting Scheme to Work 65 (July) (1989) 10-29 (special issue)
20. Olivier Danvy, On evaluation contexts, continuations, and the rest of the computation, in: Hayo Thielecke (Ed.) Proceedings of the Fourth 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)
21. Olivier Danvy, Andrzej Filinski, A functional abstraction of typed contexts, DIKU Rapport 89/12, DIKU, Computer Science Department, University of Copenhagen, Copenhagen, Denmark, July 1989
22. Olivier Danvy, Andrzej Filinski, Abstracting control, in: Wand [81], pp. 151-160
23. Danvy O., and Filinski A. Representing control, a study of the CPS transformation. Mathematical Structures in Computer Science 2 4 (1992) 361-391
24. Danvy O., Grobauer B., and Rhiger M. A unifying approach to goal-directed evaluation. New Generation Computing 20 1 (2002) 53-73 Extended version available as the technical report BRICS RS-01-29. A preliminary version was presented at the Second International Workshop on Semantics, Applications, and Implementation of Program Generation (SAIG 2001)
25. Danvy O., and Nielsen L.R. Defunctionalization at work. In: Søndergaard H. (Ed). Proceedings of the Third International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, PPDP'01. September 2001, Firenze, Italy (2001), ACM Press 162-174 Extended version available as the technical report BRICS RS-01-23
26. Bruce F. Duba, Robert Harper, David B. MacQueen, Typing first-class continuations in ML, in: Cartwright [15], pp. 163-173
27. R. Kent Dybvig, Simon Peyton-Jones, Amr Sabry, A monadic framework for subcontinuations, Technical Report 615, Computer Science Department, Indiana University, Bloomington, Indiana, June 2005
28. Matthias Felleisen, The Calculi of λ-v-CS Conversion: A Syntactic Theory of Control and State in Imperative Higher-Order Programming Languages, Ph.D. Thesis, Computer Science Department, Indiana University, Bloomington, Indiana, August 1987
29. Matthias Felleisen, The theory and practice of first-class prompts, in: Ferrante and Mager [33], pp. 180-190
30. Felleisen M., and Friedman D.P. Control operators, the SECD machine, and the λ-calculus. In: Wirsing M. (Ed). Formal Description of Programming Concepts III (1986), Elsevier Science Publishers B.V., North-Holland, Amsterdam 193-217
31. Matthias Felleisen, Daniel P. Friedman, Bruce Duba, John Merrill, Beyond continuations, Technical Report 216, Computer Science Department, Indiana University, Bloomington, Indiana, February 1987
32. Felleisen M., Wand M., Friedman D.P., and Duba B.F. Abstract continuations: A mathematical semantics for handling full functional jumps. In: Cartwright R.(C.) (Ed). Proceedings of the 1988 ACM Conference on Lisp and Functional Programming. Snowbird, Utah (July 1988), ACM Press 52-62
33. In: Ferrante J., and Mager P. (Eds). Proceedings of the Fifteenth Annual ACM Symposium on Principles of Programming Languages. San Diego, California (January 1988), ACM Press
34. Filinski A. Representing monads. In: Boehm H.-J. (Ed). Proceedings of the Twenty-First Annual ACM Symposium on Principles of Programming Languages. Portland, Oregon (January 1994), ACM Press 446-457
35. Andrzej Filinski, Controlling Effects, Ph.D. Thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, Pennsylvania, May 1996, Technical Report CMU-CS-96-119
36. Friedman D.P., and Wise D.S. CONS should not evaluate its arguments. In: Michaelson S., and Milner R. (Eds). Third International Colloquium on Automata, Languages, and Programming (July 1976), Edinburgh University Press, Edinburgh, Scotland 257-284
37. Carsten Führmann, The Structure of Call-by-Value, Ph.D. Thesis, University of Edinburgh, Edinburgh, Scotland, 2000
38. Griffin T.G. A formulae-as-types notion of control. In: Hudak P. (Ed). Proceedings of the Seventeenth Annual ACM Symposium on Principles of Programming Languages. San Francisco, California (January 1990), ACM Press 47-58
39. Gunter C., Rémy D., and Riecke J.G. A generalization of exceptions and control in ML-like languages. In: Peyton Jones S. (Ed). Proceedings of the Seventh ACM Conference on Functional Programming and Computer Architecture. La Jolla, California (June 1995), ACM Press 12-23
40. John Hatcliff, The Structure of Continuation-Passing Styles, Ph.D. Thesis, Department of Computing and Information Sciences, Kansas State University, Manhattan, Kansas, June 1994
41. Henderson P., and Morris Jr. J.H. A lazy evaluator. In: Graham S.L. (Ed). Proceedings of the Third Annual ACM Symposium on Principles of Programming Languages (January 1976), ACM Press 95-103
42. Hieb R., Dybvig R.K., and Anderson III C.W. Subcontinuations, Lisp and Symbolic Computation 5 4 (1993) 295-326
43. Ralf Hinze, Deriving backtracking monad transformers, in: Wadler [79], pp. 186-197
44. Johnson G.F. GL - a denotational testbed with continuations and partial continuations as first-class objects. In: Johnson M.S. (Ed). Proceedings of the ACM SIGPLAN'87 Symposium on Interpreters and Interpretive Techniques. Saint-Paul, Minnesota. SIGPLAN Notices vol. 22, No. 7 (June 1987), ACM Press 154-176
45. Gregory F. Johnson, Dominic Duggan, Stores and partial continuations as first-class objects in a language and its environment, in: Ferrante and Mager [33], pp. 158-168
46. 5 report on the algorithmic language Scheme. In: Kelsey R., Clinger W., and Rees J. (Eds). Higher-Order and Symbolic Computation 11 1 (1998) 7-105
47. Oleg Kiselyov, How to remove a dynamic prompt: Static and dynamic delimited continuation operators are equally expressible, Technical Report 611, Computer Science Department, Indiana University, Bloomington, Indiana, March 2005
48. Kiselyov O., Shan C.-c., Friedman D.P., and Sabry A. Backtracking, interleaving, and terminating monad transformers. In: Pierce B. (Ed). Proceedings of the 2005 ACM SIGPLAN International Conference on Functional Programming. Tallinn, Estonia. SIGPLAN Notices vol. 40, No. 9 (September 2005), ACM Press 192-203
49. Jim Laird, A Semantic Analysis of Control, Ph.D. Thesis, University of Edinburgh, Edinburgh, Scotland, 1998
50. Peter J. Landin, A generalization of jumps and labels, Technical Report, UNIVAC Systems Programming Research, 1965. Reprinted in: Higher-Order and Symbolic Computation 11(2) (1998) 125-143 (With a forward [77])
51. Julia L. Lawall, Continuation Introduction and Elimination in Higher-Order Programming Languages, Ph.D. Thesis, Computer Science Department, Indiana University, Bloomington, Indiana, July 1994
52. McCarthy J. Another samefringe. SIGART Newsletter 61 February (1977)
53. Mellish C., and Hardy S. Integrating Prolog in the POPLOG environment. In: Campbell J.A. (Ed). Implementations of PROLOG (1984), Ellis Horwood 147-162
54. Meyer A.R., and Wand M. Continuation semantics in typed lambda-calculi (summary). In: Parikh R. (Ed). Logics of Programs - Proceedings. Brooklyn, New York. Lecture Notes in Computer Science vol. 193 (June 1985), Springer-Verlag 219-224
55. Milner R., Tofte M., Harper R., and MacQueen D. The Definition of Standard ML (Revised) (1997), The MIT Press
56. Moreau L., and Queinnec C. Partial continuations as the difference of continuations, a duumvirate of control operators. In: Hermenegildo M., and Penjam J. (Eds). Sixth International Symposium on Programming Language Implementation and Logic Programming. Lecture Notes in Computer Science vol. 844 (September 1994), Springer-Verlag, Madrid, Spain 182-197
57. Chetan R. Murthy, Extracting Constructive Content from Classical Proofs, Ph.D. Thesis, Department of Computer Science, Cornell University, Ithaca, New York, 1990
58. Aleksandar Nanevski, Functional Programming with Names and Necessity, Ph.D. Thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, Pennsylvania, June 2004, Technical Report CMU-CS-04-151
59. Lasse R. Nielsen, A Study of Defunctionalization and Continuation-Passing Style, Ph.D. Thesis, BRICS Ph.D. School, University of Aarhus, Aarhus, Denmark, July 2001, BRICS DS-01-7
60. Chris Okasaki, Breadth-first numbering: lessons from a small exercise in algorithm design, in: Wadler [79], pp. 131-136
61. Plotkin G.D. Call-by-name, call-by-value and the λ-calculus. Theoretical Computer Science 1 (1975) 125-159
62. Jeff Polakow, Ordered Linear Logic and Applications, Ph.D. Thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, Pennsylvania, August 2001, Technical Report CMU-CS-01-152
63. Queinnec C. Value transforming style. In Proceedings of the Second International Workshop on Static Analysis WSA'92. Bordeaux, France. Bigre Journal vol. 81-82 (September 1992), IRISA, Rennes, France 20-28
64. Christian Queinnec, Bernard Serpette, A dynamic extent control operator for partial continuations, in: Cartwright [15], pp. 174-184
65. John C. Reynolds, Definitional interpreters for higher-order programming languages, in: Proceedings of the 25th ACM National Conference, Boston, MA, 1972, pp. 717-740. Reprinted in: Higher-Order and Symbolic Computation 11 (4) (1998) 363-397 (With a foreword [83])
66. Amr Sabry, The Formal Relationship between Direct and Continuation-Passing Style Optimizing Compilers: A Synthesis of Two Paradigms, Ph.D. Thesis, Computer Science Department, Rice University, Houston, Texas, August 1994, Technical report 94-242
67. Sandewall E. An early use of continuations and partial evaluation for compiling rules written in FOPC. Higher-Order and Symbolic Computation 12 1 (1999) 105-113
68. Chung-chieh Shan, Shift to control, in: Olin Shivers, Oscar Waddell (Eds.), Proceedings of the 2004 ACM SIGPLAN Workshop on Scheme and Functional Programming, Technical report TR600, Computer Science Department, Indiana University, Snowbird, Utah, September 2004
69. Chung-chieh Shan, Linguistic Side Effects, Ph.D. Thesis, Division of Engineering and Applied Science, Harvard University, September 2005
70. Dorai Sitaram, Models of Control and their Implications for Programming Language Design, Ph.D. Thesis, Computer Science Department, Rice University, Houston, Texas, April 1994
71. Dorai Sitaram, Matthias Felleisen, Reasoning with continuations II: Full abstraction for models of control, in: Wand [81], pp. 161-175
72. Spivey M., and Seres S. Combinators for logic programming. In: Gibbons J., and de Moor O. (Eds). The Fun of Programming (2003), Palgrave Macmillan 177-199
73. Guy L. Steele Jr., Rabbit: A Compiler for Scheme, Master's Thesis, Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, Massachusetts, May 1978, Technical Report AI-TR-474
74. Christopher Strachey, Christopher P. Wadsworth, Continuations: A mathematical semantics for handling full jumps, Technical monograph, PRG-11, Oxford University Computing Laboratory, Programming Research Group, Oxford, England, 1974. Reprinted in: Higher-Order and Symbolic Computation 13 (1-2) (2000) 135-152 (With a foreword [84])
75. Gerald J. Sussman, Guy L. Steele Jr., SCHEME: An interpreter for extended lambda calculus, AI Memo 349, Artifical Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, Massachusetts, December 1975. Reprinted in: Higher-Order and Symbolic Computation 11 (4) (1998) 405-439 (With a foreword [85])
76. Hayo Thielecke, Categorical Structure of Continuation Passing Style, Ph.D. Thesis, University of Edinburgh, Edinburgh, Scotland, 1997, ECS-LFCS-97-376
77. Thielecke H. An introduction to Landin's "A generalization of jumps and labels". Higher-Order and Symbolic Computation 11 2 (1998) 117-124
78. Wadler P. How to replace failure by a list of successes. In: Jouannaud J.-P. (Ed). Functional Programming Languages and Computer Architecture. Lecture Notes in Computer Science vol. 201 (September 1985), Springer-Verlag, Nancy, France 113-128
79. In: Wadler P. (Ed). Proceedings of the 2000 ACM SIGPLAN International Conference on Functional Programming. Montréal, Canada. SIGPLAN Notices vol. 35, No. 9 (September 2000), ACM Press
80. Wand M. Continuation-based program transformation strategies. Journal of the ACM 27 1 (1980) 164-180
81. In: Wand M. (Ed). Proceedings of the 1990 ACM Conference on Lisp and Functional Programming. Nice, France (June 1990), ACM Press
82. Wand M., and Vaillancourt D. Relating models of backtracking. In: Fisher K. (Ed). Proceedings of the 2004 ACM SIGPLAN International Conference on Functional Programming. Snowbird, Utah. SIGPLAN Notices vol. 39, No. 9 (September 2004), ACM Press 54-65
83. Reynolds J.C. Definitional interpreters revisited. Higher-Order and Symbolic Computation 11 4 (1998) 355-361
84. Wadsworth C.P. Continuations revisited. Higher-Order and Symbolic Computation 13 1-2 (2000) 131-133
85. Sussman G.J., and Steele Jr. G.L. The first report on Scheme revisited. Higher-Order and Symbolic Computation 11 4 (1998) 399-404