A syntactic correspondence between context-sensitive calculi and abstract machines

Theoretical Computer Science

Volumn 375, Issue 1-3, 2007, Pages 76-108

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

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

Continuations; Defunctionalization; Delimited continuations; Environment based machines; Explicit substitutions; Proper tail recursion; Reduction semantics, Contexts; Refocusing; Stack inspection

Indexed keywords

ABSTRACTING; CONTEXT SENSITIVE LANGUAGES; INSPECTION; SYNTACTICS;

CONTINUATIONS; DEFUNCTIONALIZATION; DELIMITED CONTINUATIONS; ENVIRONMENT BASED MACHINES; EXPLICIT SUBSTITUTIONS; PROPER TAIL RECURSION; REDUCTION SEMANTICS; REFOCUSING; STACK INSPECTION;

MACHINE ORIENTED LANGUAGES;

EID: 34147129539     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.12.028     Document Type: Article

References (103)

1. Abadi M., Cardelli L., Curien P.-L., and Lévy J.-J. Explicit substitutions. Journal of Functional Programming 1 4 (1991) 375-416
2. M.S. Ager, Partial evaluation of string matchers and constructions of abstract machines, Ph.D. Thesis, BRICS Ph.D. School, University of Aarhus, Aarhus, Denmark, January 2006
3. Ager M.S., Biernacki D., Danvy O., and Midtgaard J. A functional correspondence between evaluators and abstract machines. In: Miller D. (Ed). Proceedings of the Fifth ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming. PPDP'03 (2003), ACM Press, Uppsala, Sweden 8-19
4. Ager M.S., Danvy O., and Midtgaard J. A functional correspondence between call-by-need evaluators and lazy abstract machines. Information Processing Letters 90 5 (2004) 223-232 (extended version available as the technical report BRICS RS-04-3)
5. Ager M.S., Danvy O., and Midtgaard J. A functional correspondence between monadic evaluators and abstract machines for languages with computational effects. Theoretical Computer Science 342 1 (2005) 149-172 (extended version available as the technical report BRICS RS-04-28)
6. Ariola Z.M., Felleisen M., Maraist J., Odersky M., and Wadler P. The call-by-need lambda calculus. In: Lee P. (Ed). Proceedings of the Twenty-Second Annual ACM Symposium on Principles of Programming Languages (1995), ACM Press, San Francisco, CA 233-246
7. Ariola Z.M., and Herbelin H. Minimal classical logic and control operators. In: Baeten J.C.M., Lenstra J.K., Parrow J., and Woeginger G.J. (Eds). Automata, Languages and Programming, 30th International Colloquium. ICALP 2003. Lecture Notes in Computer Science vol. 2719 (2003), Springer, Eindhoven, The Netherlands 871-885
8. M. 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
9. 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'04)
10. M. Biernacka, O. Danvy, A concrete framework for environment machines, ACM Transactions on Computational Logic (in press). Available as the technical report BRICS RS-06-3
11. M. Biernacka, O. Danvy, A syntactic correspondence between context-sensitive calculi and abstract machines, Technical Report BRICS RS-06-18, DAIMI, Department of Computer Science, University of Aarhus, Aarhus, Denmark, Theoretical Computer Science (in press) December 2006 (extended version)
12. D. 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
13. 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. Lecture Notes in Computer Science vol. 3018 (2003), Springer-Verlag, Uppsala, Sweden 143-159
14. Biernacki D., and Danvy O. A simple proof of a folklore theorem about delimited control. Journal of Functional Programming 16 3 (2006) 269-280
15. D. Biernacki, O. Danvy, K. Millikin, A dynamic continuation-passing style for dynamic delimited continuations, Technical Report BRICS RS-06-15, DAIMI, Department of Computer Science, University of Aarhus, Aarhus, Denmark, revised version of BRICS RS-05-16, October 2006
16. Biernacki D., Danvy O., and Shan C. On the static and dynamic extents of delimited continuations. Science of Computer Programming 60 (2006) 274-297
17. In: Cartwright R.C. (Ed). Proceedings of the 1988 ACM Conference on Lisp and Functional Programming (1988), ACM Press, Snowbird, Utah
18. Charniak E., Riesbeck C., and McDermott D. Artificial Intelligence Programming (1980), Lawrence Earlbaum Associates
19. Church A. The Calculi of Lambda-Conversion (1941), Princeton University Press
20. Clements J., and Felleisen M. A tail-recursive semantics for stack inspection. ACM Transactions on Programming Languages and Systems 26 6 (2004) 1029-1052
21. Clinger W.D. Proper tail recursion and space efficiency. In: Cooper K.D. (Ed). Proceedings of the ACM SIGPLAN'98 Conference on Programming Languages Design and Implementation (1998), ACM Press, Montréal, Canada 174-185
22. 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
23. Clinger W., Hartheimer A.H., and Ost E.M. Implementation strategies for first-class continuations. Higher-Order and Symbolic Computation 12 1 (1999) 7-45
24. P. Crégut, An abstract machine for lambda-terms normalization, in: Wand [102], pp. 333-340
25. P. Crégut, Strongly reducing variants of the Krivine abstract machine, in: Danvy [32] (in press). Journal version of [24]
26. Curien P.-L. Categorical Combinators, Sequential Algorithms and Functional Programming. Research Notes in Theoretical Computer Science vol. 1 (1986), Pitman
27. Curien P.-L. An abstract framework for environment machines. Theoretical Computer Science 82 (1991) 389-402
28. Curien P.-L., Hardin T., and Lévy J.-J. Confluence properties of weak and strong calculi of explicit substitutions. Journal of the ACM 43 2 (1996) 362-397
29. Danvy O. Formalizing implementation strategies for first-class continuations. In: Smolka G. (Ed). Proceedings of the Ninth European Symposium on Programming. Lecture Notes in Computer Science vol. 1782 (2000), Springer-Verlag, Berlin, Germany 88-103
30. Danvy O. A rational deconstruction of Landin's SECD machine. In: Grelck C., Huch F., Michaelson G.J., and Trinder P. (Eds). Implementation and Application of Functional Languages, 16th International Workshop. IFL'04. Lecture Notes in Computer Science vol. 3474 (2004), Springer-Verlag, Lübeck, Germany 52-71 (recipient of the 2004 Peter Landin prize. Extended version available as the technical report BRICS RS-03-33)
31. Danvy O. From reduction-based to reduction-free normalization. In: Antoy S., and Toyama Y. (Eds). Proceedings of the Fourth International Workshop on Reduction Strategies in Rewriting and Programming. WRS'04. Electronic Notes in Theoretical Computer Science vol. 124 (2004), Elsevier Science, Aachen, Germany 79-100 (invited talk)
32. O. Danvy (Ed.), The Krivine Abstract Machine, Higher-Order and Symbolic Computation (2007) (in preparation) (special issue)
33. O. Danvy, An analytical approach to program as data objects, D.Sc. Thesis, Department of Computer Science, University of Aarhus, Aarhus, Denmark, October 2006
34. O. Danvy, On evaluation contexts, continuations, and the rest of the computation, in: H. Thielecke (Ed.), Proceedings of the Fourth ACM SIGPLAN Workshop on Continuations, CW'04, Technical report CSR-04-1, Department of Computer Science, Queen Mary's College, Venice, Italy, 2004, pp. 13-23 (invited talk)
35. O. Danvy, Defunctionalized interpreters for higher-order programming languages, in: Preliminary proceedings of the 21st Conference on Mathematical Foundations of Programming Semantics, Birmingham, UK, 2005 (John Reynolds session)
36. Danvy O., and Filinski A. Representing control, a study of the CPS transformation. Mathematical Structures in Computer Science 2 4 (1992) 361-391
37. O. Danvy, A. Filinski, Abstracting control, in: Wand [102], pp. 151-160
38. O. Danvy, K. Malmkjær, Intensions and extensions in a reflective tower, in: Cartwright [17], pp. 327-341
39. Danvy O., and Millikin K. A rational deconstruction of Landin's J operator. In: Butterfield A., Grelck C., and Huch F. (Eds). Implementation and Application of Functional Languages, 17th International Workshop. IFL'05. Lecture Notes in Computer Science vol. 4015 (2005), Springer-Verlag, Dublin, Ireland 55-73 (extended version available as the technical report BRICS RS-06-17 (December 2006))
40. O. Danvy, K. Millikin, A rational deconstruction of Landin's J operator, Research Report BRICS RS-06-17, DAIMI, Department of Computer Science, University of Aarhus, Aarhus, Denmark. A preliminary version appears in the proceedings of 17th International Workshop on the Implementation and Application of Functional Languages, December 2006
41. 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 (2001), ACM Press, Firenze, Italy 162-174 (extended version available as the technical report BRICS RS-01-23)
42. O. Danvy, L.R. Nielsen, Refocusing in reduction semantics, Research Report BRICS RS-04-26, DAIMI, Department of Computer Science, University of Aarhus, Aarhus, Denmark. A preliminary version appears in the informal proceedings of the Second International Workshop on Rule-Based Programming (RULE 2001), in: Electronic Notes in Theoretical Computer Science, vol. 59.4, November 2004
43. Danvy O., and Yang Z. An operational investigation of the CPS hierarchy. In: Swierstra S.D. (Ed). Proceedings of the Eighth European Symposium on Programming. Lecture Notes in Computer Science vol. 1576 (1999), Springer-Verlag, Amsterdam, The Netherlands 224-242
44. de Groote P. An environment machine for the lambda-mu-calculus. Mathematical Structures in Computer Science 8 (1998) 637-669
45. R.K. Dybvig, S. Peyton-Jones, A. Sabry, A monadic framework for subcontinuations, Journal of Functional Programming (in press). Available at http://www.cs.indiana.edu/~sabry/research.html, May 2006
46. Fairbairn J., and Wray S. TIM: A simple, lazy abstract machine to execute supercombinators. In: Kahn G. (Ed). Functional Programming Languages and Computer Architecture. Lecture Notes in Computer Science vol. 274 (1987), Springer-Verlag, Portland, Oregon 34-45
47. Felleisen M. The theory and practice of first-class prompts. In: Ferrante J., and Mager P. (Eds). Proceedings of the Fifteenth Annual ACM Symposium on Principles of Programming Languages (1988), ACM Press, San Diego, CA 180-190
48. M. 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
49. M. Felleisen, M. Flatt, Programming languages and lambda calculi, unpublished lecture notes. http://www.ccs.neu.edu/home/matthias/3810-w02/readings.html, 1989-2003
50. 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
51. M. Felleisen, D.P. Friedman, B. Duba, J. Merrill, Beyond continuations, Technical Report 216, Computer Science Department, Indiana University, Bloomington, Indiana, February 1987
52. M. Felleisen, M. Wand, D.P. Friedman, B.F. Duba, Abstract continuations: A mathematical semantics for handling full functional jumps, in: Cartwright [17], pp. 52-62
53. Filinski A. Representing layered monads. In: Aiken A. (Ed). Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Programming Languages (1999), ACM Press, San Antonio, Texas 175-188
54. Fournet C., and Gordon A.D. Stack inspection: Theory and variants. ACM Transactions on Programming Languages and Systems 25 3 (2003) 360-399
55. Ganz S.E., Friedman D.P., and Wand M. Trampolined style. In: Lee P. (Ed). Proceedings of the 1999 ACM SIGPLAN International Conference on Functional Programming (1999), ACM Press, Paris, France 18-27
56. 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 (1990), ACM Press, San Francisco, CA 47-58
57. 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 (1995), ACM Press, La Jolla, CA 12-23
58. Hardin T., Maranget L., and Pagano B. Functional runtime systems within the lambda-sigma calculus. Journal of Functional Programming 8 2 (1998) 131-172
59. Harper R., Duba B.F., and MacQueen D. Typing first-class continuations in ML. Journal of Functional Programming 3 4 (1993) 465-484
60. Haynes C.T., Friedman D.P., and Wand M. Continuations and coroutines. In: Steele Jr. G.L. (Ed). Conference Record of the 1984 ACM Symposium on Lisp and Functional Programming (1984), ACM Press, Austin, TX 293-298
61. Hewitt C. Control structure as patterns of passing messages. In: Winston P.H., and Brown R.H. (Eds). Artificial Intelligence: An MIT Perspective vol. 2 (1979), The MIT Press 434-465
62. Hieb R., Dybvig R.K., and Bruggeman C. Representing control in the presence of first-class continuations. In: Lang B. (Ed). Proceedings of the ACM SIGPLAN'90 Conference on Programming Languages Design and Implementation. SIGPLAN Notices vol. 25, no. 6 (1990), ACM Press, White Plains, New York 66-77
63. Kameyama Y. Axioms for delimited continuations in the CPS hierarchy. In: Marcinkowski J., and Tarlecki A. (Eds). Computer Science Logic, 18th International Workshop, CSL 2004, 13th Annual Conference of the EACSL, Proceedings. Lecture Notes in Computer Science vol. 3210 (2004), Springer, Karpacz, Poland 442-457
64. 5 report on the algorithmic language Scheme, Higher-Order and Symbolic Computation 11 (1) (1998), 7-105
65. O. 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
66. J.-L. Krivine, Un interprète du λ-calcul, brouillon, Available online at http://www.pps.jussieu.fr/~krivine/, 1985
67. J.-L. Krivine, A call-by-name lambda-calculus machine, in: Danvy [32] (in press). Available online at http://www.pps.jussieu.fr/~krivine/
68. Landin P.J. The mechanical evaluation of expressions. The Computer Journal 6 4 (1964) 308-320
69. P.J. Landin, A generalization of jumps and labels, Research report, UNIVAC Systems Programming Research, 1965. Reprinted in: Higher-Order and Symbolic Computation 11(2) (1998) 125-143, with a foreword [98]
70. Launchbury J. A natural semantics for lazy evaluation. In: Graham S.L. (Ed). Proceedings of the Twentieth Annual ACM Symposium on Principles of Programming Languages (1993), ACM Press, Charleston, South Carolina 144-154
71. X. Leroy, The Zinc experiment: An economical implementation of the ML language, Rapport Technique 117, INRIA Rocquencourt, Le Chesnay, France, February 1990
72. Lescanne P. From λ σ to λ v a journey through calculi of explicit substitutions. In: Boehm H.-J. (Ed). Proceedings of the Twenty-First Annual ACM Symposium on Principles of Programming Languages (1994), ACM Press, Portland, Oregon 60-69
73. Marlow S., and Peyton Jones S.L. Making a fast curry: push/enter vs. eval/apply for higher-order languages. In: Fisher K. (Ed). Proceedings of the 2004 ACM SIGPLAN International Conference on Functional Programming. ICFP'04. SIGPLAN Notices vol. 39, no. 9 (2004), ACM Press, Snowbird, Utah 4-15
74. McCarthy J. Recursive functions of symbolic expressions and their computation by machine, part I. Communications of the ACM 3 4 (1960) 184-195
75. J. Midtgaard, Ph.D. Thesis, BRICS Ph.D. School, University of Aarhus, Aarhus, Denmark, January 2007 (in press)
76. K. Millikin, Ph.D. Thesis, BRICS PhD School, University of Aarhus, Aarhus, Denmark, January 2007 (in press)
77. Moreau L. A syntactic theory of dynamic binding. Higher-Order and Symbolic Computation 11 3 (1998) 233-279
78. Mosses P.D. A foreword to Fundamental concepts in programming languages. Higher-Order and Symbolic Computation 13 1-2 (2000) 7-9
79. L.R. Nielsen, A study of defunctionalization and continuation-passing style, Ph.D. Thesis, BRICS PhD School, University of Aarhus, Aarhus, Denmark, BRICS DS-01-7, July 2001
80. Parigot M. λ μ-calculus: An algorithmic interpretation of classical natural deduction. In: Voronkov A. (Ed). Proceedings of the International Conference on Logic Programming and Automated Reasoning. Lecture Notes in Artificial Intelligence vol. 624 (1992), Springer-Verlag, St. Petersburg, Russia 190-201
81. Plotkin G.D. Call-by-name, call-by-value and the λ-calculus. Theoretical Computer Science 1 (1975) 125-159
82. Pottier F., Skalka C., and Smith S. A systematic approach to static access control. ACM Transactions on Programming Languages and Systems 27 2 (2005) 344-382
83. Reynolds J.C. The discoveries of continuations. Lisp and Symbolic Computation 6 3-4 (1993) 233-247
84. Reynolds J.C. Definitional interpreters for higher-order programming languages. Higher-Order and Symbolic Computation 11 4 (1998) 363-397 Reprinted from the Proceedings of the 25th ACM National Conference (1972), with a foreword [85]
85. Reynolds J.C. Definitional interpreters revisited. Higher-Order and Symbolic Computation 11 4 (1998) 355-361
86. K.H. Rose, Explicit substitution-tutorial & survey, BRICS Lecture Series LS-96-3, DAIMI, Department of Computer Science, University of Aarhus, Aarhus, Denmark, September 1996
87. 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
88. Sestoft P. Deriving a lazy abstract machine. Journal of Functional Programming 7 3 (1997) 231-264
89. C. Shan, A static simulation of dynamic delimited control, Higher-Order and Symbolic Computation, Journal version of [90] (in press)
90. C. Shan, Shift to control, in: O. Shivers, O. Waddell (Eds.), Proceedings of the 2004 ACM SIGPLAN Workshop on Scheme and Functional Programming, Technical report TR600, Computer Science Department, Indiana University, Snowbird, Utah, 2004
91. Sitaram D., and Felleisen M. Control delimiters and their hierarchies. Lisp and Symbolic Computation 3 1 (1990) 67-99
92. Smith B.C. Reflection and semantics in Lisp. In: Kennedy K. (Ed). Proceedings of the Eleventh Annual ACM Symposium on Principles of Programming Languages (1984), ACM Press, Salt Lake City, Utah 23-35
93. G.L. Steele Jr., Rabbit: A compiler for Scheme, Master's Thesis, Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Technical report AI-TR-474, Cambridge, Massachusetts, May 1978
94. C. Strachey, Fundamental concepts in programming languages, International Summer School in Computer Programming, Copenhagen, Denmark, August 1967. Reprinted in: Higher-Order and Symbolic Computation 13(1-2) (2000) 11-49, with a foreword [78]
95. C. Strachey, C.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 [101]
96. Sussman G.J., and Steele Jr. G.L. The first report on Scheme revisited. Higher-Order and Symbolic Computation 11 4 (1998) 399-404
97. G.J. Sussman, G.L. Steele Jr., Scheme: An interpreter for extended lambda calculus, AI Memo 349, Artificial 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 [96]
98. Thielecke H. An introduction to Landin's "A generalization of jumps and labels". Higher-Order and Symbolic Computation 11 2 (1998) 117-124
99. Vuillemin J. Correct and optimal implementations of recursion in a simple programming language. Journal of Computer and System Sciences 9 3 (1974) 332-354
100. Wadler P. The essence of functional programming (invited talk). In: Appel A.W. (Ed). Proceedings of the Nineteenth Annual ACM Symposium on Principles of Programming Languages (1992), ACM Press, Albuquerque, NM 1-14
101. Wadsworth C.P. Continuations revisited. Higher-Order and Symbolic Computation 13 1-2 (2000) 131-133
102. In: Wand M. (Ed). Proceedings of the 1990 ACM Conference on Lisp and Functional Programming (1990), ACM Press, Nice, France
103. Wand M., and Friedman D.P. The mystery of the tower revealed: A non-reflective description of the reflective tower. Lisp and Symbolic Computation 1 1 (1988) 11-38 (a preliminary version was presented at the 1986 ACM Conference on Lisp and Functional Programming (LFP 1986))