Publication | Closed Access
Complete and decidable type inference for GADTs
104
Citations
11
References
2009
Year
Unknown Venue
Modular Type InferenceEngineeringGeneric ProgrammingAutomated ReasoningProgram AnalysisData InvariantsVerificationType TheoryFormal MethodsDependently Typed ProgrammingType InferenceComputer ScienceType SystemKnowledge CompilationDecidable Type InferenceFormal Verification
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.
| Year | Citations | |
|---|---|---|
Page 1
Page 1