research-article

Complete and decidable type inference for GADTs

Authors:

Tom Schrijvers,

Simon Peyton Jones,

Martin Sulzmann,

Dimitrios VytiniotisAuthors Info & Claims

ICFP '09: Proceedings of the 14th ACM SIGPLAN international conference on Functional programming

Pages 341 - 352

https://doi.org/10.1145/1596550.1596599

Published: 31 August 2009 Publication History

Get Access

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.

Supplementary Material

JPG File (completeanddecidabletypeinferenceforgadtsonvimeo.jpg)

Download
12.46 KB

MP4 File (completeanddecidabletypeinferenceforgadtsonvimeo.mp4)

Download
93.94 MB

References

[1]

J. Cheney and R. Hinze. First-class phantom types. TR 1901, Cornell University, 2003.

Google Scholar

[2]

A. Degtyarev and A. Voronkov. Simultaneous regid E-unification is undecidable. In Proc. of CSL'95, volume 1092 of LNCS, pages 178--190. Springer, 1995.

Digital Library

Google Scholar

[3]

J. H. Gallier, P. Narendran, S. Raatz, and W. Snyder. Theorem proving using equational matings and rigid e-unification. J. ACM, 39(2):377--429, 1992.

Digital Library

Google Scholar

[4]

J. R. Lewis, J. Launchbury, E. Meijer, and M. Shields. Implicit parameters: Dynamic scoping with static types. In POPL, pages 108--118, 2000.

Digital Library

Google Scholar

[5]

M. Maher. Herbrand constraint abduction. In Proc. of LICS'05, pages 397--406. IEEE Comp. Soc., 2005.

Digital Library

Google Scholar

[6]

F. Pottier and D. Rémy. The essence of ML type inference. In Benjamin C. Pierce, editor, Advanced Topics in Types and Programming Languages, chapter 10, pages 389--489. MIT Press, 2005.

Google Scholar

[7]

F. Pottier and Y. Régis-Gianas. Stratified type inference for generalized algebraic data types. In Proc. of POPL'06, pages 232--244. ACM, 2006.

Digital Library

Google Scholar

[8]

S. Peyton Jones, D. Vytiniotis, S. Weirich, and M. Shields. Practical type inference for arbitrary-rank types. J. of Func. Prog., 17:1--82, January 2007.

Digital Library

Google Scholar

[9]

S. Peyton Jones, D. Vytiniotis, S. Weirich, and G. Washburn. Simple unification-based type inference for GADTs. In Proc. of ICFP'06, pages 50--61. ACM, 2006.

Digital Library

Google Scholar

[10]

M. Sulzmann, M. Chakravarty, S. Peyton Jones, and K. Donnelly. System F with type equality coercions. In Proc. of TLDI'07. ACM, 2007.

Digital Library

Google Scholar

[11]

T. Schrijvers, S. Peyton Jones, M. Chakravarty, and M. Sulzmann. Type checking with open type functions. SIGPLAN Not., 43(9):51--62, 2008.

Digital Library

Google Scholar

[12]

V. Simonet and F. Pottier. A constraint-based approach to guarded algebraic data types. ACM Trans. Prog. Languages Systems, 29(1), January 2007.

Digital Library

Google Scholar

[13]

M. Sulzmann, T. Schrijvers, and P. J. Stuckey. Principal type inference for GHC-style multi-parameter type classes. In Proc. of APLAS'06, volume 4279 of LNCS, pages 26--43. Springer, 2006.

Digital Library

Google Scholar

[14]

M. Sulzmann, T. Schrijvers, and P. Stuckey. Type inference for GADTs via Herbrand constraint abduction. Report CW 507, K.U.Leuven, Belgium, 2008.

Google Scholar

Cited By

View all

Cagne PGhiorzi EJohann P(2024)GADTs are not (Even partial) functorsMathematical Structures in Computer Science10.1017/S0960129524000161(1-24)Online publication date: 27-Aug-2024
https://doi.org/10.1017/S0960129524000161
Ingle AHubers AMorris JPolikarpova N(2022)Partial type constructors in practiceProceedings of the 15th ACM SIGPLAN International Haskell Symposium10.1145/3546189.3549923(95-107)Online publication date: 6-Sep-2022
https://dl.acm.org/doi/10.1145/3546189.3549923
Koopman PMichels SPlasmeijer R(2021)Dynamic Editors for Well-Typed ExpressionsTrends in Functional Programming10.1007/978-3-030-83978-9_3(44-66)Online publication date: 23-Aug-2021
https://doi.org/10.1007/978-3-030-83978-9_3
Show More Cited By

Index Terms

Complete and decidable type inference for GADTs
1. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language types
        Functional languages
2. Theory of computation
  1. Semantics and reasoning
    1. Program constructs
      1. Type structures

Recommendations

Simple unification-based type inference for GADTs
ICFP '06: Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming

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 ...
Complete and decidable type inference for GADTs
ICFP '09

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 ...
Ghostbuster: a tool for simplifying and converting GADTs
ICFP 2016: Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming

Generalized Algebraic Dataypes, or simply GADTs, can encode non-trivial properties in the types of the constructors. Once such properties are encoded in a datatype, however, all code manipulating that datatype must provide proof that it maintains these ...

Comments

Information & Contributors

Information

Published In

ICFP '09: Proceedings of the 14th ACM SIGPLAN international conference on Functional programming

August 2009

364 pages

ISBN:9781605583327

DOI:10.1145/1596550

General Chair:
Graham Hutton
University of Nottingham
,
Program Chair:
Andrew Tolmach
Portland State University

ACM SIGPLAN Notices Volume 44, Issue 9
ICFP '09
September 2009
343 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/1631687
Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 31 August 2009

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

ICFP '09

Sponsor:

ICFP '09: ACM SIGPLAN International Conference on Functional Programming

August 31 - September 2, 2009

Edinburgh, Scotland

Acceptance Rates

Overall Acceptance Rate 333 of 1,064 submissions, 31%

Upcoming Conference

ICFP '25

Sponsor:
sigplan

ACM SIGPLAN International Conference on Functional Programming

October 12 - 18, 2025

Singapore , Singapore

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

85
Total Citations
View Citations
548
Total Downloads

Downloads (Last 12 months)16
Downloads (Last 6 weeks)4

Reflects downloads up to 13 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Cagne PGhiorzi EJohann P(2024)GADTs are not (Even partial) functorsMathematical Structures in Computer Science10.1017/S0960129524000161(1-24)Online publication date: 27-Aug-2024
https://doi.org/10.1017/S0960129524000161
Ingle AHubers AMorris JPolikarpova N(2022)Partial type constructors in practiceProceedings of the 15th ACM SIGPLAN International Haskell Symposium10.1145/3546189.3549923(95-107)Online publication date: 6-Sep-2022
https://dl.acm.org/doi/10.1145/3546189.3549923
Koopman PMichels SPlasmeijer R(2021)Dynamic Editors for Well-Typed ExpressionsTrends in Functional Programming10.1007/978-3-030-83978-9_3(44-66)Online publication date: 23-Aug-2021
https://doi.org/10.1007/978-3-030-83978-9_3
Xie NEisenberg ROliveira B(2019)Kind inference for datatypesProceedings of the ACM on Programming Languages10.1145/33711214:POPL(1-28)Online publication date: 20-Dec-2019
https://dl.acm.org/doi/10.1145/3371121
Jones MMorris JEisenberg R(2019)Partial type constructors: or, making ad hoc datatypes less ad hocProceedings of the ACM on Programming Languages10.1145/33711084:POPL(1-28)Online publication date: 20-Dec-2019
https://dl.acm.org/doi/10.1145/3371108
Osera PDarais DGibbons J(2019)Constraint-based type-directed program synthesisProceedings of the 4th ACM SIGPLAN International Workshop on Type-Driven Development10.1145/3331554.3342608(64-76)Online publication date: 18-Aug-2019
https://dl.acm.org/doi/10.1145/3331554.3342608
Eisenberg RBreitner JPeyton Jones S(2018)Type variables in patternsACM SIGPLAN Notices10.1145/3299711.324275353:7(94-105)Online publication date: 17-Sep-2018
https://dl.acm.org/doi/10.1145/3299711.3242753
Eisenberg RBreitner JPeyton Jones SWu N(2018)Type variables in patternsProceedings of the 11th ACM SIGPLAN International Symposium on Haskell10.1145/3242744.3242753(94-105)Online publication date: 17-Sep-2018
https://dl.acm.org/doi/10.1145/3242744.3242753
ZAKIAN TMCDONELL TCIMINI MNEWTON R(2018)Ghostbuster: A tool for simplifying and converting GADTsJournal of Functional Programming10.1017/S095679681800011428Online publication date: 22-Jun-2018
https://doi.org/10.1017/S0956796818000114
Ostermann KJabs J(2018)Dualizing Generalized Algebraic Data Types by Matrix TranspositionProgramming Languages and Systems10.1007/978-3-319-89884-1_3(60-85)Online publication date: 14-Apr-2018
https://doi.org/10.1007/978-3-319-89884-1_3
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Simple unification-based type inference for GADTs

Complete and decidable type inference for GADTs

Ghostbuster: a tool for simplifying and converting GADTs