Positive Subtyping (1994)
Cached
Download Links
- [www.lfcs.inf.ed.ac.uk]
- [www.cs.indiana.edu]
- DBLP
Other Repositories/Bibliography
by
Martin Hofmann
,
Benjamin Pierce
| Venue: | Information and Computation |
| Citations: | 51 - 8 self |
BibTeX
@INPROCEEDINGS{Hofmann94positivesubtyping,
author = {Martin Hofmann and Benjamin Pierce},
title = {Positive Subtyping},
booktitle = {Information and Computation},
year = {1994},
pages = {235--282}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The statement S T in a -calculus with subtyping is traditionally interpreted as a semantic coercion function of type [[S]]![[T ]] that extracts the "T part" of an element of S. If the subtyping relation is restricted to covariant positions, this interpretation may be enriched to include both the coercion and an overwriting function put[S; T ] 2 [[S]]![[T ]]![[S]] that updates the T part of an element of S.
