Implementing memoization for partial evaluation

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

Volumn 1140, Issue , 1996, Pages 198-212

  Thiemann, Peter ^a  

^a UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

Automatic program transformation; Incremental specialization; Partial evaluation; Reflection; Termination of partial evaluation

Indexed keywords

AUTOMATIC PROGRAMMING; COMPUTATIONAL LINGUISTICS; MESSAGE PASSING; REFLECTION;

AUTOMATIC PROGRAMS; HIGHER-ORDER LANGUAGES; INCREMENTAL SPECIALIZATION; MEMOIZATION; PARTIAL EVALUATION; STANDARD EVALUATIONS; STATIC DATUM; TERMINATION PROBLEMS;

FUNCTION EVALUATION;

EID: 84957717840     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61756-6_86     Document Type: Conference Paper

References (37)

1. Peter Holst Andersen and Carsten Kehler Holst. Termination analysis for offline partial evaluation of a higher order functional language. In Radhia Cousot, editor, Proc. International Static Analysis Symposium, SAS'96, Aachen, Germany, September 1996. Springer-Verlag. LNCS.
2. Lars Birkedal and Morten Welinder. Partial evaluation of Standard ML. Rapport 93/22, DIKU, University of Copenhagen, 1993.
3. Lars Birkedal and Morten Welinder. Hand-writing program generator generators. In Manuel V. Hermenegildo and Jaan Penjam, editors, Programming Languages, Implementations, Logics, and Programs (PLILP '94), volume 844 of Lecture Notes in Computer Science, pages 198-214, Madrid, Spain, September 1994. Springer- Verlag.
4. Dines Bjømer, Andrei P. Ershov, and Neil D. Jones, editors. Partial Evaluation and Mixed Computation, Amsterdam, 1988. North-Holland.
5. Anders Bondorf. Automatic autoprojection of higher order recursive equations. Science of Programming, 17:3-34, 1991.
6. Anders Bondorf. Similix 5.0 Manual. DIKU, University of Copenhagen, May 1993.
7. Anders Bondorf and Olivier Danvy. Automatic autoprojection of recursive equations with global variables and abstract data types. Science of Programming, 16(2):151-195, 1991.
8. Anders Bondorf and Dirk Dussart. Improving CPS-based partial evaluation: Writing cogen by hand. In Peter Sestoft and Harald Søndergaard, editors, Proc. ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation PEPM '94, pages 1-10, Orlando, Fla., June 1994. ACM.
9. Charles Consel. A tour of Schism. In David Schmidt, editor, Proc. ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation PEPM '93, pages 134-154, Copenhagen, Denmark, June 1993. ACM Press.
10. Charles Consel and Olivier Danvy. Tutorial notes on partial evaluation. In Proc. 20th Annual ACM Symposium on Principles of Programming Languages, pages 493-501, Charleston, South Carolina, January 1993. ACM Press.
11. Yoshihiko Futamura. Partial evaluation of computation process - tin approach to a compiler-compiler. Systems, Computers, Controls, 2(5):45-50, 1971.
12. Robert Glück and Jesper Jørgensen. Efficient multi-level generating extensions for program specialization. In Doaitse Swierstra and Manuel Hermenegildo, editors, Programming Languages, Implementations, Logics, and Programs (PLILP '95), volume 982 of Lecture Notes in Computer Science, Utrecht, The Netherlands, September 1995. Springer-Verlag.
13. Arne John Glenstrup and Neil D. Jones. Bta algorithms to ensure termination of offline partial evaluation. In PSI-96: Andrei Ershov Second International Memorial Conference, Perspectives of System Informatics, Novosibirsk, Russia, June 1996.
14. Fritz Henglein. Efficient type inference for higher-order binding-time analysis. In Hughes [16], pages 448-472. LNCS 523.
15. Carsten Kehler Holst. Finiteness analysis. In Hughes [16], pages 473-495. LNCS 523.
16. John Hughes, editor. Functional Programming Languages and Computer Architecture, Cambridge, MA, 1991. Springer-Verlag. LNCS 523.
17. Institute of Electrical and Electronic Engineers, Inc. IEEE standard for the Scheme programming language. IEEE Std 1178-1990, New York, NY, 1991.
18. Neil D. Jones, Carsten K. Gomard, and Peter Sestoft. Partial Evaluation and Automatic Program Generation. Prentice Hall, 1993.
19. Neil D. Jones, Peter Sestoft, and Harald Søndergaard. An experiment in partial evaluation: The generation of a compiler generator. In J.-P. Jouannaud, editor, Rewriting Techniques and Applications, pages 124-140, Dijon, France, 1985. Springer-Verlag. LNCS 202.
20. Richard A. Kelsey and Jonathan Rees. A tractable Scheme implementation. Lisp and Symbolic Computation, 7(4):315-335, 1994.
21. John Launchbury and Carsten Kehler Holst. Handwriting cogen to avoid problems with static typing. In Draft Proceedings, Fourth Annual Glasgow Workshop on Functional Programming, pages 210-218, Skye, Scotland, 1991. Glasgow University.
22. Julia Lawall and Olivier Danvy. Continuation-based partial evaluation. In LFP 1994 [24], pages 227-238.
23. Julia Lawall and Olivier Danvy. Continuation-based partial evaluation. Extended version of [22] from ftp://ftp.daimi.aau.dk/pub/danvy/Papers/, January 1995.
24. Proc. 1994 ACM Conference on Lisp and Functional Programming, Orlando, Florida, USA, June 1994. ACM Press.
25. Robin Milner, Mads Tofte, and Robert Harper. The Definition of Standard ML. MIT Press, 1990.
26. Yasuhiko Minamide, Greg Morrisett, and Robert Harper. Typed closure conversion. In Proc. 23rd Annual ACM Symposium on Principles of Programming Languages, pages 271-283, St. Petersburg, Fla., January 1996. ACM Press.
27. Torben Æ. Mogensen. Partially static structures in a self-applicable partial evaluator. In Bjømer et al. Partial Evaluation and Mixed Computation, Amsterdam, 1988. North-Holland, pages 325-347.
28. Torben Æ. Mogensen. Separating binding times in language specifications. In Proc. Functional Programming Languages and Computer Architecture 1989, pages 14-25, London, GB, 1989.
29. Jonathan Rees. The Scheme of things: The June 1992 meeting. Lisp Pointers, V(4), October 1992.
30. John C. Reynolds. Definitional interpreters for higher-order programming. In ACM Annual Conference, pages 717-740, July 1972.
31. Peter Sestoft. The structure of a self-applicable partial evaluator. In Harald Ganzinger and Neil D. Jones, editors, Programs as Data Objects, pages 236-256, Copenhagen, Denmark, October 1985. Springer-Verlag. LNCS 217.
32. Peter Sestoft. Automatic call unfolding in a partial evaluator. In Bjømer et al. [4], pages 485-506.
33. Olin Shivers. Control-Flow Analysis of Higher-Order Languages. PhD thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213, May 1991. Also technical report CMU-CS-91-145.
34. Guy L. Steele Jr. Building interpreters by composing monads. In Proc. 21st Annual A CM Symposium on Principles of Programming Languages, pages 472-492, Portland, OG, January 1994. ACM Press.
35. Dan Stefanescu and Yuli Zhou. An equational framework for the flow analysis of higher-order functional programs. In LFP 1994 [24], pages 318-327.
36. Peter Thiemann. Cogen in six lines. In R. Kent Dybvig, editor, Proc. International Conference on Functional Programming 1996, pages 180-189, Philadelphia, PA, May 1996. ACM Press, New York.
37. Valentin F. Turchin. The use of metasystem transition in theorem proving and program optimization. In International Conference on Automata, Languages, and Programming. Seventh ICALP, volume 85 of Lecture Notes in Computer Science, pages 645-657, Noordwijkerhout, The Netherlands, 1980. Springer-Verlag.