Type inference in the presence of overloading, subtyping and recursive types
- 1 January 1992
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. V (1) , 193-204
- https://doi.org/10.1145/141471.141540
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- A theory of type polymorphism in programmingPublished by Elsevier ,2003
- Safe run-time overloadingPublished by Association for Computing Machinery (ACM) ,1990
- Unification theoryJournal of Symbolic Computation, 1989
- Type checking records and variants in a natural extension of MLPublished by Association for Computing Machinery (ACM) ,1989
- How to make ad-hoc polymorphism less ad hocPublished by Association for Computing Machinery (ACM) ,1989
- Polymorphic subtype inference: Closing the theory-practice gapLecture Notes in Computer Science, 1989
- ESOP '88Published by Springer Nature ,1988
- Coercion and type inferencePublished by Association for Computing Machinery (ACM) ,1984
- Fundamental properties of infinite treesTheoretical Computer Science, 1983
- Principal type-schemes for functional programsPublished by Association for Computing Machinery (ACM) ,1982