Simple unification-based type inference for GADTs (2006)
Cached
Download Links
- [eecs.harvard.edu]
- [research.microsoft.com]
- [research.microsoft.com]
- [www.research.microsoft.com]
- [research.microsoft.com]
- DBLP
Other Repositories/Bibliography
| Citations: | 129 - 26 self |
BibTeX
@INPROCEEDINGS{Jones06simpleunification-based,
author = {Simon Peyton Jones},
title = {Simple unification-based type inference for GADTs},
booktitle = {},
year = {2006},
pages = {50--61},
publisher = {ACM Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Generalized algebraic data types (GADTs), sometimes known as “guarded recursive data types ” or “first-class phantom types”, are a simple but powerful generalization of the data types of Haskell and ML. Recent works have given compelling examples of the utility of GADTs, although type inference is known to be difficult. Our contribution is to show how to exploit programmer-supplied type annotations to make the type inference task almost embarrassingly easy. Our main technical innovation is wobbly types, which express in a declarative way the uncertainty caused by the incremental nature of typical type-inference algorithms.
