Type Inference for Recursively Constrained Types and its Application to OOP (1995)
| Citations: | 76 - 14 self |
BibTeX
@MISC{Eifrig95typeinference,
author = {Jonathan Eifrig and Scott Smith and Valery Trifonov},
title = {Type Inference for Recursively Constrained Types and its Application to OOP},
year = {1995}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper addresses the problem of designing an object-oriented programming language with an effective type inference mechanism. Recently developed programming languages including Standard ML and Haskell incorporate type inference as a core component of the language. However, type inference has yet to achieve practical application to object-oriented programming languages. We strongly feel the core type features necessary to model object-oriented programming with type inference include a notion of subtyping [CW85], and a notion of "recursively constrained polymorphism," a generalization of F-bounded polymorphism [CHC90, CCH
