Title: Complete and decidable type inference for GADTs
Other Titles: Volledige en beslisbare type-inferentie voor GADTs
Authors: Schrijvers, Tom ×
Peyton Jones, Simon
Sulzmann, Martin
Vytiniotis, Dimitrios #
Issue Date: Aug-2009
Publisher: ACM Press
Series Title: ACM Sigplan Notices vol:44 issue:8-9 pages:341-352
Conference: International Conference on Functional Programming edition:14 location:Edinburgh, UK date:31 August - 2 September 2009
Abstract: GADTs have proven to be an invaluable language extension, for ensuring
data invariants and program correctness among others. 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.
ISSN: 0362-1340
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Informatics Section
× corresponding author
# (joint) last author

Files in This Item:
File Description Status SizeFormat
icfp0073-schrijvers.pdfmain article Published 250KbAdobe PDFView/Open


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science