2009 · 104 citations · 11 references
ComputingComputer ScienceAlgorithmsFormal MethodsProgramming LanguagesAbstract Syntax TreesData TypesData-flow AnalysisDeductive VerificationType CheckingType SystemsData Type InferenceDatatypes TheoryInvariantsPolymorphic Type SystemsProgram CorrectnessType Inference
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.
11
Simple unification-based type inference for GADTs
Simon Peyton Jones, Dimitrios Vytiniotis, Stephanie Weirich et al. · 2006 · 336 citations
System F with type equality coercions
Martin Sulzmann, Manuel M. T. Chakravarty, Simon Peyton Jones et al. · 2007 · 239 citations
Practical type inference for arbitrary-rank types
Simon Peyton Jones, Dimitrios Vytiniotis, Stephanie Weirich et al. · Journal of Functional Programming · 2006 · 213 citations · Full text
James Cheney, Ralf Hinze · eCommons (Cornell University) · 2003 · 180 citations · Full text
Jeffrey R. Lewis, John Launchbury, Erik Meijer et al. · 2000 · 154 citations · Full text