A Type Inference System Based on Saturation of Subtyping Constraints - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2016

A Type Inference System Based on Saturation of Subtyping Constraints

Un système d'inférence de types fondé sur la saturation des contraintes de sous-typage

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).
Fichier principal
Vignette du fichier
article.pdf (173.59 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01413043 , version 1 (09-12-2016)

Identifiers

  • HAL Id : hal-01413043 , version 1

Cite

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⟩
140 View
229 Download

Share

Gmail Mastodon Facebook X LinkedIn More