Share on Facebook Tweet on Twitter Share on LinkedIn Share by email
Complete and Decidable Type Inference for GADTs

Tom Schrijvers, Simon Peyton Jones, Martin Sulzmann, and Dimitrios Vytiniotis


GADTs have proven to be an invaluable language extension, a.o. for ensuring data invariants and program correctness. Unfortunately, they pose a tough problem for type inference: we lose the principal-type property, which is necessary for modular type inference.

We present a novel and simplified type inference approach for local type assumptions from GADT pattern matches. Our approach is complete and decidable, while more liberal than previous such approaches.


Publication typeInproceedings
Published inProceedings of the 14th ACM SIGPLAN International Conference on Functional Programming
PublisherAssociation for Computing Machinery, Inc.
> Publications > Complete and Decidable Type Inference for GADTs