Nullable Type Inference - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

Nullable Type Inference


We present type inference algorithms for nullable types in ML-like programming languages. Starting with a simple system, presented as an algorithm, whose only interest is to introduce the formalism that we use, we replace unification by subtyping constraints and obtain a more interesting system. We state the usual properties for both systems.
Fichier principal
Vignette du fichier
ocaml2014_14.pdf (153.66 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

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


  • HAL Id : hal-01413294 , version 1


Michel Mauny, Benoît Vaugon. Nullable Type Inference. OCaml 2014 - The OCaml Users and Developers Workshop, Sep 2014, Gothenbourg, Sweden. ⟨hal-01413294⟩
102 View
78 Download


Gmail Facebook X LinkedIn More