Type-directed partial evaluation

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn Conference Record of the Annual ACM Symposium on Principles of Programming Languages, Issue , 1996, Pages 242-256

  Danvy, Olivier ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL LINGUISTICS; COMPUTATIONAL METHODS; CONSTRAINT THEORY; MATHEMATICAL OPERATORS; OPTIMIZATION; PROGRAM COMPILERS; PROGRAM PROCESSORS; RECURSIVE FUNCTIONS; STATISTICAL METHODS; THEOREM PROVING;

DISJOINT SUMS; DYNAMIC CONTEXTS; INVERSE OF THE EVALUATION FUNCTIONAL; LAMBDA CALCULUS; PARAMETRICITY; RESIDUAL PROGRAM; RUNTIME CODE GENERATION; SOURCE PROGRAMS; STATIC VALUES; TYPE DIRECTED PARTIAL EVALUATION;

PROGRAMMING THEORY;

EID: 0029706995     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/237721.237784     Document Type: Conference Paper

References (52)

1. Thorsten Altenkirch, Martin Hofmann, and Thomas Streicher. Categorical reconstruction of a reduction free reduction proof. In Peter Dybjer and Randy Pollack, editors, Informal Proceedings of the Joint CLICS-TYPES Workshop on Categories and Type Theory, Göteborg, Sweden, May 1995. Report 85, Programming Methodology Group, Chalmers University and the University of Göteborg.
2. Henk Barendregt. The Lambda Calculus-Its Syntax and Semantics. North-Holland, 1984.
3. Ulrich Berger and Helmut Schwichtenberg. An inverse of the evaluation functional for typed A-calculus. In Proceedings of the Sixth Annual IEEE Symposium on Logic in Computer Science, pages 203-211, Amsterdam, The Netherlands, July 1991. IEEE Computer Society Press.
4. Lars Birkedal and Morten Welinder. Partial evaluation of Standard ML. Master's thesis, DIKU, Computer Science Department, University of Copenhagen, August 1993. DIKU report 93/22.
5. Hans-J. Boehm, editor. Proceedings of the Twenty-First Annual ACM Symposium on Principles of Programming Languages, Portland, Oregon, January 1994. ACM Press.
6. Anders Bondorf. Self-Applicable Partial Evaluation. PhD thesis, DIKU, Computer Science Department, University of Copenhagen, Copenhagen, Denmark, 1990. DIKU Report 90-17.
7. Anders Bondorf. Improving binding times without ex-phcit cps-conversion. In William dinger, editor, Proceedings of the 1992 ACM Conference on Lisp and Functional Programming, LISP Pointers, Vol. V, No. 1, pages 1-10, San Francisco, California, June 1992. ACM Press.
8. Anders Bondorf and Olivier Danvy. Automatic auto-projection of recursive equations with global variables and abstract data types. Science of Computer Programming, 16:151-195, 1991.
9. Anders Bondorf and Jesper Jörgensen. Efficient analyses for realistic off-line partial evaluation. Journal of Functional Programming, 3(3):315-346, 1993.
10. William dinger and Jonathan Rees (editors). Revised report on the algorithmic language Scheme. LISP Pointers, IV(3):l-55, July-September 1991.
11. Charles Consel. Analyse de Programmes, Evaluation Partielle et Génération de Compilateurs. PhD thesis, Université Pierre et Marie Curie (Paris VI), Paris, France, June 1989.
12. Charles Consel. Polyvariant binding-time analysis for applicative languages. In David A. Schmidt, editor. Proceedings of the Second ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pages 66-77, Copenhagen, Denmark, June 1993. ACM Press.
13. Charles Consel and Olivier Danvy. From interpreting to compiling binding times. In Neil D. Jones, editor. Proceedings of the Third European Symposium on Programming, number 432 in Lecture Notes in Computer Science, pages 88-105, Copenhagen, Denmark, May 1990.
14. Charles Consel and Olivier Danvy. Static and dynamic semantics processing. In Robert (Corky) Cartwright, editor, Proceedings of the Eighteenth Annual ACM Symposium on Principles of Programming Languages, pages 14-24, Orlando, Florida, January 1991. ACM Press.
15. 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.
16. Olivier Danvy and Andrzej Filinski. Abstracting control. In Mitchell Wand, editor. Proceedings of the 1990 ACM Conference on Lisp and Functional Programming, pages 151-160, Nice, France, June 1990. ACM Press.
17. Olivier Danvy and Andrzej Filinski. Representing control, a study of the CPS transformation. Mathematical Structures in Computer Science, 2(4):361-391, December 1992.
18. Olivier Danvy, Karoline Malmkjœr, and Jens Palsberg. The essence of eta-expansion in partial evaluation. LISP and Symbolic Computation, 8(3):209-227, 1995. An eariier version appeared in the proceedings of the 1994 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation.
19. Olivier Danvy, Karoline Malmkjœr, and Jens Palsberg. Eta-expansion does The Trick. Technical report BRIGS RS-95-41, DAIMI, Computer Science Department, Aar-hus University, Aarhus, Denmark, August 1995.
20. Rowan Davies and Frank Pfenning. A modal analysis of staged computation. In Guy L. Steele Jr., editor. Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Programming Languages, St. Petersburg Beach, Florida, January 1996. ACM Press.
21. Matthias Felleisen. The theory and practice of first-class prompts. In Jeanne Ferrante and Peter Mager, editors, Proceedings of the Fifteenth Annual ACM Symposium on Principles of Programming Languages, pages 180190, San Diego, California, January 1988.
22. Andrzej Filinski. Representing monads. In Boehm [5], pages 446-457.
23. Andrzej Filinski. Controlling Effects. PhD thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, Pennsylvania, 1995.
24. Daniel P. Friedman, Mitchell Wand, and Christopher T. Haynes. Essentials of Programming Languages. The MIT Press and McGraw-Hill, 1991.
25. Yoshihito Futamura. Partial evaluation of computation process-an approach to a compiler-compiler. Systems, Computers, Controls 2, 5, pages 45-50, 1971.
26. Robert Glück and Jesper Jörgensen. Efficient multilevel generating extensions for program speciahzation. In S. D. Swierstra and M. Hermenegildo, editors. Seventh International Symposium on Programming Language Implementation and Logic Programming, number 982 in Lecture Notes in Computer Science, pages 259278, Utrecht, The Netherlands, September 1995.
27. Mayer Goldberg. Recursive Application Survival m the \-Calculus. PhD thesis, Computer Science Department, Indiana University, Bloomington, Indiana, 1996. Forthcoming.
28. John Hatcliff and Olivier Danvy. A generic account of continuation-passing styles. In Boehm [5], pages 458471.
29. Fritz Henglein. Dynamic typing: Syntax and proof theory. Science of Computer Programming, 22(3):197-230, 1993. Special Issue on ESOP'92, the Fourth European Symposium on Programming, Rennes, February 1992.
30. Gérard Huet. Resolution d'équations dans les langages d'ordre 1, 2, uj. Thèse d'Etat, Université de Paris VII, Paris, France, 1976.
31. C. Barry Jay and Neil Ghani. The virtues of eta-expansion. Iournal of Functional Programming, 5(3):135-154, 1995.
32. Neil D. Jones, editor. Semantics-Directed Compiler Generation, number 94 in Lecture Notes in Computer Science, Aarhus, Denmark, 1980.
33. Neil D. Jones. Challenging problems in partial evaluation and mixed computation. In Partial Evaluation and Mixed Computation, pages 1-14. North-Holland, 1988.
34. Neil D. Jones. Mix ten years after. In WiUiam L. Scherhs, editor. Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pages 24-38, La JoIIa, California, June 1995.
35. Neil D. Jones, Carsten K. Gomard, Anders Bondorf, Ohvier Danvy, and Torben JE. Mogensen. A self-appUcable partial evaluator for the lambda calculus. In K. C. Tai and Alexander L. Wolf, editors. Proceedings of the 1990 IEEE International Conference on Computer Languages, pages 49-58, New Orleans, Louisiana, March 1990.
36. Neil D. Jones, Carsten K. Gomard, and Peter Sestoft. Partial Evaluation and Automatic Program Generation. Prentice Hall International Series in Computer Science. Prentice-Hall, 1993.
37. John Launchbury. Projection Factorisations m Partial Evaluation. Distinguished Dissertations in Computer Science. Cambridge University Press, 1991.
38. Julia L. Lawall and Olivier Danvy. Continuation-based partial evaluation. In Carolyn L. Talcott, editor, Proceedings of the 1994 ACM Conference on Lisp and Functional Programming, LISP Pointers, Vol. VII, No. 3, Orlando, Florida, June 1994. ACM Press.
39. Ralph Loader. NormaUsation by translation. Technical report, Computing Laboratory, Oxford University, April 1995.
40. Karoline Malmkjœr, Nevin Heintze, and Olivier Danvy. ML partial evaluation using set-based analysis. In John Reppy, editor, Record of the 1994 ACM SIGPLAN Workshop on ML and its Applications, Rapport
41. de recherche No 2265, INRIA, 112-119 Orlando, Florida, June 1994. Also appears as Technical report CMU-CS-94-129
42. Torben M. Mogensen. Binding Time Aspects of Partial Evaluation. PhD thesis, DIKU, Computer Science Department, University of Copenhagen, Copenhagen, Denmark, March 1989.
43. Eugenio Moggi. Notions of computation and monads. Information and Computation, 93:55-92, 1991.
44. Peter D. Mosses. SIS-semantics implementation system, reference manual and user guide. Technical Report MD-30, DAIMI, Computer Science Department, Aarhus University, Aarhus, Denmark, 1979.
45. Flemming Nielson and Hanne Riis Nielsen. Two-Level Functional Languages, volume 34 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1992.
46. Larry Paulson. Compiler generation from denotational semantics. In Bernard Lorho, editor, Methods and Tools for Compiler Construction, pages 219-250. Cambridge University Press, 1984.
47. Frank Pfenning. Logic programming in the LF logical framework. In Gerard Huet and Gordon Plotkin, editors, Logical Frameworks, pages 149-181. Cambridge University Press, 1991.
48. John C. Reynolds. The essence of Algol. In van Vliet, editor, International Symposium on Algorithmic Languages, pages 345-372, Amsterdam, 1982. North-Holland.
49. Erik Ruf. Topics in Online Partial Evaluation. PhD thesis, Stanford University, Stanford, California, February 1993. Technical report CSL-TR-93-563.
50. Guy L. Steele Jr. Rabbit: A compiler for Scheme. Technical Report AI-TR-474, Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, Massachusetts, May 1978.
51. Philip Wadler. The essence of functional programming (tutorial). In Andrew W. Appel, editor, Proceedings of the Nineteenth Annual ACM Symposium on Principles of Programming Languages, pages 1-14, Albuquerque, New Mexico, January 1992. ACM Press.
52. Daniel Weise, Roland Conybeare, Erik Ruf, and Scott Sehgman. Automatic online partial evaluation. In John Hughes, editor. Proceedings of the Fifth ACM Conference on Functional Programming and Computer Architecture, number 523 in Lecture Notes in Computer Science, pages 165-191, Cambridge, Massachusetts, August 1991.