An operational foundation for delimited continuations in the cps hierarchy

Logical Methods in Computer Science

Volumn 1, Issue 2, 2005, Pages

  Biernacka, Małgorzata ^a   Biernacki, Dariusz ^a   Danvy, Olivier ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

Abstract machines; Delimited continuations; Reduction semantics

Indexed keywords

CALCULATIONS; DIFFERENTIATION (CALCULUS);

ABSTRACT MACHINES; CONTINUATION-PASSING STYLE; DELIMITED CONTINUATIONS; EXPLICIT REPRESENTATION; HIERARCHICAL LANGUAGES; NORMALIZATION BY EVALUATION; OPERATIONAL SEMANTICS; REDUCTION SEMANTICS;

SEMANTICS;

EID: 84991617302     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-1(2:5)2005     Document Type: Article

References (82)

1. Mads Sig Ager, Dariusz Biernacki, Olivier Danvy, and Jan Midtgaard. A functional correspondence be-tween evaluators and abstract machines. In Dale Miller, editor, Proceedings of the Fifth ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming (PPDP’03), pages 8-19. ACM Press, August 2003.
2. Mads Sig Ager, Olivier Danvy, and Jan Midtgaard. A functional correspondence between call-by-need evaluators and lazy abstract machines. Information Processing Letters, 90(5):223-232, 2004. Extended version available as the technical report BRICS-RS-04-3.
3. Mads Sig Ager, Olivier Danvy, and Jan Midtgaard. A functional correspondence between monadic eval-uators and abstract machines for languages with computational effects. Theoretical Computer Science, 342(1):149-172, 2005. Extended version available as the technical report BRICS RS-04-28.
4. Thorsten Altenkirch, Martin Hofmann, and Thomas Streicher. Categorical reconstruction of a reduction-free normalization proof. In David H. Pitt, David E. Rydeheard, and Peter Johnstone, editors, Category Theory and Computer Science, number 953 in Lecture Notes in Computer Science, pages 182-199, Cambridge, UK, August 1995. Springer-Verlag.
5. Zena M. Ariola, Hugo Herbelin, and Amr Sabry. A type-theoretic foundation of continuations and prompts. In Fisher[45], pages 40-53.
6. Kenichi Asai. Online partial evaluation for shift and reset. In Peter Thiemann, editor, Proceedings of the 2002 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation (PEPM 2002), SIGPLAN Notices, Vol. 37, No 3, pages 19-30, Portland, Oregon, March 2002. ACM Press.
7. Kenichi Asai. Offline partial evaluation for shift and reset. In Nevin Heintze and Peter Sestoft, editors, Proceedings of the 2004 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation (PEPM 2004), pages 3-14, Verona, Italy, August 2003. ACM Press.
8. Vincent Balat, Roberto Di Cosmo, and Marcelo P. Fiore. Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums. In Xavier Leroy, editor, Proceedings of the Thirty-First Annual ACM Symposium on Principles of Programming Languages, pages 64-76, Venice, Italy, January 2004. ACM Press.
9. Vincent Balat and Olivier Danvy. Memoization in type-directed partial evaluation. In Don Batory, Charles Consel, and Walid Taha, editors, Proceedings of the 2002 ACM SIGPLAN/SIGSOFT Conference on Generative Programming and Component Engineering, number 2487 in Lecture Notes in Computer Science, pages 78-92, Pittsburgh, Pennsylvania, October 2002. Springer-Verlag.
10. Anindya Banerjee, Nevin Heintze, and Jon G. Riecke. Design and correctness of program transforma-tions based on control-flow analysis. In Naoki Kobayashi and Benjamin C. Pierce, editors, Theoretical Aspects of Computer Software, 4th International Symposium, TACS 2001, number 2215 in Lecture Notes in Computer Science, pages 420-447, Sendai, Japan, October 2001. Springer-Verlag.
11. Nuel D. Belnap. How a computer should think. In Gilbert Ryle, editor, Proceedings of the Oxford International Symposium on Contemporary Aspects of Philosophy, pages 30-56, Oxford, England, 1976. Oriel Press.
12. Ulrich Berger, Matthias Eberl, and Helmut Schwichtenberg. Normalization by evaluation. In Bernhard Möller and John V. Tucker, editors, Prospects for hardware foundations (NADA), number 1546 in Lecture Notes in Computer Science, pages 117-137, Berlin, Germany, 1998. Springer-Verlag.
13. Ulrich Berger and Helmut Schwichtenberg. An inverse of the evaluation functional for typed λ-calculus. In Gilles Kahn, editor, Proceedings of the Sixth Annual IEEE Symposium on Logic in Computer Science, pages 203-211, Amsterdam, The Netherlands, July 1991. IEEE Computer Society Press.
14. Ilya Beylin and Peter Dybjer. Extracting a proof of coherence for monoidal categories from a proof of normalization for monoids. In Stefano Berardi and Mario Coppo, editors, Types for Proofs and Programs, International Workshop TYPES’95, number 1158 in Lecture Notes in Computer Science, pages 47-61, Torino, Italy, June 1995. Springer-Verlag.
15. Małgorzata Biernacka and Olivier Danvy. A concrete framework for environment machines. Research Report BRICS RS-05-15, DAIMI, Department of Computer Science, University of Aarhus, Aarhus, Denmark, May 2005.
16. Małgorzata Biernacka and Olivier Danvy. A syntactic correspondence between context-sensitive calculi and abstract machines. Research Report BRICS RS-05-22, DAIMI, Department of Computer Science, University of Aarhus, Aarhus, Denmark, July 2005.
17. Dariusz Biernacki and Olivier Danvy. From interpreter to logic engine by defunctionalization. In Mau-rice Bruynooghe, editor, Logic Based Program Synthesis and Transformation, 13th International Symposium, LOPSTR 2003, number 3018 in Lecture Notes in Computer Science, pages 143-159, Uppsala, Sweden, August 2003. Springer-Verlag.
18. Dariusz Biernacki, Olivier Danvy, and 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.
19. Dariusz Biernacki, Olivier Danvy, and Chung-chieh Shan. On the dynamic extent of delimited contin-uations. Information Processing Letters, 96(1):7-17, 2005. Extended version available as the technical report BRICS RS-05-13.
20. Thierry Coquand and Peter Dybjer. Intuitionistic model constructions and normalization proofs. Mathematical Structures in Computer Science, 7:75-94, 1997.
21. Olivier Danvy. On listing list prefixes. LISP Pointers, 2(3-4):42-46, January 1989. ACM Press.
22. Olivier Danvy. Type-directed partial evaluation. In Guy L. Steele Jr., editor, Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Programming Languages, pages 242-257, St. Petersburg Beach, Florida, January 1996. ACM Press.
23. Olivier Danvy. Type-directed partial evaluation. In John Hatcliff, Torben A. Mogensen, and Peter Thiemann, editors, Partial Evaluation-Practice and Theory; Proceedings of the 1998 DIKU Summer School, number 1706 in Lecture Notes in Computer Science, pages 367-411, Copenhagen, Denmark, July 1998. Springer-Verlag.
24. Olivier Danvy. From reduction-based to reduction-free normalization. In Sergio Antoy and Yoshihito Toyama, editors, Proceedings of the Fourth International Workshop on Reduction Strategies in Rewriting and Programming (WRS’04), number 124 in Electronic Notes in Theoretical Computer Science, pages 79-100, Aachen, Germany, May 2004. Elsevier Science. Invited talk.
25. Olivier Danvy. On evaluation contexts, continuations, and the rest of the computation. In Hayo Thi-elecke, editor, Proceedings of the Fourth ACM SIGPLAN Workshop on Continuations, Technical report CSR-04-1, Department of Computer Science, Queen Mary’s College, pages 13-23, Venice, Italy, January 2004. Invited talk.
26. Olivier Danvy. A rational deconstruction of Landin’s SECD machine. In Clemens Grelck, Frank Huch, Greg J. Michaelson, and Phil Trinder, editors, Implementation and Application of Functional Languages, 16th International Workshop, IFL’04, number 3474 in Lecture Notes in Computer Science, pages 52-71, Lübeck, Germany, September 2004. Springer-Verlag. Recipient of the 2004 Peter Landin prize. Extended version available as the technical report BRICS-RS-03-33.
27. Olivier Danvy and Andrzej Filinski. A functional abstraction of typed contexts. DIKU Rapport 89/12, DIKU, Computer Science Department, University of Copenhagen, Copenhagen, Denmark, July 1989.
28. Olivier Danvy and Andrzej Filinski. Abstracting control. In Wand[81], pages 151-160.
29. Olivier Danvy and Andrzej Filinski. Representing control, a study of the CPS transformation. Mathematical Structures in Computer Science, 2(4):361-391, 1992.
30. Olivier Danvy and Lasse R. Nielsen. Defunctionalization at work. In Harald Sondergaard, editor, Proceedings of the Third International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP’01), pages 162-174, Firenze, Italy, September 2001. ACM Press. Extended version available as the technical report BRICS RS-01-23.
31. Olivier Danvy and Lasse R. Nielsen. Refocusing in reduction semantics. Research Report BRICS RS-04-26, DAIMI, Department of Computer Science, University of Aarhus, Aarhus, Denmark, November 2004. A preliminary version appears in the informal proceedings of the Second International Workshop on Rule-Based Programming (RULE 2001), Electronic Notes in Theoretical Computer Science, Vol. 59.4.
32. Olivier Danvy and Zhe Yang. An operational investigation of the CPS hierarchy. In S. Doaitse Swierstra, editor, Proceedings of the Eighth European Symposium on Programming, number 1576 in Lecture Notes in Computer Science, pages 224-242, Amsterdam, The Netherlands, March 1999. Springer-Verlag.
33. Scott Draves. Implementing bit-addressing with specialization. In Mads Tofte, editor, Proceedings of the 1997 ACM SIGPLAN International Conference on Functional Programming, pages 239-250, Amsterdam, The Netherlands, June 1997. ACM Press.
34. Peter Dybjer and Andrzej Filinski. Normalization and partial evaluation. In Gilles Barthe, Peter Dybjer, Luís Pinto, and João Saraiva, editors, Applied Semantics-Advanced Lectures, number 2395 in Lecture Notes in Computer Science, pages 137-192, Caminha, Portugal, September 2000. Springer-Verlag.
35. R. Kent Dybvig, Simon Peyton-Jones, and Amr Sabry. A monadic framework for subcontinuations. Technical Report 615, Computer Science Department, Indiana University, Bloomington, Indiana, June 2005.
36. Matthias Felleisen. The Calculi of λ-v-CS Conversion: A Syntactic Theory of Control and State in Imperative Higher-Order Programming Languages. PhD thesis, Computer Science Department, Indiana University, Bloomington, Indiana, August 1987.
37. Matthias Felleisen. The theory and practice of first-class prompts. In Jeanne Ferrante and Peter Mager, editors, Proceedings of the Fifteenth Annual ACM Symposium on Principles of Programming Languages, pages 180-190, San Diego, California, January 1988. ACM Press.
38. Matthias Felleisen and Matthew Flatt. Programming languages and lambda calculi. Unpublished lecture notes. http://www.ccs.neu.edu/home/matthias/3810-w02/readings.html, 1989-2003.
39. Matthias Felleisen and Daniel P. Friedman. Control operators, the SECD machine, and the λ-calculus. In Martin Wirsing, editor, Formal Description of Programming Concepts III, pages 193-217. Elsevier Science Publishers B.V. (North-Holland), Amsterdam, 1986.
40. Matthias Felleisen, Daniel P. Friedman, Bruce Duba, and John Merrill. Beyond continuations. Technical Report 216, Computer Science Department, Indiana University, Bloomington, Indiana, February 1987.
41. Matthias Felleisen, Mitchell Wand, Daniel P. Friedman, and Bruce F. Duba. Abstract continuations: A mathematical semantics for handling full functional jumps. In Robert (Corky) Cartwright, editor, Proceedings of the 1988 ACM Conference on Lisp and Functional Programming, pages 52-62, Snowbird, Utah, July 1988. ACM Press.
42. Andrzej Filinski. Representing monads. In Hans-J. Boehm, editor, Proceedings of the Twenty-First Annual ACM Symposium on Principles of Programming Languages, pages 446-457, Portland, Oregon, January 1994. ACM Press.
43. Andrzej Filinski. Representing layered monads. In Alex Aiken, editor, Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Programming Languages, pages 175-188, San Antonio, Texas, January 1999. ACM Press.
44. Andrzej Filinski. Normalization by evaluation for the computational lambda-calculus. In Samson Abramsky, editor, Typed Lambda Calculi and Applications, 5th International Conference, TLCA 2001, number 2044 in Lecture Notes in Computer Science, pages 151-165, Kraków, Poland, May 2001. Springer-Verlag.
45. Kathleen Fisher, editor. Proceedings of the 2004 ACM SIGPLAN International Conference on Functional Programming, Snowbird, Utah, September 2004. ACM Press.
46. Martin Gasbichler and Michael Sperber. Final shift for call/cc: direct implementation of shift and reset. In Simon Peyton Jones, editor, Proceedings of the 2002 ACM SIGPLAN International Conference on Functional Programming, SIGPLAN Notices, Vol. 37, No. 9, pages 271-282, Pittsburgh, Pennsylvania, September 2002. ACM Press.
47. Matthew L. Ginsberg. Multivalued logics: a uniform approach to reasoning in artificial intelligence. Computational Intelligence, 4:265-316, 1988.
48. Bernd Grobauer and Zhe Yang. The second Futamura projection for type-directed partial evaluation. Higher-Order and Symbolic Computation, 14(2/3):173-219, 2001.
49. Carl Gunter, Didier Rémy, and Jon G. Riecke. A generalization of exceptions and control in ML-like languages. In Simon Peyton Jones, editor, Proceedings of the Seventh ACM Conference on Functional Programming and Computer Architecture, pages 12-23, La Jolla, California, June 1995. ACM Press.
50. Thérèse Hardin, Luc Maranget, and Bruno Pagano. Functional runtime systems within the lambda-sigma calculus. Journal of Functional Programming, 8(2):131-172, 1998.
51. Simon Helsen and Peter Thiemann. Two flavors of offline partial evaluation. In Jieh Hsiang and Atsushi Ohori, editors, Advances in Computing Science-ASIAN’98, number 1538 in Lecture Notes in Computer Science, pages 188-205, Manila, The Philippines, December 1998. Springer-Verlag.
52. Robert Hieb and R. Kent Dybvig. Continuations and concurrency. In Proceedings of the Second ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, SIGPLAN Notices, Vol. 25, No. 3, pages 128-136, Seattle, Washington, March 1990. ACM Press.
53. Robert Hieb, R. Kent Dybvig, and Claude W. Anderson, III. Subcontinuations. Lisp and Symbolic Computation, 5(4):295-326, December 1993.
54. John Hughes. A novel representation of lists and its application to the function “reverse”. Information Processing Letters, 22(3):141-144, 1986.
55. Yukiyoshi Kameyama. Axioms for delimited continuations in the CPS hierarchy. In Jerzy Marcinkowski and Andrzej Tarlecki, editors, Computer Science Logic, 18th International Workshop, CSL 2004, 13th Annual Conference of the EACSL, Proceedings, volume 3210 of Lecture Notes in Computer Science, pages 442-457, Karpacz, Poland, September 2004. Springer.
56. Yukiyoshi Kameyama and Masahito Hasegawa. A sound and complete axiomatization of delimited continuations. In Olin Shivers, editor, Proceedings of the 2003 ACM SIGPLAN International Conference on Functional Programming, pages 177-188, Uppsala, Sweden, August 2003. ACM Press.
57. Richard Kelsey, William Clinger, and Jonathan Rees, editors. Revised5 report on the algorithmic lan-guage Scheme. Higher-Order and Symbolic Computation, 11(1):7-105, 1998.
58. Yoshiki Kinoshita. A bicategorical analysis of E-categories. Mathematica Japonica, 47(1):157-169, 1998.
59. Oleg Kiselyov. How to remove a dynamic prompt: Static and dynamic delimited continuation opera-tors are equally expressible. Technical Report 611, Computer Science Department, Indiana University, Bloomington, Indiana, March 2005.
60. Peter J. Landin. The mechanical evaluation of expressions. The Computer Journal, 6(4):308-320, 1964.
61. Julia L. Lawall and Olivier Danvy. Continuation-based partial evaluation. In Carolyn L. Talcott, editor, Proceedings of the 1994 ACM Conference on Lisp and Functional Programming, LISP Pointers, Vol. 7, No. 3, pages 227-238, Orlando, Florida, June 1994. ACM Press.
62. Simon Marlow and Simon L. Peyton Jones. Making a fast curry: push/enter vs. Eval/apply for higher-order languages. In Fisher [45], pages 4-15.
63. Per Martin-Löf. About models for intuitionistic type theories and the notion of definitional equality. In Proceedings of the Third Scandinavian Logic Symposium (1972), volume 82 of Studies in Logic and the Foundation of Mathematics, pages 81-109. North-Holland, 1975.
64. Eugenio Moggi. Notions of computation and monads. Information and Computation, 93:55-92, 1991.
65. Luc Moreau and Christian Queinnec. Partial continuations as the difference of continuations, a du-umvirate of control operators. In Manuel Hermenegildo and Jaan Penjam, editors, Sixth International Symposium on Programming Language Implementation and Logic Programming, number 844 in Lecture Notes in Computer Science, pages 182-197, Madrid, Spain, September 1994. Springer-Verlag.
66. Chethan R. Murthy. Control operators, hierarchies, and pseudo-classical type systems: A-translation at work. In Olivier Danvy and Carolyn L. Talcott, editors, Proceedings of the First ACM SIGPLAN Workshop on Continuations (CW 1992), Technical report STAN-CS-92-1426, Stanford University, pages 49-72, San Francisco, California, June 1992.
67. Lasse R. Nielsen. A denotational investigation of defunctionalization. Research Report BRICS RS-00-47, DAIMI, Department of Computer Science, University of Aarhus, Aarhus, Denmark, December 2000.
68. Gordon D. Plotkin. Call-by-name, call-by-value and the λ-calculus. Theoretical Computer Science, 1:125-159, 1975.
69. Gordon D. Plotkin. A structural approach to operational semantics. Technical Report FN-19, DAIMI, Department of Computer Science, University of Aarhus, Aarhus, Denmark, September 1981.
70. Christian Queinnec and Bernard Serpette. A dynamic extent control operator for partial continuations. In Robert (Corky) Cartwright, editor, Proceedings of the Eighteenth Annual ACM Symposium on Principles of Programming Languages, pages 174-184, Orlando, Florida, January 1991. ACM Press.
71. John C. Reynolds. Definitional interpreters for higher-order programming languages. Higher-Order and Symbolic Computation, 11(4):363-397, 1998. Reprinted from the proceedings of the 25th ACM National Conference (1972), with a foreword.
72. Chung-chieh Shan. Shift to control. In Olin Shivers and Oscar Waddell, editors, Proceedings of the 2004 ACM SIGPLAN Workshop on Scheme and Functional Programming, Technical report TR600, Computer Science Department, Indiana University, Snowbird, Utah, September 2004.
73. Dorai Sitaram. Models of Control and their Implications for Programming Language Design. PhD thesis, Computer Science Department, Rice University, Houston, Texas, April 1994.
74. Dorai Sitaram and Matthias Felleisen. Control delimiters and their hierarchies. Lisp and Symbolic Computation, 3(1):67-99, January 1990.
75. Dorai Sitaram and Matthias Felleisen. Reasoning with continuations II: Full abstraction for models of control. In Wand [81], pages 161-175.
76. 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.
77. Eijiro Sumii. An implementation of transparent migration on standard Scheme. In Matthias Felleisen, editor, Proceedings of the Workshop on Scheme and Functional Programming, Technical Report 00-368, Rice University, pages 61-64, Montréal, Canada, September 2000.
78. Eijiro Sumii and Naoki Kobayashi. A hybrid approach to online and offline partial evaluation. Higher-Order and Symbolic Computation, 14(2/3):101-142, 2001.
79. Peter Thiemann. Combinators for program generation. Journal of Functional Programming, 9(5):483-525, 1999.
80. Philip Wadler. Monads and composable continuations. LISP and Symbolic Computation, 7(1):39-55, January 1994.
81. Mitchell Wand, editor. Proceedings of the 1990 ACM Conference on Lisp and Functional Programming, Nice, France, June 1990. ACM Press.
82. Yong Xiao, Amr Sabry, and Zena M. Ariola. From syntactic theories to interpreters: Automating proofs of unique decomposition. Higher-Order and Symbolic Computation, 14(4):387-409, 2001.