A unifying approach to goal-directed evaluation

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

Volumn 2196, Issue , 2001, Pages 108-125

  Danvy, Olivier ^a   Grobauer, Bernd ^a   Rhiger, Morten ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION PROGRAMS; AUTOMATIC PROGRAMMING; CODES (SYMBOLS); PROGRAM COMPILERS; PROGRAM INTERPRETERS; SEMANTICS;

BINDING TIME ANALYSIS; BYTECODES; C PROGRAMS; CONTINUATION SEMANTICS; GOAL DIRECTED; MONADIC SEMANTICS; OPTIMIZED COMPILER; PARTIAL EVALUATION;

C (PROGRAMMING LANGUAGE);

EID: 84937501542     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44806-3_7     Document Type: Conference Paper

References (30)

1. Andrew W. Appel. Compiling with Continuations. Cambridge University Press, New York, 1992.
2. Lawrence Byrd. Understanding the control of Prolog programs. Technical Report 151, University of Edinburgh, 1980.
3. Mats Carlsson. On implementing Prolog in functional programming. New Generation Computing, 2(4):347-359, 1984.
4. Alonzo Church. The Calculi of Lambda-Conversion. Princeton University Press, 1941.
5. Charles Consel and Olivier Danvy. Tutorial notes on partial evaluation. In Susan L. Graham, editor, Proceedings of the Twentieth Annual ACM Symposium on Principles of Programming Languages, pages 493-501, Charleston, South Carolina, January 1993. ACM Press.
6. Charles Consel and Francois Noel. A general approach for run-time specialization and its application to C. In Guy L. Steele, editor, Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Programming Languages, pages 145-156, St. Petersburg Beach, Florida, January 1996. ACM Press.
7. Ron K. Cytron, editor. Proceedings of the ACM SIGPLAN'97 Conference on Programming Languages Design and Implementation, SIGPLAN Notices, Vol. 32, No 5, Las Vegas, Nevada, June 1997. ACM Press.
8. Olivier Danvy. Type-directed partial evaluation. In John Hatcliff, Torben 7E. Mogensen, and Peter Thiemann, editors, Partial Evaluation - Practice and Theory; Proceedings of the 1998 DIKU Summer School, number 1706 in Lecture Notes in Computer Science, pages 367-411, Copenhagen, Denmark, July 1998. SpringerVerlag.
9. Olivier Danvy and Rene Vestergaard. Semantics-based compiling: A case study in type-directed partial evaluation. In Herbert Kuchen and Doaitse Swierstra, editors, Eighth International Symposium on Programming Language Implementation and Logic Programming, number 1140 in Lecture Notes in Computer Science, pages 182-197, Aachen, Germany, September 1996. Springer-Verlag. Extended version available as the technical report BRICS-RS-96-13.
10. Andrzej Filinski. Representing layered monads. In Alex Aiken, editor, Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Programming Languages, pages 175-188, San Antonio, Texas, January 1999. ACM Press.
11. Ralph E. Griswold and Madge T. Griswold. The Icon Programming Language. Prentice Hall, Inc., 1983.
12. Ralph E. Griswold and Madge T. Griswold. The Implementation ofthe Icon Programming Language. Princeton University Press, 1986.
13. David A. Gudeman. Denotational semantics of a goal-directed language. ACM Transactions on Programming Languages and Systems, 1992.
14. Robert Hieb, R. Kent Dybvig, and Carl Bruggeman. Representing control in the presence of first-class continuations. In Bernard Lang, editor, Proceedings of the ACM SIGPLAN'90 Conference on Programming Languages Design and Implementation, SIGPLAN Notices, Vol. 25, No 6, pages 66-77, White Plains, New York, June 1990. ACM Press.
15. Ralf Hinze. Prological features in a functional setting—axioms and implementations. In Masahiko Sato and Yoshihito Toyama, editors, Third Fuji International Symposium on Functional and Logic Programming (FLOPS'98), pages 98-122, Kyoto, Japan, April 1998. World Scientific.
16. John Hughes. A novel representation of lists and its application to the function "reverse". Information Processing Letters, 22(3):141-144, 1986.
17. Neil D. Jones, Carsten K. Gomard, and Peter Sestoft. Partial Evaluation and Automatic Program Generation. Prentice-Hall International, 1993. Available online at http://www.dina.kvl.dk/~sestoft/pebook/pebook.html.
18. David J. King and Philip Wadler. Combining Monads. In John Launchbury and Patrick M. Sansom, editors, Glasgow Workshop on Functional Programming, Workshops in Computing, Ayr, Scotland, 1992. Springer, Berlin.
19. Mark Leone and Peter Lee. Optimizing ML with run-time code generation. In Proceedings of the ACM SIGPLAN'96 Conference on Programming Languages Design and Implementation, SIGPLAN Notices, Vol. 31, No 5, pages 137-148. ACM Press, May 1996.
20. Karoline Malmkjasr. Abstract Interpretation of Partial-Evaluation Algorithms. PhD thesis, Department of Computing and Information Sciences, Kansas State University, Manhattan, Kansas, March 1993.
21. Eugenio Moggi. Computational lambda-calculus and monads. In Proceedings of the Fourth Annual IEEE Symposium on Logic in Computer Science, pages 14-23, Pacific Grove, California, June 1989. IEEE Computer Society Press.
22. Todd A. Proebsting. Simple translation of goal-directed evaluation. In Cytron [7], pages 1-6.
23. Todd A. Proebsting and Gregg M. Townsend. A new implementation of the Icon language. Technical Report 99-13, University of Arizona, Department of Computer Science, 1999.
24. John 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).
25. Morten Rhiger. PhD thesis, BRICS PhD School, University of Aarhus, Aarhus, Denmark, 2001. Forthcoming.
26. Michael Sperber and Peter Thiemann. Two for the price of one: composing partial evaluation and compilation. In Cytron [7], pages 215-225.
27. Guy L. Steele, Compiler optimization based on viewing LAMBDA as RENAME + GOTO. In Patrick Henry Winston and Richard Henry Brown, editors, Artificial Intelligence: An MIT Perspective, volume 2. The MIT Press, 1979.
28. Philip Wadler. Comprehending monads. Mathematical Structures in Computer Science, 2(4):461-493, December 1992.
29. Philip Wadler. Monads for functional programming. In Johan Jeuring and Erik Meijer, editors, Advanced Functional Programming, number 925in Lecture Notes in Computer Science, pages 24-52. Springer-Verlag, 1995.
30. Richard S. Wallace. An easy implementation of pil (PROLOG in LISP). Association for Computing Machinery Special Interest Group on Artificial Intelligence. SIGART NEWSL., (85):29-32, July 1983.