Extending hindley-milner type inference with coercive structural subtyping

Dmitriy Traytel, Stefan Berghofer, Tobias Nipkow

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

12 Scopus citations

Abstract

We investigate how to add coercive structural subtyping to a type system for simply-typed lambda calculus with Hindley-Milner polymorphism. Coercions allow to convert between different types, and their automatic insertion can greatly increase readability of terms. We present a type inference algorithm that, given a term without type information, computes a type assignment and determines at which positions in the term coercions have to be inserted to make it type-correct according to the standard Hindley-Milner system (without any subtypes). The algorithm is sound and, if the subtype relation on base types is a disjoint union of lattices, also complete. The algorithm has been implemented in the proof assistant Isabelle.

Original languageEnglish
Title of host publicationProgramming Languages and Systems - 9th Asian Symposium, APLAS 2011, Proceedings
Pages89-104
Number of pages16
DOIs
StatePublished - 2011
Event9th Asian Symposium on Programming Languages and Systems, APLAS 2011 - Kenting, Taiwan, Province of China
Duration: 5 Dec 20117 Dec 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7078 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference9th Asian Symposium on Programming Languages and Systems, APLAS 2011
Country/TerritoryTaiwan, Province of China
CityKenting
Period5/12/117/12/11

Fingerprint

Dive into the research topics of 'Extending hindley-milner type inference with coercive structural subtyping'. Together they form a unique fingerprint.

Cite this