Complete and decidable type inference for GADTs

DOI10.1145/1596550.1596599zbMath1302.68190OpenAlexW2154390633MaRDI QIDQ2936831

Martin Sulzmann, Tom Schrijvers, Dimitrios Vytiniotis, Simon L. Peyton Jones

Publication date: 6 January 2015

Published in: Proceedings of the 14th ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1596550.1596599

zbMATH Keywords

Haskelltype inferenceGADTs

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Abstract data types; algebraic specification (68Q65)

Related Items (7)

Ambivalent Types for Principal Type Inference with GADTs ⋮ Hierarchy in Generic Programming Libraries ⋮ Trends in trends in functional programming 1999/2000 versus 2007/2008 ⋮ Safe typing of functional logic programs with opaque patterns and local bindings ⋮ The essence of ornaments ⋮ A lean specification for gadts: System F with first-class equality proofs ⋮ Formal polytypic programs and proofs

This page was built for publication: Complete and decidable type inference for GADTs