A type-directed, on-line, partial evaluator for a polymorphic language

Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation

Volumn , Issue , 1997, Pages 22-35

  Sheard, Tim ^a  

^a OREGON HEALTH AND SCIENCE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL MECHANICS; COMPUTER PROGRAMMING LANGUAGES; DIFFERENTIATION (CALCULUS); CODES (SYMBOLS); COMPUTATIONAL LINGUISTICS; DATA STRUCTURES; ENCODING (SYMBOLS); FORMAL LANGUAGES;

INDUCTIVE DATATYPES; LAMBDA CALCULUS; MODULE SYSTEMS; PARTIAL EVALUATION; PRIMITIVE OPERATOR; SIMPLE METHOD; SPEEDUP RATIO; TECHNICAL INNOVATION;

SEMANTICS; COMPUTER SOFTWARE;

LAMBDA CALCULUS; PARTIAL EVALUATOR; POLYMORPHIC LANGUAGE;

EID: 0030656876     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/258993.258999     Document Type: Conference Paper

References (22)

1. T. Altenkirch, M. Hofmann, and T. Streicher. Categorical reconstruction of a reduction free normalization proof. Lecture Notes in Computer Science, 953, 1995.
2. U. Berger and H. Schwichtenberg. An inverse of the evaluation functional for typed λ-calculus. In LICS'91, Symposium on Logic in Computer Science, Amsterdam, pages 203-211. IEEE, 1991.
3. A. Bondorf. Automatic autoprojection of higher order recursive equations. In N.D. Jones, editor, ESOP '90. 3rd European Symposium on Programming, Copenhagen, Denmark, May 1990 (Lecture Notes in Computer Science, Vol. 432), pages 70-87. Berlin: Springer-Verlag, May 1990.
4. A. Bondorf. Improving binding times without explicit cps-conversion. In 1992 ACM Conference in Lisp and Functional Programming, San Francisco, California (Lisp Pointers, Vol. V, no. 1, 1992), pages 1-10. New York: ACM, 1992.
5. C. Consel. Binding time analysis for higher order untyped functional languages. In 1990 ACM Conference on Lisp and Functional Programming, Nice, France, pages 264-272. New York: ACM, 1990.
6. C. Consel and 0. Danvy. For a better support of static data flow. In J. Hughes, editor, Functional Programming Languages and Computer Architecture, Cambridge, Massachusetts, August 1991 (Lecture Notes in Computer Science, Vol. 523), pages 496-519. New York: ACM, Berlin: Springer-Verlag, 1991.
7. C. Consel and O. Danvy. Partial evaluation in parallel. LISP and Symbolic Computation, 5(4):315-330, 1993.
8. R. Di Cosmo. Isomorphisms of types: from λ-calculus to information retrieval and language design. In Ronald V. Book, editor, Progress in Theoretical Computer Science. Birkhäuser, 1995.
9. O. Danvy. Type-directed partial evaluation. In POPL'96: The 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, St. Petersburg, Florida, January 1996, pages 242-257. ACM, 1996.
10. O. Danvy and A. Filinski. Abstracing control. In 1990 ACM Conference on Lisp and Functional Programming, pages 151-160. ACM, ACM Press, June 1990.
11. O. Danvy, K. Malmkjaer, and J. Palsberg. The essence of eta-expansion in partial evaluation. Lisp and Symbolic Computation, 8(3):209-228, September 1995.
12. L. Fegaras and T. Sheard. Revisiting catamor-phisms over datatypes with embedded functions (or, programs from outer space). In Conference Record of the 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'96), pages 284-294, St. Petersburg, Florida, January 21-24, 1996. ACM Press.
13. A. Filinski. Representing monads. In Conference Record of the 21st Annual ACM Symposium on Principles of Programming Languages, pages 446-457. ACM, ACM, January 1994.
14. C. K. Gomard. Higher order partial evaluation - HOPE for the lambda calculus. Master's thesis, DIKU, University of Copenhagen, Denmark, September 1989.
15. C.K. Gomard and N.D. Jones. A partial evaluator for the untyped lambda-calculus. Journal of Functional Programming, l(l):21-69, January 1991.
16. J. Hughes. Type specialisation for the λ-calculus; or, a new paradigm for partial evaluation based on type inference. Technical report, Department of Copmuter Science, Chalmers Technical University, URL: http://www.cs.chalmers.se/rjmh., 1996.
17. C. B. Jay. Long ßn normal forms and confluence (revised). Technical Report ECS-LFCS-91-183, Department of Computer Science, University of Edinburgh, June 1992. revised version available at http://theory.doc.ic.ac.uk/ tfm/papers/JayCB/longbeta-eta.dvi.Z.
18. N.D. Jones, C.K. Gomard, and P. Sestoft. Partial Evaluation and Automatic Program Generation. Englewood Cliffs, NJ: Prentice Hall, 1993.
19. J. Launchbury. A strongly typed self-applicable partial evaluator. In FPCA '91: Conference on Functional Programming Languages and Computer Architecture, Cambridge, Ma., pages 145-164, Berlin, August 1991. Springer-Verlag, LNCS 523.
20. E. Ruf. Topics in Online Partial Evaluation. PhD thesis, Stanford University, California, February 1993. Published as technical report CSL-TR-93-563.
21. E. Ruf and D. Weise. On the specialization of online program specializers. Journal of Functional Programming, 3(3):251-281, July 1993.
22. T. Sheard. Well typed meta-programming systems. Technical Report 95-013, Oregon Graduate Institute, P.O. Box 91000, Portland, Oregon 97291-1000 USA, November 1995.