Aspects of the PGG system: Specialization for standard scheme

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

Volumn 1706, Issue , 1999, Pages 412-432

  Thiemann, Peter ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTATIONAL LINGUISTICS; DIFFERENTIATION (CALCULUS); EDUCATION; MACHINERY;

BINDING TIME ANALYSIS; FUNCTIONAL LANGUAGES; HIGHER-ORDER; LAMBDA CALCULUS; OFFLINE; OFFLINE PARTIAL EVALUATION; PARSER GENERATION; SCHEME LANGUAGES;

MESSAGE PASSING;

EID: 84958624048     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47018-2_17     Document Type: Conference Paper

References (25)

1. Harold Abelson, Gerald Jay Sussman, and Julie Sussman. Structure and Interpretation of Computer Programs. MIT Press, Cambridge, Mass., second edition, 1996.
2. Anders Bondorf. Automatic autoprojection of higher order recursive equations. Science of Computer Programming, 17:3-34, 1991.
3. Anders Bondorf. Improving binding times without explicit CPS-conversion. In Proc. 1992 ACM Conference on Lisp and Functional Programming, pages 1-10, San Francisco, California, USA, June 1992.
4. Anders Bondorf. Similix 5.0 Manual. DIKU, University of Copenhagen, May 1993.
5. Anders Bondorf and Olivier Danvy. Automatic autoprojection of recursive equations with global variables and abstract data types. Science of Computer Programming, 16(2):151-195, 1991.
6. Robert Cartwright and Mike Fagan. Soft typing. In Proc. Conference on Programming Language Design and Implementation '91, pages 278, Toronto, June 1991. ACM.
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. Carsten K. Gomard. Partial type inference for untyped functional programs. In Proc. 1990 ACM Conference on Lisp and Functional Programming, pages 282-287, Nice, France, 1990. ACM Press.
9. Fritz Henglein. Dynamic typing: Syntax and proof theory. Science of Computer Programming, 22:197-230, 1994.
10. Neil D. Jones, Carsten K. Gomard, and Peter Sestoft. Partial Evaluation and Automatic Program Generation. Prentice-Hall, 1993.
11. Pierre Jouvelot and David K. GifFord. Algebraic reconstruction of types and effects. In Proc. 18th Annual ACM Symposium on Principles of Programming Languages, pages 303-310, Orlando, Florida, January 1991. ACM Press.
12. Richard Kelsey, William Clinger, and Jonathan Rees. Revised5 report on the algorithmic language scheme. Technical report, 1998.
13. Julia L. Lawall and Olivier Danvy. Continuation-based partial evaluation. In Proc. 1994 AСМ Conference on Lisp and Functional Programming, pages 227-238, Orlando, Florida, USA, June 1994. ACM Press.
14. Julia L. Lawall and Peter Thiemann. Sound specialization in the presence of computational effects. In Proc. Theoretical Aspects of Computer Software, volume 1281 of Lecture Notes in Computer Science, pages 165-190, Sendai, Japan, September 1997. Springer-Verlag.
15. John M. Lucassen and David K. Gilford. Polymorphic effect systems. In Proc. 15th Annual ACM Symposium on Principles of Programming Languages, pages 47-57, San Diego, California, January 1988. ACM Press.
16. Eugenio Moggi. Functor categories and two-level languages. In M. Nivat and A. Arnold, editors, Foundations of Software Science and Computation Structures, FoSSaCS'98, Lecture Notes in Computer Science, Lisbon, Portugal, April 1998.
17. Frank Pfenning and Conal Elliott. Higher-order abstract syntax. In Proc. Conference on Programming Language Design and Implementation '88, pages 199-208, Atlanta, July 1988. ACM.
18. Jean-Pierre Talpin and Pierre Jouvelot. Polymorphic type, region and effect inference. Journal of Functional Programming, 2(3):245-272, July 1992.
19. 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.
20. Peter Thiemann. Towards partial evaluation of full Scheme. In Gregor Kiczales, editor, Reflection'96, pages 95-106, San Francisco, CA, USA, April 1996.
21. Peter Thiemann. Correctness of a region-based binding-time analysis. In Proc. Mathematical Foundations of Programming Semantics, Thirteenth Annual Conference, volume 6 of Electronic Notes in Theoretical Computer Science, page 26, Pittsburgh, PA, March 1997. Carnegie Mellon University, Elsevier Science BV. URL: http://www.elsevier.nl/locate/entcs/volume6.html.
22. Peter Thiemann. A generic framework for specialization. In Chris Hankin, editor, Proc. 7th European Symposium on Programming, volume 1381 of Lecture Notes in Computer Science, pages 267-281, Lissabon, Portugal, April 1998. Springer-Verlag.
23. Peter Thiemann. The PGG System—User Manual. University of Nottingham, Nottingham, England, June 1998. Available from ftp://ftp.informatik.uni-tuebingen.de/pub/PU/thiemann/software/pgg/.
24. Peter Thiemann and Dirk Dussart. Partial evaluation for higher-order languages with state. Berichte des Wilhelm-Schickard-Instituts WSI-97-XX, Universität Tübingen, April 1997.
25. Mads Tofte and Jean-Pierre Talpin. Implementation of the typed call-by-value A-calculus using a stack of regions. In Proc. 21st Annual ACM Symposium on Principles of Programming Languages, pages 188-201, Portland, OG, January 1994. ACM Press.