Stratified type inference for generalized algebraic data types

We offer a solution to the type inference problem for an extension of Hindley and Milner's type system with generalized algebraic data types. Our approach is in two strata. The bottom stratum is a core language that marries type inference in the style of Hindley and Milner with type checking for generalized algebraic data types. This results in an extremely simple specification, where case constructs must carry an explicit type annotation and type conversions must be made explicit. The top stratum consists of (two variants of) an independent shape inference algorithm. This algorithm accepts a source term that contains some explicit type information, propagates this information in a local, predictable way, and produces a new source term that carries more explicit type information. It can be viewed as a preprocessor that helps produce some of the type annotations required by the bottom stratum. It is proven sound in the sense that it never inserts annotations that could contradict ...

• Type: Conference
• Year: 2006
• Where: POPL
• Authors: François Pottier, Yann Régis-Gianas
• Keywords: Algebraic Data Types, Explicit Type Information, Generalized Algebraic Data, POPL 2006, Programming Languages