Hindley-Milner Elaboration in Applicative Style

Abstract : Type inference—the problem of determining whether a program is well-typed—is well-understood. In contrast, elaboration—the task of constructing an explicitly-typed representation of the program— seems to have received relatively little attention, even though, in a non-local type inference system, it is non-trivial. We show that the constraint-based presentation of Hindley-Milner type inference can be extended to deal with elaboration, while preserving its elegance. This involves introducing a new notion of "constraint with a value", which forms an applicative functor.
Document type :
Conference papers
Complete list of metadatas

Cited literature [25 references]  Display  Hide  Download

https://hal.inria.fr/hal-01081233
Contributor : François Pottier <>
Submitted on : Friday, November 7, 2014 - 1:14:03 PM
Last modification on : Friday, May 25, 2018 - 12:02:07 PM
Long-term archiving on : Sunday, February 8, 2015 - 10:36:40 AM

File

fpottier-elaboration.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

François Pottier. Hindley-Milner Elaboration in Applicative Style. ICFP 2014: 19th ACM SIGPLAN International Conference on Functional Programming, Sep 2014, Goteborg, Sweden. ⟨10.1145/2628136.2628145⟩. ⟨hal-01081233⟩

Share

Metrics

Record views

304

Files downloads

712