Eta-Expansion Does the Trick

ACM Transactions on Programming Languages and Systems

Volumn 18, Issue 6, 1996, Pages 730-751

  Danvy, Olivier ^a   Malmkjær, Karoline ^a   Palsberg, Jens ^b,c  

^a AARHUS UNIVERSITY   (Denmark)

^b Department of Nucl Engineering

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

D.1.1 Programming Techniques : Applicative (Functional) Programming; D.3.3 Programming Languages : Language Constructs and Features Procedures, functions, and subroutines

Indexed keywords

ALGORITHMS; FORMAL LANGUAGES; FORMAL LOGIC; FUNCTION EVALUATION; PROGRAM COMPILERS; PROGRAM PROCESSORS; SUBROUTINES;

AUTOMATIC PROGRAMMING; BINDING TIME COERCION; BINDING TIME IMPROVEMENTS; COMPILER GENERATORS; ETA EXPANSION; FUNCTIONAL CONSTRUCTS; OPERATIONAL SEMANTICS; PARTIAL EVALUATION; PROGRAM TRANSFORMATION; TRANSLATOR WRITING SYSTEMS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0030289450     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/236114.236119     Document Type: Article

References (42)

1. ASHLEY, J. M. AND CONSEL, C. 1994. Fixpoint computation for polyvariant static analyses of higher-order applicative programs. ACM Trans. Program. Lang. Syst. 16, 5, 1431-1448.
2. BARENDREGT, H. 1984. The Lambda Calculus - Its Syntax and Semantics. North-Holland, Amsterdam, The Netherlands.
3. BERGER, U. AND SCHWICHTENBERG, H. 1991. An inverse of the evaluation functional for typed λ-calculus. In Proceedings of the 6th Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, Los Alomitos, Calif., 203-211.
4. BONDORF, A. 1991. Automatic autoprojection of higher-order recursive equations. Sci. Comput. Program. 17, 1-3, 3-34. Special issue on ESOP'90, the Third European Symposium on Programming, May 1990.
5. BONDORF, A. 1991. Automatic autoprojection of higher-order recursive equations. Sci. Comput. Program. 17, 1-3, 3-34. Special issue on ESOP'90, the Third European Symposium on Programming, May 1990.
6. BONDORF, A. 1992. Improving binding times without explicit cps-conversion. In Proceedings of the 1992 ACM Conference on Lisp and Functional Programming, W. Clinger, Ed. LISP Pointers 5, 1 (June), 1-10.
7. BONDORF, A. AND DANVY, O. 1991. Automatic autoprojection of recursive equations with global variables and abstract data types. Sci. Comput. Program. 16, 151-195.
8. 4 report on the algorithmic language Scheme. LISP Pointers 4, 3 (July-Sept.), 1-55.
9. CONSEL, C. 1993a. Polyvariant binding-time analysis for applicative languages. In Proceedings of the 2nd ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, D. A. Schmidt, Ed. ACM Press, New York, 66-77.
10. CONSEL, C. 1993b. A tour of Schism: A partial evaluation system for higher-order applicative languages. In Proceedings of the 2nd ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, D. A. Schmidt, Ed. ACM Press, New York, 145-154.
11. CONSEL, C. AND DANVY, O. 1991. For a better support of static data flow. In Proceedings of the 5th ACM Conference on Functional Programming and Computer Architecture, J. Hughes, Ed. Lecture Notes in Computer Science, vol. 523. Springer-Verlag, Berlin, 496-519.
12. CONSEL, C. AND DANVY, O. 1993. Tutorial notes on partial evaluation. In Proceedings of the 20th Annual ACM Symposium on Principles of Programming Languages, S. L. Graham, Ed. ACM Press, New York, 493-501.
13. DANVY, O. 1996. Type-directed partial evaluation. In Proceedings of the 23rd Annual ACM Symposium on Principles of Programming Languages, G. L. Steele, Ed. ACM Press, New York, 242-257.
14. DANVY, O. AND FILINSKI, A. 1990. Abstracting control. In Proceedings of the 1990 ACM Conference on Lisp and Functional Programming, M. Wand, Ed. ACM Press, New York, 151-160.
15. DANVY, O., MALMKJÆR, K., AND PALSBERG, J. 1995. The essence of eta-expansion in partial evaluation. LISP Symbol. Comput. 8, 3, 209-227. An earlier version appeared in the Proceedings of the 1994 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation.
16. DANVY, O., MALMKJÆR, K., AND PALSBERG, J. 1995. The essence of eta-expansion in partial evaluation. LISP Symbol. Comput. 8, 3, 209-227. An earlier version appeared in the Proceedings of the 1994 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation.
17. DUSSART, D., HENGLEIN, F., AND MOSSIN, C. 1995. Polymorphic recursion and subtype qualifications: Polymorphic binding-time analysis in polynomial time. In Static Analysis, A. Mycroft, Ed. Lecture Notes in Computer Science, vol. 983. Springer-Verlag, Glasgow, Scotland, 118-135.
18. GOMARD, C. K. 1992. A self-applicable partial evaluator for the lambda-calculus: Correctness and pragmatics. ACM Tram. Program. Lang. Syst. 14, 2, 147-172.
19. GOMARD, C. K. AND JONES, N. D. 1991. A partial evaluator for the untyped lambda-calculus. J. Funct. Program. 1, 1, 21-69.
20. HEINTZE, N. 1992. Set-based program analysis. Ph.D. thesis, School of Computer Science, Carnegie Mellon Univ. Pittsburgh, Pa.
21. HENGLEIN, F. 1993. Dynamic typing: Syntax and proof theory. Sci. Comput. Program. 22, 3, 197-230. Special Issue on ESOP'92, the Fourth European Symposium on Programming, February 1992.
22. HENGLEIN, F. 1993. Dynamic typing: Syntax and proof theory. Sci. Comput. Program. 22, 3, 197-230. Special Issue on ESOP'92, the Fourth European Symposium on Programming, February 1992.
23. HOLST, C. K. AND HUGHES, J. 1990. Towards binding-time improvement for free. In Functional Programming, Glasgow 1990, S. L. Peyton Jones, G. Hutton, and C. K. Holst, Eds. Springer-Verlag, Berlin, 83-100.
24. JONES, N. D. 1988. Automatic program specialization: A re-examination from basic principles. In Partial Evaluation and Mixed Computation, D. Bjørner, A. P. Ershov, and N. D. Jones, Eds. North-Holland, Amsterdam, The Netherlands, 225-282.
25. JONES, N. D., GOMARD, C. K., AND SESTOFT, P. 1993. Partial Evaluation and Automatic Program Generation. Prentice-Hall, Englewood Cliffs, N.J.
26. JONES, N. D., SESTOFT, P., AND SØNDERGAARD, H. 1989. MIX: A self-applicable partial evaluator for experiments in compiler generation. LISP Symbol. Comput. 2, 1, 9-50.
27. LAWALL, J. L. AND DANVY, O. 1994. Continuation-based partial evaluation. In Proceedings of the 1994 ACM Conference on Lisp and Functional Programming, C. L. Talcott, Ed. LISP Pointers 7, 3 (June), 227-238.
28. LAWALL, J. L. AND DANVY, O. 1995. Continuation-based partial evaluation. Tech. Rep. CS-95-178, Computer Science Dept., Brandeis Univ. Waltham, Mass. Jan. An earlier version appeared in the Proceedings of the 1994 ACM Conference on Lisp and Functional Programming.
29. LAWALL, J. L. AND DANVY, O. 1995. Continuation-based partial evaluation. Tech. Rep. CS-95-178, Computer Science Dept., Brandeis Univ. Waltham, Mass. Jan. An earlier version appeared in the Proceedings of the 1994 ACM Conference on Lisp and Functional Programming.
30. MALMKJÆR, K. 1993. Towards efficient partial evaluation. In Proceedings of the 2nd ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, D. A. Schmidt, Ed. ACM Press, New York, 33-43.
31. MINAMIDE, Y., MORRISETT, G., AND HARPER, R. 1996. Typed closure conversion. In Proceedings of the 23rd Annual ACM Symposium on Principles of Programming Languages, G. L. Steele, Ed. ACM Press, New York, 271-283.
32. NIELSON, F. AND NIELSON, H. R. 1992. Two-Level Functional Languages. Cambridge Tracts in Theoretical Computer Science, vol. 34. Cambridge University Press, Cambridge, England.
33. PALSBERG, J. 1993. Correctness of binding-time analysis. J. Funct. Program. 3, 3 (July), 347-363.
34. PAULIN-MOHRING, C. AND WERNER, B. 1993. Synthesis of ML programs in the system Coq. J. Symbol. Comput. 15, 607-640.
35. REYNOLDS, J. C. 1972. Definitional interpreters for higher-order programming languages. In Proceedings of 25th ACM National Conference. ACM Press, New York, 717-740.
36. REYNOLDS, J. C. 1983. Types, abstraction and parametric polymorphism. In Information Processing 83, R. E. A. Mason, Ed. IFIP, Montvale, N.J., 513-523.
37. RUF, E. 1993. Topics in online partial evaluation. Ph.D. thesis, Stanford Univ., Stanford, Calif. Tech. Rep. CSL-TR-93-563.
38. SESTOFT, P. 1989. Replacing function parameters by global variables. In Proceedings of the 4th International Conference on Functional Programming and Computer Architecture, J. E. Stoy, Ed. ACM Press, New York, 39-53.
39. SHIVERS, O. 1991. Control-flow analysis of higher-order languages or taming lambda. Ph.D. thesis, School of Computer Science, Carnegie Mellon Univ. Pittsburgh, Pa. Tech. Rep. CMU-CS-91-145.
40. WADLER, P, 1989. Theorems for free! In Proceedings of the 4th International Conference on Functional Programming and Computer Architecture, J. E. Stoy, Ed. ACM Press, New York, 347-359.
41. WAND, M. 1993. Specifying the correctness of binding-time analysis. J. Funct. Program. 3, 3 (July), 365-387.
42. WEISE, D., CONYBEARE, R., RUF, E., AND SELIGMAN, S. 1991. Automatic online partial evaluation. In Proceedings of the 5th ACM Conference on Functional Programming and Computer Architecture, J. Hughes, Ed. Lecture Notes in Computer Science, vol. 523. Springer-Verlag, Berlin, 165-191.