Type inference with constrained types (1997)
Cached
Download Links
- [www.cs.yale.edu]
- [eprints.kfupm.edu.sa]
- [lampwww.epfl.ch]
- [ftp.ira.uka.de]
- [diwww.epfl.ch]
- [ftp.cs.yale.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | Fourth International Workshop on Foundations of Object-Oriented Programming (FOOL) |
| Citations: | 42 - 5 self |
BibTeX
@INPROCEEDINGS{Odersky97typeinference,
author = {Martin Odersky and Martin Sulzmann and Martin Wehr},
title = {Type inference with constrained types},
booktitle = {Fourth International Workshop on Foundations of Object-Oriented Programming (FOOL)},
year = {1997},
publisher = {}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present a general framework HM(X) for type systems with constraints. The framework stays in the tradition of the Hindley/Milner type system. Its type system instances are sound under a standard untyped compositional semantics. We can give a generic type inference algorithm for HM(X) so that, under sufficient conditions on X, type inference will always compute the principal type of a term. We discuss instances of the framework that deal with polymorphic records, equational theories and subtypes.
