Simple unification-based type inference for GADTs Export

@inproceedings{citeulike:1156288, 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.}, address = {New York, NY, USA}, author = {Jones, Simon P. and Vytiniotis, Dimitrios and Weirich, Stephanie and Washburn, Geoffrey}, booktitle = {ICFP '06: Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming}, citeulike-article-id = {1156288}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1159811}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/1159803.1159811}, doi = {10.1145/1159803.1159811}, isbn = {1-59593-309-3}, keywords = {2006, gadt, haskell, type}, location = {Portland, Oregon, USA}, pages = {50--61}, posted-at = {2008-02-21 02:29:30}, priority = {2}, publisher = {ACM}, title = {Simple unification-based type inference for GADTs}, url = {http://dx.doi.org/10.1145/1159803.1159811}, year = {2006} }

TY - CONF ID - citeulike:1156288 L3 - citeulike-article-id:1156288 N2 - 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. CY - Portland, Oregon, USA SN - 1-59593-309-3 AD - New York, NY, USA EP - 61 TI - Simple unification-based type inference for GADTs PB - ACM T2 - ICFP '06: Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming SP - 50 KW - 2006 KW - gadt KW - haskell KW - type AU - Jones, Simon AU - Vytiniotis, Dimitrios AU - Weirich, Stephanie AU - Washburn, Geoffrey PY - 2006/// UR - http://dx.doi.org/10.1145/1159803.1159811 ER -