Nullable Type Inference

Abstract : 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.
Document type :
Conference papers
Liste complète des métadonnées

https://hal.inria.fr/hal-01413294
Contributor : Michel Mauny <>
Submitted on : Friday, December 9, 2016 - 3:54:13 PM
Last modification on : Wednesday, September 12, 2018 - 10:39:40 AM

File

ocaml2014_14.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01413294, version 1

Collections

Citation

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

Share

Metrics

Record views

177

Files downloads

63