Higher-order uncurrying

Higher-Order and Symbolic Computation

Volumn 13, Issue 3, 2000, Pages 179-216

  Hannan, John ^b   Hicks, Patrick ^a,b  

^a Brother Boniface Hicks OSB   (United States)

^b The Pennsylvania State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL LINGUISTICS; FUNCTIONS; THEOREM PROVING;

HIGHER ORDER UNCURRYING; PROGRAM TRANSFORMATIONS; SEMANTIC BASED PROGRAM ANALYSIS; TYPE SYSTEMS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0034268990     PISSN: 13883690     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1010006229549     Document Type: Article

References (34)

1. Appel, A.W. Compiling with Continuations. Cambridge University Press, 1992.
2. Curry, H.B. Grundlagen der Kombinatorischen Logik. American Journal of Mathematics 52 (1930) 509-536 and 789-834.
3. Curry, H.B. and Feys, R. Combinatory Logic, Vol. I. North Holland, 1958.
4. Curry, H.B., Hindley, J., and Seldin, J.P. Combinatory Logic, Vol. II. North Holland, 1972.
5. Danvy, O. and Schultz, U.P. Lambda dropping: Transforming recursive equations into programs with block structure. Technical Report RS-99-27, BRICS, in Theoretical Computer Science, Vol. 248, No. 1-2, November 2000.
6. Gentzen, G. Investigations into logical deduction. In The Collected Papers of Gerhard Gentzen, M. Szabo (Ed.). North-Holland Publishing Co., 1969, pp. 68-131.
7. Gomard, C.K. Partial type inference for untyped functional programs. In Proceedings of the 1990 ACM Conference on Lisp and Functional Programming, 1990, pp. 282-287.
8. Hannan, J. Type systems for closure conversions. In Participants' Proceedings of the Workshop on Types for Program Analysis, H.R. Nielson and K.L. Solberg (Eds.). 1995, pp. 48-62.
9. Hannan, J. A type-based escape analysis for functional languages. Journal of Functional Programming 8(3) (1998) 239-273.
10. Hannan, J. and Hicks, P. Higher-order arity raising. In Proceedings of the Third International Conference on Functional Programming, P. Hudak and C. Queinnec (Eds.). 1998, pp. 27-38.
11. Hannan, J. and Hicks, P. Higher-order unCurrying. In Proceedings of the 25th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. 1998, pp. 1-11.
12. Hannan, J., Hicks, P., and Liben-Nowell, D. A lifetime analysis for higher-order languages. Technical Report CSE-97-014, Penn State University, 1997.
13. Hannan, J. and Pfenning, F. Compiler verification in LF. In Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science, A. Scedrov (Ed.). 1992, pp. 407-418.
14. Harper, R., Honsell, F., and Plotkin, G. A framework for defining logics. Journal of the ACM 40(1) (1993) 143-184. A preliminary version appeared in Symposium on Logic in Computer Science, pp. 194-204, June 1987.
15. Harper, R., Honsell, F., and Plotkin, G. A framework for defining logics. Journal of the ACM 40(1) (1993) 143-184. A preliminary version appeared in Symposium on Logic in Computer Science, pp. 194-204, June 1987.
16. Heintze, N. Set-based program analysis. Ph.D. Thesis, School of Computer Science, Carnegie Mellon University, 1992.
17. Jim, T. Rank 2 type systems and recursive definitions. Technical Memorandum MIT/LCS/TM-531, Massachusetts Institute of Technology, Laboratory for Computer Science, 1995.
18. Johnsson, T. Lambda lifting: Transforming programs to recursive equations. In Functional Programming Languages and Computer Architecture, J.-P. Jouannaud (Ed.). Vol. 201 of Lecture Notes in Computer Science. 1985, pp. 190-203.
19. Leroy, X. The ZINC experiment: An economical implementation of the ML Language. Technical Report 117, INRIA, 1990.
20. Michaylov, S. and Pfenning, F. Natural semantics and some of its meta-theory in Elf. In Extensions of Logic Programming, L. Hallnas (Ed.). 1992, pp. 299-344. A preliminary version is available as Technical Report MPI-I-91-211, Max-Planck-Institute for Computer Science, Saarbrucken, Germany, Aug. 1991.
21. Milner, R. A theory of type polymorphism in programming. Journal of Computer and System Sciences 17(3) (1998) 348-375.
22. Minamide, Y., Morrisett, G., and Harper, R. Typed closure conversion. In 23rd ACM Symposium on Principles of Programming Languages, St. Petersburg, FL, 1996, pp. 271-283.
23. Nipkow, T. and Prehofer, C. Type reconstruction for type classes. Journal of Functional Programming 5(2) (1995) 201-224.
24. Peyton Jones, S.L., Partain, W., and Santos, A. Let-floating: Moving bindings to give faster programs. In Proceedings of the ACM SIGPLAN International Conference on Functional Languages, R. Harper (Ed.). 1996, pp. 1-12.
25. Pfenning, F. Elf: A language for logic definition and verified meta-programming. In Fourth Annual Symposium on Logic in Computer Science, 1989, pp. 313-322.
26. Prawitz, D. Natural Deduction. Uppsala: Almqvist & Wiksell, 1965.
27. Schönfinkel, M. Über die Bausteine der Mathematischen Logik. Mathematische Annalen 92 (1924) 305-316. English translation in From Frege to Gödel, Jan van Heijenoort editor, Harvard University Press, 1967, pp. 355-366.
28. Schönfinkel, M. Über die Bausteine der Mathematischen Logik. Mathematische Annalen 92 (1924) 305-316. English translation in From Frege to Gödel, Jan van Heijenoort editor, Harvard University Press, 1967, pp. 355-366.
29. Shivers, O. Control-flow analysis of higher-order languages. Ph.D. Thesis, Carnegie-Mellon University, 1991.
30. Tarditi, D. Design and implementation of code optimizations for a type-directed compiler for standard ML. Ph.D. Thesis, Carnegie Mellon University. Available as CMU CS Technical Report 97-108, 1996.
31. Tarditi, D., Morrisett, G., Cheng, P., Stone, C., Harper, B., and Lee, P. TIL: A Type-directed optimizing compiler for ML. In Proceedings of the 1996 ACM SIGPLAN Conference on Programming Language Design and Implementation, 1996, pp. 181-192.
32. Tofte, M. Operational semantics and polymorphic type inference. Ph.D. Thesis, University of Edinburgh, 1987.
33. Tofte, M. and Talpin, J.-P. Implementation of the typed call-by-value λ-calculus using a stack of regions. In Conf. Rec. 21st ACM Symposium on Principles of Programming Languages, 1994, pp. 188-201.
34. Wand, M. and Steckler, P. Lightweight closure conversion. ACM Trans. Program. Lang. Syst. 19(1) (1997) 48-86.