Efficient multi-level generating extensions for program specialization

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

Volumn 982, Issue , 1995, Pages 259-278

  Glück, Robert ^a   Jørgensen, Jesper ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS;

BINDING TIME ANALYSIS; COGEN APPROACH; EFFECTIVE SOLUTION; GENERATION TIME; HIGHER-ORDER; MULTIPLE PROGRAM; PARTIAL EVALUATION; PROGRAM SPECIALIZATION;

COMPUTATION THEORY;

EID: 84958608332     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0026825     Document Type: Conference Paper

References (27)

1. Lars Ole Andersen. Program Analysis and Specialization for the C Programming Language. PhD thesis, DIKU, University of Copenhagen, May 1994. (DIKU report 94/19).
2. Anders Bondorf and Olivier Danvy. Automatic autoprojection of recursive equations with global variables and abstract data types. Science of Computer Programming, 16:151-195, 1991.
3. Anders Bondorf and Dirk Dussart. Improving cps-based partial evaluation: writing cogen by hand. In ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation, pages 1-9, Orlando, Florida, 1994.
4. Lennart Beckman, Anders Haraldson, Östen Oskarsson, and Erik Sande-wall. A partial evaluator and its use as a programming tool. Artificial Intelligence, 7:319-357, 1976.
5. Anders Bondorf and Jesper Jørgensen. Efficient analyses for realistic offline partial evaluation. Journal of Functional Programming, special issue on partial evaluation, 11:315-346, 1993.
6. Anders Bondorf. Automatic autoprojection of higher order recursive equations. Science of Computer Programming, 17(1-3):3-34, December 1991. Revision of paper in ESOP’90, LNCS 432, May 1990.
7. Lars Birkedal and Morten Welinder. Partial evaluation of Standard ML. DIKU Report 93/22, DIKU, Department of Computer Science, University of Copenhagen, 1993.
8. Lars Birkedal and Morten Welinder. Hand-writing program generator generators. In M. Hermenegildo and J. Penjam, editors, Programming Language Implementation and Logic Programming. Proceedings, volume 844 of LNCS, pages 198-214, Madrid, Spain, 1994. Springer-Verlag.
9. Felice Cardone and Mario Coppo. Type inference with recursive types: Syntax and semantics. Information and Computation, 92:48-80, 1991.
10. Charles Consel and Olivier Danvy. From interpreting to compiling binding times. In N. D. Jones, editor, ESOP’90, volume 432 of LNCS, pages 88-105, Copenhagen, Denmark, 1990. Springer-Verlag.
11. Andrei P. Ershov. On the essence of compilation. In E.J. Neuhold, editor, Formal Description of Programming Concepts, pages 391-420. North-Holland, 1978.
12. Robert Glück and Jesper Jørgensen. Generating transformers for deforestation and supercompilation. In B. Le Charlier, editor, Static Analysis. Proceedings, volume 864 of LNCS, pages 432-448, Namur, Belgium, 1994. Springer-Verlag.
13. Robert Glück and Jesper Jørgensen. Constraint-based multi-level bindingtime analysis of higher-order languages. Unpublished, 1995.
14. Robert Glück. Towards multiple self-application. In Proceedings of the Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pages 309-320, New Haven, Connecticut, 1991. ACM Press.
15. Robert Glück. On the generation of specializers. Journal of Functional Programming, 4(4):499-514, 1994.
16. John Hatcliff. Mechanically verifying the correctness of an off-line partial evaluator. In PLILP’95, LNCS. Springer-Verlag, 1995.
17. Fritz Henglein. Efficient type inference for higher-order binding-time analysis. In John Hughes, editor, Conference on Functional Programming and Computer Architecture, Cambridge, Massachusetts. LNCS 523, pages 448-472. Springer-Verlag, August 1991.
18. Carsten Kehler Holst and John Launchbury. Handwriting cogen to avoid problems with static typing. Working paper, 1992.
19. Carsten Kehler Holst. Syntactic currying: yet another approach to partial evaluation. Technical report, DIKU, Department of Computer Science, University of Copenhagen, 1989.
20. Neil D. Jones, Carsten K. Gomard, and Peter Sestoft. Partial Evaluation and Automatic Program Generation. Prentice-Hall, 1993.
21. Torben Æ. Mogensen. Partially static structures in a self-applicable partial evaluator. In Dines Bjørner, Andrei P. Ershov, and Neil D. Jones, editors, Partial Evaluation and Mixed Computation, pages 325-347. North-Holland, 1988.
22. Flemming Nielson and Hanne R. Nielson. Two-Level Functional Languages, volume 34 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge, 1992.
23. Sergei A. Romanenko. A compiler generator produced by a self-applicable specializer can have a surprisingly natural and understandable structure. In Dines Bjørner, Andrei P. Ershov, and Neil D. Jones, editors, Partial Evaluation and Mixed Computation, pages 445-463. North-Holland, 1988.
24. Peter Sestoft. Automatic call unfolding in a partial evaluator. In Dines Bjørner, Andrei P. Ershov, and Neil D. Jones, editors, Partial Evaluation and Mixed Computation, pages 485-506. North-Holland, 1988.
25. Morten Heine Sørensen, Robert Glück, and Neil D. Jones. Towards unifying partial evaluation, deforestation, supercompilation, and GPC. In Donald Sannella, editor, Programming Languages and Systems-ESOP’94-Proceedings, volume 788 of LNCS, pages 485-500, Edinburgh, Scotland, 1994. Springer-Verlag.
26. Valentin F. Turchin. Refal-5, Programming Guide and Reference Manual. New England Publishing Co., Holyoke, Massachusetts, 1989.
27. Mitchell Wand. Specifying the correctness of binding-time analysis. Journal of Functional Programming, 3(3):365-387, 1993.