Skip to Main content Skip to Navigation
Conference papers

A Type Inference System Based on Saturation of Subtyping Constraints

Abstract : This paper presents a powerful and flexible technique for defining type inference algorithms, on an ML-like language, that involve subtyping and whose soundness can be proved. We define a typing algorithm as a set of inference rules of three distinct forms: typing rules collect subtyping constraints to be satisfied, instantiation rules instantiate type schemes, and saturation rules specify how to check the validity and consistency of collected constraints. Essentially, type inference then proceeds in two intertwined phases: one that extracts constraints and the other that saturates the sets of constraints. Our technique extends easily to the treatment of high-level features such as polymorphism, overloading, variants and pattern-matching, or generalized algebraic data types (GADTs).
Document type :
Conference papers
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download
Contributor : Michel Mauny Connect in order to contact the contributor
Submitted on : Friday, December 9, 2016 - 11:40:20 AM
Last modification on : Friday, January 21, 2022 - 3:17:42 AM
Long-term archiving on: : Thursday, March 23, 2017 - 9:43:28 AM


Files produced by the author(s)


  • HAL Id : hal-01413043, version 1



Benoît Vaugon, Michel Mauny. A Type Inference System Based on Saturation of Subtyping Constraints. Trends in Functional Programming, Jun 2016, College Park (MD), United States. ⟨hal-01413043⟩



Les métriques sont temporairement indisponibles