Type Inference for Recursively Constrained Types and its Application to OOP
Open Access
- 1 January 1995
- journal article
- Published by Elsevier in Electronic Notes in Theoretical Computer Science
- Vol. 1 (1) , 132-153
- https://doi.org/10.1016/s1571-0661(04)80008-2
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- A theory of type polymorphism in programmingPublished by Elsevier ,2003
- An interpretation of typed OOP in a language with stateHigher-Order and Symbolic Computation, 1995
- Precise concrete type inference for object-oriented languagesACM SIGPLAN Notices, 1994
- A complete type inference system for subtyped recursive typesPublished by Springer Nature ,1994
- Programming objects with ML-ART an extension to ML with abstract and record typesPublished by Springer Nature ,1994
- Safety analysis versus type inference for partial typesInformation Processing Letters, 1992
- Type inference in the presence of overloading, subtyping and recursive typesACM SIGPLAN Lisp Pointers, 1992
- Type inference for polymorphic referencesInformation and Computation, 1990
- An ideal model for recursive polymorphic typesInformation and Control, 1986
- On understanding types, data abstraction, and polymorphismACM Computing Surveys, 1985