Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [26 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00880744
Contributor : Giuseppe Castagna <>
Submitted on : Wednesday, November 26, 2014 - 3:15:09 PM
Last modification on : Thursday, March 25, 2021 - 11:48:02 AM
Long-term archiving on: : Friday, February 27, 2015 - 12:30:12 PM

File

2main-popl.pdf
Files produced by the author(s)

Identifiers

Citation

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⟩

Share

Metrics

Record views

547

Files downloads

818