A complete type inference system for subtyped recursive types

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 789 LNCS, Issue , 1994, Pages 667-686

  Sekiguchi, Tatsurou ^a   Yonezawa, Akinori ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE; FORESTRY; FORMAL LANGUAGES; INFERENCE ENGINES; POLYMORPHISM;

PARAMETRIC POLYMORPHISM; PRINCIPAL TYPING; PROGRAMMING TOOLS; RECURSIVE TYPES; SOUNDNESS AND COMPLETENESS; TYPE INFERENCE ALGORITHM; TYPE INFERENCES; TYPE SYSTEMS;

OBJECT ORIENTED PROGRAMMING;

EID: 21344476252     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-57887-0_120     Document Type: Conference Paper

References (18)

1. Robert M. Amadio and Luca Cardelli. Subtyping Recursive Types. In Conference Record of the Eighteenth Annual ACM Symposium on Principles of Programming Languages, pages 104-118, January 1991.
2. Robert M. Amadio and Luca Cardelli. Subtyping Recursive Types. In ACM Transactions on Programming Languages and Systems, volume 15, pages 575-631, 1993.
3. Gerald Baumgartner and Vincent F. Russo. Signatures: A C++ Extension for Type Abstraction and Subtype Polymorphism. Technical report, Purdue University, 1993. CSD-TR-03-059.
4. Kim Bruce and John C. Mitchell. PER models of subtyping, recursive types and higher-order polymorphism. In Conference Record of the Nineteenth Annual ACM Symposium on Principles of Programming Languages, pages 316-327, January 1992.
5. Peter Canning, William Cook, Walter Hill, and Walter Olthoff. F-Bounded Polymorphism for Object-Oriented Programming. In The Fourth International Conference on Functional Programming Languages and Computer Architecture, pages 273-280, September 1989.
6. Luca Cardelli. A Semantics of Multiple Inheritance. In D.B. MacQueen G. Kahn and G. Plotkin, editors, Semantics of Data Types, volume 173 of Lecture Notes in Computer Science, pages 51-67. Springer-Verlag, 1984.
7. Luca Cardelli and Peter Wegner. On Understanding Types, Data Abstraction, and Polymorphism. In Computing Surveys, volume 17, 1985.
8. Alain Colmerauer. Prolog and Infinite Trees. In K. L. Clark and S.-A. Tärnlund, editors, Logic Programming, number 16 in APIC Studies in Data Processing, pages 231-251. Academic Press, New York, 1982.
9. Alain Colmerauer. Equations and Inequations on Finite and Infinite Trees. In Proceedings of the International Conference of Fifth Generation Computer Systems, pages 85-99, Tokyo, 1984.
10. Bruno Courcelle. Fundamental Properties of Infinite Trees. In Theoretical Computer Science, volume 25, pages 95-169, March 1983.
11. Stefan Kaes. Type Inference in the Presence of Overloading, Subtyping and Recursive Types. In Proceedings of the 1992 ACM Conference on Lisp and Functional Programming, pages 193-204, 1992.
12. Dexter Kozen, Jens Palsberg, and Michael I. Schwartzbach. Efficient Recursive Subtyping. In Conference Record of the Twentieth Annual ACM Symposium on Principle of Programming Languages, 1993.
13. David MacQueen, Gordon Plotkin, and Ravi Sethi. An ideal Model for Recursive Polymorphic Types. In Information and Control, volume 71, pages 95-130, 1986.
14. John C. Mitchell. Coercion and Type Inference. In Conference Record of the Eleventh Annual A CM Symposium on Principles of Programming Languages, pages 175-185, 1984.
15. Nicholas Oxhøj, Jens Palsberg, and Michael I. Schwaxtzbach. Making Type Inference Practical. In ECOOP'92 European Conference on Object-Oriented Programruing, volume 615 of Lecture Notes in Computer Science, pages 329-349. Springer- Verlag, 1992.
16. Ryan Stansifer. Type Inference with Subtypes. In Conference Record of the Fifteenth Annual ACM Symposium on Principles of Programming Languages, pages 88-97, 1988.
17. Satish Thatte. Type Inference with Partial Types. In Proceedings of International Colloquium on Automata, Languages, and Programming, volume 317 of Lecture Notes in Computer Science, pages 615-629. Springer-Verlag, 1988.
18. Mitchell Wand. Complete Type Inference for Simple Objects. In Proceedings of Second Symposium on Logic in Computer Science, pages 37-44, 1987.