A Semantics for Static Type Inference (1993)
Cached
Download Links
- [www.dcs.ed.ac.uk]
- [www.dcs.ed.ac.uk]
- [homepages.inf.ed.ac.uk]
- [www.dcs.ed.ac.uk]
- DBLP
Other Repositories/Bibliography
by
Gordon Plotkin
| Venue: | Information and Computation |
| Citations: | 11 - 0 self |
BibTeX
@ARTICLE{Plotkin93asemantics,
author = {Gordon Plotkin},
title = {A Semantics for Static Type Inference},
journal = {Information and Computation},
year = {1993},
volume = {109},
pages = {256--299}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Curry's system for F-deducibility is the basis for static type inference algorithms for programming languages such as ML. If a natural "preservation of types by conversion" rule is added to Curry's system, it becomes undecidable, but complete relative to a variety of model classes. We show completeness for Curry's system itself, relative to an extended notion of model that validates reduction but not conversion.
