On subtyping and matching (1995)
Cached
Download Links
- [lucacardelli.name]
- [research.microsoft.com]
- [research.microsoft.com]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proceedings ECOOP '95 |
| Citations: | 45 - 3 self |
BibTeX
@INPROCEEDINGS{Cardelli95onsubtyping,
author = {Luca Cardelli},
title = {On subtyping and matching},
booktitle = {In Proceedings ECOOP '95},
year = {1995},
pages = {145--167},
publisher = {Springer-Verlag}
}
Years of Citing Articles
OpenURL
Abstract
Abstract. A relation between recursive object types, called matching, has been proposed as a generalization of subtyping. Unlike subtyping, matching does not support subsumption, but it does support inheritance of binary methods. We argue that matching is a good idea, but that it should not be regarded as a form of F-bounded subtyping (as was originally intended). We show that a new interpretation of matching as higher-order subtyping has better properties. Matching turns out to be a third-order construction, possibly the only one to have been proposed for general use in programming.







