From interpreter to logic engine by defunctionalization

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

Volumn 3018, Issue , 2004, Pages 143-159

  Biernacki, Dariusz ^a   Danvy, Olivier ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTER CIRCUITS; DIFFERENTIATION (CALCULUS); ENGINES; LOGIC PROGRAMMING; PROGRAM INTERPRETERS; SEMANTICS;

ABSTRACT MACHINES; CONTINUATION PASSING; CONTROL OPERATORS; DEFUNCTIONALIZATIONS; LAMBDA CALCULUS; OPERATIONAL SEMANTICS; TAIL RECURSIVE; TRANSITION SYSTEM;

PROLOG (PROGRAMMING LANGUAGE);

EID: 35048897016     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-25938-1_13     Document Type: Article

References (31)

1. Mads Sig Ager, Dariusz Biernacki, Olivier Danvy, and Jan Midtgaard. From interpreter to compiler and virtual machine: a functional derivation. Technical Report BRICS RS-03-14, DAIMI, Department of Computer Science, University of Aarhus, Aarhus, Denmark, March 2003.
2. Mads Sig Ager, Dariusz Biernacki, Olivier Danvy, and Jan Midtgaard. A functional correspondence 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. ACM Press, August 2003.
3. Mads Sig Ager, Olivier Danvy, and Jan Midtgaard. A functional correspondence between call-by-need evaluators and lazy abstract machines. Technical Report BRICS RS-04-03, DAIMI, Department of Computer Science, University of Aarhus, Aarhus, Denmark, February 2004. Extended version of an article to appear in Information Processing Letters.
4. Hassan Aït-Kaci. Warren's Abstract Machine: A Tutorial Reconstruction. The MIT Press, 1991.
5. Anindya Banerjee, Nevin Heintze, and Jon G. Riecke. Design and correctness of program transformations 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.
6. Malgorzata Biernacka, Dariusz Biernacki, and Olivier Danvy. An operational foundation for delimited continuations. In Hayo Thielecke, editor, Proceedings of the Fourth ACM SIGPLAN Workshop on Continuations, Technical report CSR-04-1, Department of Computer Science, Queen Mary's College, pages 25-33, Venice, Italy, January 2004.
7. Mats Carlsson. On implementing Prolog in functional programming. New Generation Computing, 2(4):347-359, 1984.
8. Weidong Chen, Michael Kifer, and David S. Warren. Hilog: A foundation for higher-order logic programming. The Journal of Logic Programming, 15(3):187-230, February 1993.
9. Olivier Danvy. Back to direct style. Science of Computer Programming, 22(3):183-195, 1994.
10. Olivier 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, October 2003.
11. 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.
12. Olivier Danvy and Andrzej Filinski. Representing control, a study of the CPS transformation. Mathematical Structures in Computer Science, 2(4):361-391, 1992.
13. Olivier Danvy, Bernd Grobauer, and Morten Rhiger. A unifying approach to goal-directed evaluation. New Generation Computing, 20(1):53-73, 2002. Extended version available as the technical report BRIGS RS-01-29.
14. Olivier Danvy and Lasse R. Nielsen. Defunctionalization at work. In Harald 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, September 2001. ACM Press.
15. 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.
16. Stephan Diehl, Pieter Hartel, and Peter Sestoft. Abstract machines for programming language implementation. Future Generation Computer Systems, 16:739-751, 2000.
17. 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.
18. John Hannan. Operational semantics directed machine architecture. ACM Transactions on Programming Languages and Systems, 16(4):1215-1247, 1994.
19. Neil D. Jones. Computability and Complexity from a Programming Perspective. Foundations of Computing. The MIT Press, 1997.
20. Neil D. Jones, Carsten K. Gomard, and Peter Sestoft. Partial Evaluation and Automatic Program Generation. Prentice-Hall International, London, UK, 1993. Available online at http://www.dina.kvl.dk/~sestoft/pebook/.
21. Ulrik Jørring and William L. Scherlis. Compilers and staging transformations. In Mark Scott Johnson and Ravi Sethi, editors, Proceedings of the Thirteenth Annual ACM Symposium on Principles of Programming Languages, pages 86-96, St. Petersburg, Florida, January 1986. ACM Press.
22. Peter Kursawe. How to invent a Prolog machine. New Generation Computing, 5(1):97-114, 1987.
23. John C. Martin. Introduction to Languages and the Theory of Computation. McGraw-Hill, 1991.
24. Torben æ. Mogensen. Separating binding times in language specifications. In Joseph E. Stoy, editor, Proceedings of the Fourth International Conference on Functional Programming and Computer Architecture, pages 14-25, London, England, September 1989. ACM Press.
25. Tim Nicholson and Norman Y. Foo. A denotational semantics for Prolog. ACM Transactions on Programming Languages and Systems, 11(4):650-665, 1989.
26. Lasse R. Nielsen. A denotational investigation of defunctionalization. Technical Report BRICS RS-00-47, DAIMI, Department of Computer Science, University of Aarhus, Aarhus, Denmark, December 2000.
27. John C. Reynolds. Definitional interpreters for higher-order programming languages. Higher-Order and Symbolic Computation, 11(4):363-397, 1998.
28. Reprinted from the proceedings of the 25th ACM National Conference (1972), with a foreword.
29. Christopher Strachey and Christopher P. Wadsworth. Continuations: A mathematical semantics for handling full jumps. Higher-Order and Symbolic Computation, 13(1/2):135-152, 2000.
30. Reprint of the technical monograph PRG-11, Oxford University Computing Laboratory (1974), with a foreword.
31. Mitchell Wand. Semantics-directed machine architecture. In Richard DeMillo, editor, Proceedings of the Ninth Annual ACM Symposium on Principles of Programming Languages, pages 234-241. ACM Press, January 1982.