Polymorphic Functions with Set-Theoretic Types. Part 2: Local Type Inference and Type Reconstruction - Archive ouverte HAL Access content directly
Conference Papers Year : 2015

Polymorphic Functions with Set-Theoretic Types. Part 2: Local Type Inference and Type Reconstruction

Abstract

This article is the second part of a two articles series about a calculus with higher-order polymorphic functions, recursive types with arrow and product type constructors and set-theoretic type connectives (union, intersection, and negation). In the first part, presented in a companion paper, we defined and studied the syntax, semantics, and evaluation of the explicitly-typed version of the calculus, in which type instantiation is driven by explicit instantiation annotations. In this second part we present a local type inference system that allows the programmer to omit explicit instantiation annotations, and a type reconstruction system that allows the programmer to omit explicit type annotations. The work presented in the two articles provides the theoretical foundations and technical machinery needed to design and implement higher-order polymorphic functional languages for semi-structured data.
Fichier principal
Vignette du fichier
2main-popl.pdf (848.61 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00880744 , version 1 (06-11-2013)
hal-00880744 , version 2 (16-11-2013)
hal-00880744 , version 3 (15-01-2014)
hal-00880744 , version 4 (26-11-2014)

Identifiers

Cite

Giuseppe Castagna, Kim Nguyen, Zhiwu Xu, Pietro Abate. Polymorphic Functions with Set-Theoretic Types. Part 2: Local Type Inference and Type Reconstruction. POPL '15 Proceedings of the 42nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Jan 2015, Mumbai, India. ⟨10.1145/2676726.2676991⟩. ⟨hal-00880744v4⟩
385 View
415 Download

Altmetric

Share

Gmail Facebook X LinkedIn More