A rational deconstruction of Landin's secd machine with the J operator

Logical Methods in Computer Science

Volumn 4, Issue 4, 2008, Pages

  Danvy, Olivier ^a   Millikin, Kevin ^b  

^a AARHUS UNIVERSITY   (Denmark)

^b GOOGLE   (United Kingdom)

Author keywords

Abstract machines; Continuations; Control operators; Reduction semantics

Indexed keywords

ABSTRACT MACHINES; CALCULI OF EXPLICIT SUBSTITUTIONS; CONTINUATION-PASSING STYLE; CONTINUATIONS; CONTROL OPERATORS; ELEMENTARY TRANSFORMATION; EXPLICIT SUBSTITUTIONS; REDUCTION SEMANTICS;

SEMANTICS; SYNTACTICS;

FUNCTIONAL PROGRAMMING;

EID: 69049118924     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-4(4:12)2008     Document Type: Article

References (120)

1. Samson Abramsky. Computational interpretations of linear logic. Theoretical Computer Science, 111(1&2): 3-57, 1992.
2. Samson Abramsky and R. Sykes. SECD-M: a virtual machine for applicative programming. In Jean-Pierre Jouannaud, editor, Functional Programming Languages and Computer Architecture, number 201 in Lecture Notes in Computer Science, pages 81-98, Nancy, France, September 1985. Springer-Verlag.
3. Mads Sig Ager. Partial Evaluation of String Matchers & Constructions of Abstract Machines. PhD thesis, BRICS PhD School, Department of Computer Science, Aarhus University, Aarhus, Denmark, January 2006.
4. Mads Sig Ager, Dariusz Biernacki, Olivier Danvy, and Jan Midtgaard. A functional correspon-dence between 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, Uppsala, Sweden, August 2003. ACM Press.
5. Mads Sig Ager, Olivier Danvy, and Mayer Goldberg. A symmetric approach to compilation and de-compilation. In Torben A. Mogensen, David A. Schmidt, and I. Hal Sudborough, editors, The Essence of Computation: Complexity, Analysis, Transformation. Essays Dedicated to Neil D. Jones, number 2566 in Lecture Notes in Computer Science, pages 296-331. Springer-Verlag, 2002.
6. 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 research report BRICS RS-04-3.
7. 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 research report BRICS RS-04-28.
8. Alfred V. Aho, Ravi Sethi, and Jeffrey D. Ullman. Compilers: Principles, Techniques and Tools. World Student Series. Addison-Wesley, Reading, Massachusetts, 1986.
9. Anindya Banerjee. The Semantics and Implementation of Bindings in Higher-Order Programming Languages. PhD thesis, Department of Computing and Information Sciences, Kansas State University, Manhattan, Kansas, July 1995.
10. Fred Bayer. LispMe: An implementation of Scheme for the PalmPilot. In Manuel Serrano, editor, Proceedings of the Second ACM SIGPLAN Workshop on Scheme and Functional Programming, Firenze, Italy, September 2001.
11. Gavin Bierman. Observations on a linear PCF. Technical Report 412, Computer Laboratory, University of Cambridge, Cambridge, UK, January 1997.
12. Ma lgorzata Biernacka. A Derivational Approach to the Operational Semantics of Functional Languages. PhD thesis, BRICS PhD School, Department of Computer Science, Aarhus University, Aarhus, Den-mark, January 2006.
13. Ma lgorzata Biernacka, Dariusz Biernacki, and Olivier Danvy. An operational foundation for delimited continuations in the CPS hierarchy. Logical Methods in Computer Science, 1(2: 5): 1-39, November 2005. A preliminary version was presented at the Fourth ACM SIGPLAN Workshop on Continuations (CW'04).
14. Ma lgorzata Biernacka and Olivier Danvy. A concrete framework for environment machines. ACM Transactions on Computational Logic, 9(1): 1-30, 2007. Article #6. Extended version available as the research report BRICS RS-06-3.
15. Ma lgorzata Biernacka and Olivier Danvy. A syntactic correspondence between context-sensitive cal-culi and abstract machines. Theoretical Computer Science, 375(1-3): 76-108, 2007. Extended version available as the research report BRICS RS-06-18.
16. Dariusz Biernacki. The Theory and Practice of Programming Languages with Delimited Continuations. PhD thesis, BRICS PhD School, Department of Computer Science, Aarhus University, Aarhus, Denmark, December 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 and Olivier Danvy. A simple proof of a folklore theorem about delimited control. Journal of Functional Programming, 16(3): 269-280, 2006.
19. Graham Birtwistle and Brian T. Graham. Verifying SECD in HOL. In Jorgen Staunstrup, editor, Formal Methods for VLSI Design, pages 129-177. North-Holland, 1990.
20. Guy Blelloch and John Greiner. Parallelism in sequential functional languages. In Simon Peyton Jones, editor, Proceedings of the Seventh ACM Conference on Functional Programming and Computer Architecture, pages 226-237, La Jolla, California, June 1995. ACM Press.
21. William H. Burge. Recursive Programming Techniques. Addison-Wesley, 1975.
22. Rod M. Burstall. Writing search algorithms in functional form. In Donald Michie, editor, Machine Intelligence, volume 5, pages 373-385. Edinburgh University Press, 1969.
23. Luca Cardelli. The functional abstract machine. Polymorphism, 1(1), January 1983.
24. Robert (Corky) Cartwright, editor. Proceedings of the 1988 ACM Conference on Lisp and Functional Programming, Snowbird, Utah, July 1988. ACM Press.
25. Jaeyoun Chung. An explicit polymorphic type system for verifying untrusted low-level codes. Mas-ter's thesis, Department of Computer Science, Korea Advanced Institute of Science and Technology, Daejeon, Korea, December 1999.
26. Anthony Neil Clark. Semantic Primitives for Object-Oriented Programming Languages. PhD thesis, Department of Computer Science, Queen Mary and Westfield College, University of London, 1996.
27. John Clements. Portable and High-Level Access to the Stack with Continuation Marks. PhD thesis, College of Computer Science, Northeastern University, Boston, Massachusetts, February 2006.
28. John Clements, Ayswarya Sundaram, and David Herman. Implementing continuation marks in JavaScript. In Will Clinger, editor, Proceedings of the 2008 ACM SIGPLAN Workshop on Scheme and Functional Programming, pages 1-9, Victoria, British Columbia, September 2008.
29. William Clinger, Daniel P. Friedman, and Mitchell Wand. A scheme for a higher-level semantic alge-bra. In John Reynolds and Maurice Nivat, editors, Algebraic Methods in Semantics, pages 237-250. Cambridge University Press, 1985.
30. William D. Clinger. Proper tail recursion and space efficiency. In Keith D. Cooper, editor, Proceedings of the ACM SIGPLAN'98 Conference on Programming Languages Design and Implementation, pages 174-185, Montréal, Canada, June 1998. ACM Press.
31. Pierre-Louis Curien. An abstract framework for environment machines. Theoretical Computer Science, 82: 389-402, 1991.
32. Olivier Danvy. Three steps for the CPS transformation. Technical Report CIS-92-2, Kansas State University, Manhattan, Kansas, December 1991.
33. Olivier Danvy. Back to direct style. Science of Computer Programming, 22(3): 183-195, 1994. A pre-liminary version was presented at the Fourth European Symposium on Programming (ESOP 1992).
34. 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), volume 124(2) of Electronic Notes in Theoretical Computer Science, pages 79-100, Aachen, Germany, May 2004. Elsevier Science. Invited talk.
35. 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 research report BRICS RS-03-33.
36. Olivier Danvy. An Analytical Approach to Program as Data Objects. DSc thesis, Department of Com-puter Science, Aarhus University, Aarhus, Denmark, October 2006.
37. Olivier Danvy. Defunctionalized interpreters for programming languages. In Peter Thiemann, edi-tor, Proceedings of the 2008 ACM SIGPLAN International Conference on Functional Programming (ICFP'08), SIGPLAN Notices, Vol. 43, No. 9, Victoria, British Columbia, September 2008. ACM Press. Invited talk.
38. Olivier Danvy and Andrzej Filinski. Abstracting control. In Mitchell Wand, editor, Proceedings of the 1990 ACM Conference on Lisp and Functional Programming, pages 151-160, Nice, France, June 1990. ACM Press.
39. Olivier Danvy and Andrzej Filinski. Representing control, a study of the CPS transformation. Mathematical Structures in Computer Science, 2(4): 361-391, 1992.
40. Olivier Danvy and John Hatcliff. On the transformation between direct and continuation semantics. In Stephen Brookes, Michael Main, Austin Melton, Michael Mislove, and David Schmidt, editors, Proceedings of the 9th Conference on Mathematical Foundations of Programming Semantics, num-ber 802 in Lecture Notes in Computer Science, pages 627-648, New Orleans, Louisiana, April 1993. Springer-Verlag.
41. Olivier Danvy and Julia L. Lawall. Back to direct style II: First-class continuations. InWilliam Clinger, editor, Proceedings of the 1992 ACM Conference on Lisp and Functional Programming, LISP Pointers, Vol. V, No. 1, pages 299-310, San Francisco, California, June 1992. ACM Press.
42. Olivier Danvy and Karoline Malmkjar. Intensions and extensions in a reflective tower. In Cartwright [24], pages 327-341.
43. Olivier Danvy and Kevin Millikin. Refunctionalization at work. Science of Computer Programming, 2001. In press. Extended version available as the research report BRICS RS-08-04.
44. 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 research report BRICS RS-01-23.
45. Olivier Danvy and Lasse R. Nielsen. Refocusing in reduction semantics. Research Report BRICS RS-04-26, DAIMI, Department of Computer Science, Aarhus University, Aarhus, Denmark, November 2004. A preliminary version appeared in the informal proceedings of the Second International Workshop on Rule-Based Programming (RULE 2001), Electronic Notes in Theoretical Computer Science, Vol. 59. 4.
46. Olivier Danvy and Zhe Yang. An operational investigation of the CPS hierarchy. In S. Doaitse Swier-stra, 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.
47. Antony J. T. Davie. Introduction to Functional Programming Systems Using Haskell, volume 27 of Cambridge Computer Science Texts. Cambridge University Press, 1992.
48. Antony J. T. Davie and David J. McNally. CASE-a lazy version of an SECD machine with a flat environment. In Proceedings of the Fourth IEEE Region 10 International Conference (TENCON 1989), pages 864-872, Bombay, India, November 1989.
49. Arie de Bruin and Erik P. de Vink. Continuation semantics for Prolog with cut. In Josep Díaz and Fernando Orejas, editors, TAPSOFT'89: Proceedings of the International Joint Conference on Theory and Practice of Software Development, number 351 in Lecture Notes in Computer Science, pages 178-192, Barcelona, Spain, March 1989. Springer-Verlag.
50. 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.
51. Matthias Felleisen. Reflections on Landin's J operator: a partly historical note. Computer Languages, 12(3/4): 197-207, 1987.
52. Matthias Felleisen and Matthew Flatt. Programming languages and lambda calculi. Unpublished lecture notes available at and last accessed in April 2008, 1989-2001.
53. 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.
54. Matthias Felleisen, Mitchell Wand, Daniel P. Friedman, and Bruce F. Duba. Abstract continuations: A mathematical semantics for handling full functional jumps. In Cartwright [24], pages 52-62.
55. Anthony J. Field and Peter G. Harrison. Functional Programming. Addison Wesley, 1988.
56. 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.
57. David Flanagan. JavaScript: The Definitive Guide. O'Reilly Media, Inc, Sebastopol, California, fifth edition, 2006.
58. Daniel P. Friedman and Christopher T. Haynes. Constraining control. In Mary S. Van Deusen and Zvi Galil, editors, Proceedings of the Twelfth Annual ACM Symposium on Principles of Programming Languages, pages 245-254, New Orleans, Louisiana, January 1985. ACM Press.
59. Daniel P. Friedman and Mitchell Wand. Essentials of Programming Languages. The MIT Press, third edition, 2008.
60. Yoshihiko Futamura. Partial evaluation of computation process-an approach to a compiler-compiler. Systems · Computers · Controls, 2(5): 45-50, 1971. Reprinted in Higher-Order and Symbolic Compu-tation 12(4): 381-391, 1999, with an interview [61].
61. Yoshihiko Futamura. Partial evaluation of computation process, revisited. Higher-Order and Symbolic Computation, 12(4): 377-380, 1999.
62. Michael Georgeff. Transformations and reduction strategies for typed lambda expressions. ACM Transactions on Programming Languages and Systems, 6(4): 603-631, 1984.
63. Hugh Glaser, Chris Hankin, and David Till. Principles of Functional Programming. Prentice-Hall International, 1984.
64. Carsten K. Gomard and Peter Sestoft. Globalization and live variables. In Hudak and Jones [72], pages 166-177.
65. Brian T. Graham. The SECD microprocessor: a verification case study. Kluwer Academic Publishers, 1992.
66. Timothy G. Griffin. A formulae-as-types notion of control. In Paul Hudak, editor, Proceedings of the Seventeenth Annual ACM Symposium on Principles of Programming Languages, pages 47-58, San Francisco, California, January 1990. ACM Press.
67. John Hannan. Staging transformations for abstract machines. In Hudak and Jones [72], pages 130-141.
68. John Hannan and Dale Miller. From operational semantics to abstract machines. Mathematical Structures in Computer Science, 2(4): 415-459, 1992.
69. 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.
70. Peter Henderson. Functional Programming-Application and Implementation. Prentice-Hall Interna-tional, 1980.
71. Martin C. Henson. Elements of Functional Languages. Computer Science Texts. Blackwell Scientific Publications, 1987.
72. Paul Hudak and Neil D. Jones, editors. ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, SIGPLAN Notices, Vol. 26, No 9, New Haven, Connecti-cut, June 1991. ACM Press.
73. Jacob Johannsen. An investigation of Abadi and Cardelli's untyped calculus of objects. Master's thesis, DAIMI, Department of Computer Science, Aarhus University, Aarhus, Denmark, June 2008. BRICS research report RS-08-6.
74. Neil D. Jones. Flow analysis of lambda expressions (preliminary version). In Shimon Even and Oded Kariv, editors, Automata, Languages, and Programming, 8th Colloquium, number 115 in Lecture Notes in Computer Science, pages 114-128, Acre (Akko), Israel, July 1981. Springer-Verlag.
75. 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.
76. Yukiyoshi Kameyama. Axioms for control operators in the CPS hierarchy. Higher-Order and Symbolic Computation, 20(4): 339-369, 2007. A preliminary version was presented at the Fourth ACM SIGPLAN Workshop on Continuations (CW'04).
77. Yukiyoshi Kameyama and Masahito Hasegawa. A sound and complete axiomatization of delimited con-tinuations. In Olin Shivers, editor, Proceedings of the 2003 ACM SIGPLAN International Conference on Functional Programming (ICFP'03), SIGPLAN Notices, Vol. 38, No. 9, pages 177-188, Uppsala, Sweden, August 2003. ACM Press.
78. 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.
79. Werner E. Kluge. Abstract Computing Machines: A Lambda Calculus Perspective. Texts in Theoretical Computer Science. An EATCS Series. Springer, 2005.
80. Peter J. Landin. The mechanical evaluation of expressions. The Computer Journal, 6(4): 308-320, 1964.
81. Peter J. Landin. A correspondence between Algol 60 and Church's lambda notation. Communications of the ACM, 8: 89-101 and 158-165, 1965.
82. Peter J. Landin. A generalization of jumps and labels. Research report, UNIVAC Systems Programming Research, 1965. Reprinted in Higher-Order and Symbolic Computation 11(2): 125-143, 1998, with a foreword [115].
83. Peter J. Landin. A λ-calculus approach. In Leslie Fox, editor, Advances in Programming and Non-Numerical Computation, Symposium Publication Division, chapter 5, pages 97-141. Pergamon Press, 1966.
84. Peter J. Landin. The next 700 programming languages. Communications of the ACM, 9(3): 157-166, 1966.
85. Peter J. Landin. Histories of discoveries of continuations: Belles-lettres with equivocal tenses. In Olivier Danvy, editor, Proceedings of the Second ACM SIGPLAN Workshop on Continuations (CW'97), Tech-nical report BRICS NS-96-13, Aarhus University, pages 1: 1-9, Paris, France, January 1997.
86. Peter J. Landin. My years with Strachey. Higher-Order and Symbolic Computation, 13(1/2): 75-76, 2000.
87. Clement L. McGowan. The correctness of a modified SECD machine. In Proceedings of the Second Annual ACM Symposium in the Theory of Computing, pages 149-157, Northampton, Massachusetts, May 1970.
88. Erik Meijer. Generalised expression evaluation. Technical Report 88-5, Department of Informatics, University of Nijmegen, Nijmegen, The Netherlands, 1988.
89. Jan Midtgaard. Transformation, Analysis, and Interpretation of Higher-Order Procedural Programs. PhD thesis, BRICS PhD School, Aarhus University, Aarhus, Denmark, June 2007.
90. Kevin Millikin. A Structured Approach to the Transformation, Normalization and Execution of Computer Programs. PhD thesis, BRICS PhD School, Aarhus University, Aarhus, Denmark, May 2007.
91. F. Lockwood Morris. The next 700 formal language descriptions. Lisp and Symbolic Computation, 6(3/4): 249-258, 1993. Reprinted from a manuscript dated 1970.
92. Peter D. Mosses. A foreword to 'Fundamental concepts in programming languages.' Higher-Order and Symbolic Computation, 13(1/2): 7-9, 2000.
93. Johan Munk. A study of syntactic and semantic artifacts and its application to lambda definabil-ity, strong normalization, and weak normalization in the presence of state. Master's thesis, DAIMI, Department of Computer Science, Aarhus University, Aarhus, Denmark, May 2007. BRICS research report RS-08-3.
94. 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'92), Technical report STAN-CS-92-1426, Stanford University, pages 49-72, San Francisco, California, June 1992.
95. Peter Moller Neergaard. Complexity Aspects of Programming Language Design-From Logspace to Elementary Time via Proofnets and Intersection Types. PhD thesis, Mitchom School of Computer Science, Brandeis University, Waltham, Massachusetts, October 2004.
96. Flemming Nielson and Hanne Riis Nielson. Comments on Georgeff's 'transformations and reduction strategies for typed lambda expressions.' ACM Transactions on Programming Languages and Systems, 8(3): 406-407, 1984.
97. Michel Parigot. μ-calculus: an algorithmic interpretation of classical natural deduction. In Andrei Voronkov, editor, Proceedings of the International Conference on Logic Programming and Automated Reasoning, number 624 in Lecture Notes in Artificial Intelligence, pages 190-201, St. Petersburg, Russia, July 1992. Springer-Verlag.
98. Larry Paulson. A Compiler Generator for Semantic Grammars. PhD thesis, Department of Computer Science, Stanford University, Stanford, California, December 1981. Report No. STAN-CS-81-893.
99. Uwe Pleban. Compiler prototyping using formal semantics. In Susan L. Graham, editor, Proceedings of the 1984 Symposium on Compiler Construction, SIGPLAN Notices, Vol. 19, No 6, pages 94-105, Montréal, Canada, June 1984. ACM Press.
100. Gordon D. Plotkin. Call-by-name, call-by-value and the λ-calculus. Theoretical Computer Science, 1: 125-159, 1975.
101. John D. Ramsdell. The tail-recursive SECD machine. Journal of Automated Reasoning, 23(1): 43-62, July 1999.
102. John C. Reynolds. Definitional interpreters for higher-order programming languages. In Proceedings of 25th ACM National Conference, pages 717-740, Boston, Massachusetts, 1972. Reprinted in Higher-Order and Symbolic Computation 11(4): 363-397, 1998, with a foreword [104].
103. John C. Reynolds. The discoveries of continuations. Lisp and Symbolic Computation, 6(3/4): 233-247, 1993.
104. John C. Reynolds. Definitional interpreters revisited. Higher-Order and Symbolic Computation, 11(4): 355-361, 1998.
105. Colin Runciman and Ian Toyn. Adapting combinator and SECD machines to display snapshots of functional computations. New Generation Computing, 4(4): 339-363, 1986.
106. Peter Sestoft. Analysis and efficient implementation of functional programs. PhD thesis, DIKU, Com-puter Science Department, University of Copenhagen, Copenhagen, Denmark, 1991. DIKU Rapport 92/6.
107. Chung-chieh Shan. Shift to control. In Olin Shivers and Oscar Waddell, editors, Proceedings of the Fifth ACM SIGPLAN Workshop on Scheme and Functional Programming, Technical report TR600, Computer Science Department, Indiana University, Snowbird, Utah, September 2004.
108. Chung-chieh Shan. A static simulation of dynamic delimited control. Higher-Order and Symbolic Computation, 20(4): 371-401, 2007. A preliminary version was presented at the 2004 Workshop on Scheme and Functional Programming [107].
109. Mike Spivey. The SECD machine-a tutorial reconstruction. Unpublished lecture notes, Oxford Uni-versity, Easter 2003.
110. 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.
111. Guy L. Steele Jr. and Gerald J. Sussman. The art of the interpreter or, the modularity complex (parts zero, one, and two). AI Memo 453, Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, Massachusetts, May 1978.
112. Joseph E. Stoy. Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory. The MIT Press, 1977.
113. Christopher 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): 11-49, 2000, with a foreword [92].
114. Christopher Strachey and Christopher P. Wadsworth. Continuations: A mathematical semantics for handling full jumps. Technical Monograph PRG-11, Oxford University Computing Laboratory, Pro-gramming Research Group, Oxford, England, 1974. Reprinted in Higher-Order and Symbolic Compu-tation 13(1/2): 135-152, 2000, with a foreword [118].
115. Hayo Thielecke. An introduction to Landin's "A generalization of jumps and labels". Higher-Order and Symbolic Computation, 11(2): 117-124, 1998.
116. Hayo Thielecke. Comparing control constructs by double-barrelled CPS. Higher-Order and Symbolic Computation, 15(2/3): 141-160, 2002.
117. Vasco Thudichum Vasconcelos. Lambda and pi calculi, CAM and SECD machines. Journal of Functional Programming, 15(1): 101-127, 2005.
118. Christopher P. Wadsworth. Continuations revisited. Higher-Order and Symbolic Computation, 13(1/2): 131-133, 2000.
119. Mitchell Wand. Continuation-based program transformation strategies. Journal of the ACM, 27(1): 164-180, January 1980.
120. Hongwei Xi. Evaluation under lambda abstraction. In Hugh Glaser, H. Hartel, and Herbert Kuchen, editors, Ninth International Symposium on Programming Language Implementation and Logic Programming, number 1292 in Lecture Notes in Computer Science, pages 259-273, Southampton, UK, September 1997. Springer-Verlag.