A rational deconstruction of Landin's J operator

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4015 LNCS, Issue , 2006, Pages 55-73

  Danvy, Olivier ^a   Millikin, Kevin ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

CONTINUATION-PASSING STYLE; CONTROL OPERATORS; DEFUNCTIONALIZATIONS; DIRECT STYLES; EVALUATION FUNCTION; FUNCTIONAL LANGUAGES; SECD MACHINE;

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE;

FUNCTIONAL PROGRAMMING;

EID: 84888861195     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11964681_4     Document Type: Conference Paper

References (40)

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 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.
3. 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, 342(1):149-172, 2005. Extended version available as the technical report BRICS RS-04-28.
4. M. Biernacka, D. Biernacki, and O. Danvy. An operational foundation for delimited continuations in the CPS hierarchy. Logical Methods in Computer Science, 1(2:5):1-39, Nov. 2005
5. A preliminary version was presented at the Fourth ACM SIGPLAN Workshop on Continuations (CW'04).
6. D. Biernacki and O. 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, Aug. 2005. Theoretical Pearl to appear in the Journal of Functional Programming.
7. W. H. Burge. Recursive Programming Techniques. Addison-Wesley, 1975.
8. R. M. Burstall. Writing search algorithms in functional form. In D. Michie, editor, Machine Intelligence, volume 5, pages 373-385. Edinburgh University Press, 1969.
9. W. Clinger, D. P. Friedman, and M. Wand. A scheme for a higher-level semantic algebra. In J. Reynolds and M. Nivat, editors, Algebraic Methods in Semantics, pages 237-250. Cambridge University Press, 1985.
10. O. Danvy. A rational deconstruction of Landin's SECD machine. In C. Grelck, F. Huch, G. J. Michaelson, and P. 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, Sept. 2004. Springer-Verlag. Recipient of the 2004 Peter Landin prize. Extended version available as the technical report BRICS RS-03-33.
11. 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.
12. O. Danvy and J. L. Lawall. Back to direct style II: First-class continuations. In W. 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.
13. O. Danvy and K. Millikin. A rational deconstruction of Landin's J operator. Research Report BRICS RS-06-04, DAIMI, Department of Computer Science, University of Aarhus, Aarhus, Denmark, Feb. 2006.
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 BRICS RS-01-23.
15. O. Danvy and Z. Yang. An operational investigation of the CPS hierarchy. In S. D. Swierstra, editor, Proceedings of the Eighth European Symposium on Programming, number 1576 in Lecture Notes in Computer Science, pages 224-242, Amsterdam, The Netherlands, Mar. 1999. Springer-Verlag.
16. M. Felleisen. Reflections on Landin's J operator: a partly historical note. Computer Languages, 12(3/4):197-207, 1987.
17. A. Filinski. Representing monads. In H.-J. Boehm, editor, Proceedings of the Twenty-First Annual ACM Symposium on Principles of Programming Languages, pages 446-457, Portland, Oregon, Jan. 1994. ACM Press.
18. D. P. Friedman and C. T. Haynes. Constraining control. In M. S. V. Deusen and Z. Galil, editors, Proceedings of the Twelfth Annual ACM Symposium on Principles of Programming Languages, pages 245-254, New Orleans, Louisiana, Jan. 1985. ACM Press.
19. D. P. Friedman, M. Wand, and C. T. Haynes. Essentials of Programming Languages, second edition. The MIT Press, 2001.
20. Y. Futamura. Partial evaluation of computation process-an approach to a compiler-compiler. Systems Computers Controls, 2(5):45-50, 1971
21. Reprinted in Higher-Order and Symbolic Computation 12(4):381-391, 1999, with an interview [20].
22. Y. Futamura. Partial evaluation of computation process, revisited. Higher-Order and Symbolic Computation, 12(4):377-380, 1999.
23. Y. Kameyama. Axioms for delimited continuations in the CPS hierarchy. In J. Marcinkowski and A. 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, Sept. 2004. Springer.
24. P. J. Landin. The mechanical evaluation of expressions. The Computer Journal, 6(4):308-320, 1964.
25. P. J. Landin. A correspondence between Algol 60 and Church's lambda notation. Commun. ACM, 8:89-101 and 158-165, 1965.
26. 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):125-143, 1998, with a foreword [36].
27. P. J. Landin. The next 700 programming languages. Commun. ACM, 9(3): 157-166, 1966.
28. P. J. Landin. Histories of discoveries of continuations: Belles-lettres with equivocal tenses. In O. Danvy, editor, Proceedings of the Second ACM SIGPLAN Workshop on Continuations (CW'97), Technical report BRICS NS-96-13, University of Aarhus, pages 1:1-9, Paris, France, Jan. 1997.
29. P. J. Landin. My years with Strachey. Higher-Order and Symbolic Computation, 13(1/2):75-76, 2000.
30. F. L. Morris. The next 700 formal language descriptions. Lisp and Symbolic Computation, 6(3/4):249-258, 1993. Reprinted from a manuscript dated 1970.
31. P. D. Mosses. A foreword to 'Fundamental concepts in programming languages'. Higher-Order and Symbolic Computation, 13(1/2):7-9, 2000.
32. C. R. Murthy. Control operators, hierarchies, and pseudo-classical type systems: A-translation at work. In O. Danvy and C. 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.
33. J. C. Reynolds. Definitional interpreters for higher-order programming languages. In Proceedings of 25th ACM National Conference, pages 717-740
34. Boston, Massachusetts, 1972. Reprinted in Higher-Order and Symbolic Computation 11(4):363-397, 1998, with a foreword [33].
35. J. C. Reynolds. The discoveries of continuations. Lisp and Symbolic Computation, 6(3/4):233-247, 1993.
36. J. C. Reynolds. Definitional interpreters revisited. Higher-Order and Symbolic Computation, 11(4):355-361, 1998.
37. 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.
38. C. Strachey. Fundamental concepts in programming languages. International Summer School in Computer Programming, Copenhagen, Denmark, Aug. 1967
39. Reprinted in Higher-Order and Symbolic Computation 13(1/2):11-49, 2000, with a foreword [29].
40. H. Thielecke. An introduction to Landin's "A generalization of jumps and labels". Higher-Order and Symbolic Computation, 11(2):117-124, 1998.