Type inference in the presence of overloading, subtyping and recursive types
- 1 January 1992
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Lisp Pointers
- Vol. V (1) , 193-204
- https://doi.org/10.1145/141478.141540
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- A theory of type polymorphism in programmingPublished by Elsevier ,2003
- Subtyping recursive typesPublished by Association for Computing Machinery (ACM) ,1991
- Polymorphic subtype inference: Closing the theory-practice gapLecture Notes in Computer Science, 1989
- Sample — A functional languageLecture Notes in Computer Science, 1988
- ML with extended pattern matching and subtypesPublished by Association for Computing Machinery (ACM) ,1988
- Type inference in a database programming languagePublished by Association for Computing Machinery (ACM) ,1988
- 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