Type Reconstruction with First-Class Polymorphic Values

ACM SIGPLAN Notices

Volumn 24, Issue 7, 1989, Pages 207-217

  O'Toole, J W ^a   Gifford, D K ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES--DESIGN; DATA PROCESSING--DATA STRUCTURES;

POLYMORPHISM; TYPE RECONSTRUCTION; TYPE THEORY;

COMPUTER METATHEORY;

EID: 0024700265     PISSN: 03621340     EISSN: 15581160     Source Type: Journal    
DOI: 10.1145/74818.74836     Document Type: Article

References (21)

1. Boehm, H. J., “Partial polymorphic type inference is undecidable”, 26th Annual Symposium on Foundations of Computer Science, October 1985, pages 339-345.
2. Damas, L., Milner, R., “Principal type-schemes for functional programs”, Proceedings of the 9th Annual Symposium on Principles of Programming Languages, January 1982, pages 207-212.
3. Damas, L., “Type Assignment in Programming Lanuages”, Ph.D. Thesis CST-33-85, University of Edinburgh, April 1985.
4. Fortune S., Leivant D., and O'Donnell M., “Simple and Second-order Type Structures”, Journal of the Association for Computing Machinery, January 1983.
5. Gifford, D. K., Jouvelot, P., Lucassen, J. M., Sheldon, M. A., The FX-87 Reference Manual, MIT/LCS/TR-407, October 1987.
6. Goldfarb, W. D., “The undecidability of the second-order unification problem”, Theoretical Computer Science, vol. 13, 1981, pages 225-230.
7. Hindley, R., “The principal type-scheme of an object in combinatory logic”, Transactions of the American Mathematical Society, vol. 146, 1969, pages 29-60.
8. Kfoury, A. J., Tiuryn, J., and Urzyczyn, P., “A Proper Extension of ML with an effective Type-Assignment”, Proceedings of the 15th Annual POPL, 1988.
9. Leivant, D., “Polymorphic Type Inference”, Proceedings of the 10th Annual Symposium on Principles of Programming Languages, 1983.
10. Lucassen, J. M., Types and Effects: Towards the Integration of Functional and Imperative Programming, Ph.D. Thesis MIT/LCS/TR-408, Massachusetts Institute of Technology, September 1987.
11. MacQueen, D., “Modules for Standard ML”, Proceedings of the 1984 ACM Conference on LISP and Functional Programming, 1984, pages 198-207.
12. McCracken, N. J. An Investigation of a Programming Language with a Polymorphic Type Structure. Ph.D. Thesis, Syracuse University, 1979.
13. McCracken, N. J., “The Typechecking of Programs with Implicit Type Structure”, Semantics of Data Types, vol. 173 of Lecture Notes in Computer Science, June 1984, pages 301-315.
14. Milner, R., “A Theory of Type Polymorphism in Programming”, Journal of Computer and System Sciences, vol. 17, 1978, pages 349-375.
15. Morris, J. H., Lambda-Calculus Models of Programming Languages, Massachusetts Institute of Technology, MAC-TR-57, 1968.
16. O'Toole, James William, Jr., Type Reconstruction with First Class Polymorphic Values, MIT/LCS/TM-380, 1989.
17. Pfenning, Frank, “Partial Polymorphic Type Inference and Higher Order Unification”, Proceedings of ACM Conference on Lisp and Functional Programming, 1988.
18. Rees, J. A., and Clinger, William, Editors, The Revised3 Report on the Algorithmic Language Scheme, MIT/AI/Memo-848a, 1986.
19. Reynolds, J. C., “Definitional Interpreters for higher order programming languages”, Proceedings of the 5th Annual POPL, January 1978, pages 39-46.
20. Robinson, J. A., “A machine-oriented logic based on the resolution principle”, JACM 12, 1 (1965), pages 23-41.
21. Tofte, Mads, Operational Semantics and Polymorphic Type Inference, Ph.D. Thesis, University of Edinburgh, 1987.