Fragmental specialization

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

Volumn 1924, Issue , 2000, Pages 51-71

  Helsen, Simon ^a   Thiemann, Peter ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATIC PROGRAMMING; SEMANTICS;

EFFICIENT IMPLEMENTATION; FIRST ORDER; INPUT DATAS; JUST-IN-TIME COMPILATION; OFFLINE; PROGRAM SPECIALIZATION; SEPARATE COMPILATION;

APPLICATION PROGRAMS;

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

References (27)

1. Kenichi Asai, Satoshi Matsuoka, and Akinori Yonezawa. Duplication and partial evaluation | for a better understanding of reflective languages. Lisp and Symbolic Computation, 9(2/3):203-241, May/June 1996.
2. Luca Cardelli. Program fragments, linking, and modularization. In Neil D. Jones, editor, Proc. 24th Annual ACM Symposium on Principles of Programming Languages, pages 266-277, Paris, France, January 1997. ACM Press.
3. Charles Consel. Polyvariant binding-time analysis for applicative languages. In David Schmidt, editor, Proc. ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation PEPM '93, pages 66-77, Copenhagen, Denmark, June 1993. ACM Press.
4. Charles Consel and Olivier Danvy. Static and dynamic semantics processing. In POPL1991 [20], pages 14-24.
5. 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.
6. Dirk Dussart, Rogardt Heldal, and John Hughes. Module-sensitive program specialisation. In PLDI1997 [19], pages 206-214.
7. Dirk Dussart, Fritz Henglein, and Christian Mossin. Polymorphic recursion and subtype qualifications: Polymorphic binding-time analysis in polynomial time. In Alan Mycroft, editor, Proc. International Static Analysis Symposium, SAS'95, volume 983 of Lecture Notes in Computer Science, pages 118-136, Glasgow, Scotland, September 1995. Springer-Verlag.
8. Yoshihiko Futamura. Partial evaluation of computation process | an approach to a compiler-compiler. Systems, Computers, Controls, 2(5):45-50, 1971.
9. Robert Glück and Jesper Jørgensen. Efficient multi-level generating extensions for program specialization. In Doaitse Swierstra and Manuel Hermenegildo, editors, International Symposium on Programming Languages, Implementations, Logics and Programs (PLILP '95), volume 982 of Lecture Notes in Computer Science, pages 259-278, Utrecht, The Netherlands, September 1995. Springer-Verlag.
10. Robert Glück and Jesper Jørgensen. Fast multi-level binding-time analysis for multiple program specialization. In PSI-96: Andrei Ershov Second International Memorial Conference, Perspectives of System Informatics, volume 1181 of Lecture Notes in Computer Science, Novosibirsk, Russia, June 1996. Springer-Verlag.
11. Robert Glück and Jesper Jørgensen. An automatic program generator for multilevel specialization. Lisp and Symbolic Computation, 10(2):113-158, July 1997.
12. Rogardt Heldal and John Hughes. Partial evaluation and separate compilation. In Charles Consel, editor, Proc. ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation PEPM '97, pages 1-11, Amsterdam, The Netherlands, June 1997. ACM Press.
13. Rogardt Heldal and John Hughes. Extending a partial evaluator which supports separate compilation. Theoretical Computer Science, to appear.
14. Fritz Henglein and Christian Mossin. Polymorphic binding-time analysis. In Donald Sannella, editor, Proceedings of European Symposium on Programming, volume 788 of Lecture Notes in Computer Science, pages 287-301. Springer-Verlag, April 1994.
15. Neil D. Jones, Carsten K. Gomard, and Peter Sestoft. Partial Evaluation and Automatic Program Generation. Prentice-Hall, 1993.
16. Jesper Jørgensen. Generating a compiler for a lazy language by partial evaluation. In Nineteenth Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages. Albuquerque,New Mexico, pages 258-268, Albuquerque, New Mexico, January 1992. ACM Press.
17. Richard Kelsey, William Clinger, and Jonathan Rees. Revised5 report on the algorithmic language Scheme. Higher-Order and Symbolic Computation, 11(1):7-105, 1998. Also appears in ACM SIGPLAN Notices 33(9), September 1998. Available electronically as http://www.neci.nj.nec.com/homepages/kelsey/r5rs.ps.gz.
18. Peter D. Mosses. Denotational Semantics, volume B of Handbook of Theoretical Computer Science, chapter 11. Elsevier Science Publishers, Amsterdam, 1990.
19. Proc. of the ACM SIGPLAN '97 Conference on Programming Language Design and Implementation, Las Vegas, NV, USA, June 1997. ACM Press.
20. 18th Annual ACM Symposium on Principles of Programming Languages, Orlando, Florida, January 1991. ACM Press.
21. Michael Sperber and Peter Thiemann. Realistic compilation by partial evaluation. In Proc. of the ACM SIGPLAN '96 Conference on Programming Language De- sign and Implementation, pages 206-214, Philadelphia, PA, USA, May 1996. ACM Press.
22. Michael Sperber and Peter Thiemann. Two for the price of one: Composing partial evaluation and compilation. In PLDI1997 [19], pages 215-225.
23. Raman S. Sundaresh. Building incremental programs using partial evaluation. In Paul Hudak and Neil D. Jones, editors, Proc. ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation PEPM '91, pages 83-93, New Haven, CT, June 1991. ACM. SIGPLAN Notices 26(9).
24. Raman S. Sundaresh and Paul Hudak. Incremental computation via partial evaluation. In POPL1991 [20], pages 1-13.
25. Peter Thiemann. Implementing memoization for partial evaluation. In Herbert Kuchen and Doaitse Swierstra, editors, International Symposium on Programming Languages, Implementations, Logics and Programs (PLILP '96), volume 1140 of Lecture Notes in Computer Science, pages 198-212, Aachen, Germany, September 1996. Springer-Verlag.
26. Peter Thiemann. A unified framework for binding-time analysis. In Michel Bidoit and Max Dauchet, editors, TAPSOFT '97: Theory and Practice of Software Devel- opment, volume 1214 of Lecture Notes in Computer Science, pages 742-756, Lille, France, April 1997. Springer-Verlag.
27. Peter Thiemann. The PGG System|User Manual. Universität Freiburg, Freiburg, Germany, March 2000. Available from http://www.informatik.uni-freiburg.de/proglang/software/pgg/.