A rational deconstruction of Landin's SECD machine

Lecture Notes in Computer Science

Volumn 3474, Issue , 2005, Pages 52-71

  Danvy, Olivier ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; COMPUTATIONAL METHODS; COMPUTER ARCHITECTURE; DATA REDUCTION; FUNCTIONS; MATHEMATICAL TRANSFORMATIONS;

FUNCTIONAL PROGRAMMING LANGUAGES; PROGRAM TRANSFORMATIONS; SECD MACHINE; Λ-CALCULUS;

COMPUTER PROGRAMMING;

EID: 24944462071     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11431664_4     Document Type: Conference Paper

References (45)

1. M. S. Ager, D. Biernacki, O. Danvy, and J. Midtgaard. A functional correspondence between evaluators and abstract machines. In D. Miller, editor, Proceedings of the Fifth ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming (PPDP'03), pages 8-19. ACM Press, Aug. 2003.
2. M. S. Ager, O. Danvy, and M. Goldberg. A symmetric approach to compilation and decompilation. In T. JE. Mogensen, D. A. Schmidt, and I. H. 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.
3. M. S. Ager, O. Danvy, and J. 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.
4. M. S. Ager, O. Danvy, and J. Midtgaard. A functional correspondence between monadic evaluators and abstract machines for languages with computational effects. Theoretical Computer Science, 2005. Accepted for publication. Extended version available as the technical report BRIGS RS-04-28.
5. A. Banerjee, N. Heintze, and J. G. Riecke. Design and correctness of program transformations based on control-flow analysis. In N. Kobayashi and B. 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, Oct. 2001. Springer-Verlag.
6. J. M. Bell, F. Bellegarde, and J. Hook. Type-driven defunctionalization. In M. Tofte, editor, Proceedings of the 1997 ACM SIGPLAN International Conference on Functional Programming, pages 25-37, Amsterdam, The Netherlands, June 1997. ACM Press.
7. D. Biernacki and O. Danvy. From interpreter to logic engine by defunctionalization. In M. 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, Aug. 2003. Springer-Verlag.
8. H.-J. Boehm, editor. Proceedings of the Twenty-First Annual ACM Symposium on Principles of Programming Languages, Portland, Oregon, Jan. 1994. ACM Press.
9. O. Danvy. Back to direct style. Science of Computer Programming, 22(3): 183-195, 1994.
10. O. Danvy. Type-directed partial evaluation. In G. L. Steele Jr., editor, Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Programming Languages, pages 242-257, St. Petersburg Beach, Florida, Jan. 1996. ACM Press.
11. O. Danvy. A rational deconstruction of Landin's SECD machine. Technical Report BRIGS RS-03-33, DAIMI, Department of Computer Science, University of Aarhus, Aarhus, Denmark, Oct. 2003.
12. O. Danvy and A. Filinski. Abstracting control. In M. Wand, editor, Proceedings of the 1990 ACM Conference on Lisp and Functional Programming, pages 151-160, Nice, France, June 1990. ACM Press.
13. O. Danvy and A. Filinski. Representing control, a study of the CPS transformation. Mathematical Structures in Computer Science, 2(4):361-391, 1992.
14. O. Danvy and L. R. Nielsen. Defunctionalization at work. In H. Søndergaard, editor, Proceedings of the Third International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP'01), pages 162-174, Firenze, Italy, Sept. 2001. ACM Press. Extended version available as the technical report BRIGS RS-01-23.
15. O. Danvy and L. R. Nielsen. On one-pass CPS transformations. Technical Report BRICS RS-02-3, DAIMI, Department of Computer Science, University of Aarhus, Aarhus, Denmark, Jan. 2002. Accepted for publication in the Journal of Functional Programming.
16. S. Diehl, P. Hartel, and P. Sestoft. Abstract machines for programming language implementation. Future Generation Computer Systems, 16:739-751, 2000.
17. M. Felleisen. The Calculi of λ-v-CS Conversion: A Syntactic Theory of Control and State in Imperative Higher-Order Programming Languages. PhD thesis, Department of Computer Science, Indiana University, Bloomington, Indiana, Aug. 1987.
18. M. Felleisen. The theory and practice of first-class prompts. In J. Ferrante and P. Mager, editors, Proceedings of the Fifteenth Annual ACM Symposium on Principles of Programming Languages, pages 180-190, San Diego, California, Jan. 1988. ACM Press.
19. M. Felleisen and M. Flatt. Programming languages and lambda calculi. Unpublished lecture notes, http ://www.ces.neu.edu/home/matthias/3810-w02/ readings.html, 1989-2003.
20. A. Filinski. Representing monads. In Boehm [8], pages 446-457.
21. D. P. Friedman, M. Wand, and C. T. Haynes. Essentials of Programming Languages, second edition. The MIT Press, 2001.
22. M. Gasbichler and M. Sperber. Final shift for call/cc: direct implementation of shift and reset. In S. 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, Sept. 2002. ACM Press.
23. J. Hatcliff and O. Danvy. A generic account of continuation-passing styles. In Boehm [8], pages 458-471.
24. P. Hein. Crooks. The MIT Press, 1966.
25. Y. Kameyama and M. Hasegawa. A sound and complete axiomatization of delimited continuations. In O. Shivers, editor, Proceedings of the 2003 ACM SIGPLAN International Conference on Functional Programming, pages 177-188, Uppsala, Sweden, Aug. 2003. ACM Press.
26. J.-L. Krivine. Un interprète du λ-calcul. Brouillon. Available online at http://www.pps.jussieu.fr/~krivine, 1985.
27. P. J. Landin. The mechanical evaluation of expressions. The Computer Journal, 6(4):308-320, 1964.
28. P. J. Landin. The next 700 programming languages. Commun. ACM, 9(3):157-166, 1966.
29. J. L. Lawall and O. Danvy. Continuation-based partial evaluation. In C. L. Talcott, editor, Proceedings of the 1994 ACM Conference on Lisp and Functional Programming, LISP Pointers, Vol. VII, No. 3, pages 227-238, Orlando, Florida, June 1994. ACM Press.
30. J. McCarthy, P. W. Abrahams, D. J. Edwards, T. P. Hart, and M. I. Levin. LISP 1.5 Programmer's Manual The MIT Press, Cambridge, Massachusetts, 1962.
31. L. Morris. The next 700 formal language descriptions. Lisp and Symbolic Computation, 6(3/4) :249-258, 1993.
32. L. R. Nielsen. A denotational investigation of defunctionalization. Technical Report BRIGS RS-00-47, DAIMI, Department of Computer Science, University of Aarhus, Aarhus, Denmark, Dec. 2000.
33. S. L. Peyton Jones. Implementing lazy functional languages on stock hardware: The spineless tagless G-machine. Journal of Functional Programming, 2(2): 127-202, 1992.
34. G. D. Plotkin. Call-by-name, call-by-value and the λ-calculus. Theoretical Computer Science, 1:125-159, 1975.
35. J. D. Ramsdell. The tail-recursive SECD machine. Journal of Automated Reasoning, 23(1):43-62, July 1999.
36. J. C. Reynolds. The discoveries of continuations. Lisp and Symbolic Computation, 6(3/4) :233-247, 1993.
37. J. 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.
38. D. A. Schmidt. Denotational Semantics: A Methodology for Language Development. Allyn and Bacon, Inc., 1986.
39. O. Shivers. Control-Flow Analysis of Higher-Order Languages or Taming Lambda. PhD thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, Pennsylvania, May 1991. Technical Report CMU-CS-91-145.
40. G. L. Steele Jr. Lambda, the ultimate declarative. AI Memo 379, Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, Massachusetts, Nov. 1976.
41. G. 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.
42. G. L. Steele Jr. and G. J. Sussman. Lambda, the ultimate imperative. AI Memo 353, Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, Massachusetts, Mar. 1976.
43. G. L. Steele Jr. and G. 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.
44. J. E. Stoy. Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory. The MIT Press, 1977.
45. G. Winskel. The Formal Semantics of Programming Languages. Foundation of Computing Series. The MIT Press, 1993.