Coercive subtyping is a theory of abbreviation for dependent type theories. In this paper, we incorporate the idea of coercive subtyping into the traditional Hindley-Milner type systems in functional programming languages. This results in a typing system with coercions, an extension of the Hindley-Milner type system. A type inference algorithm is developed and shown to be sound and complete with respect to the typing system. A notion of derivational coherence is developed to deal with the problem of ambiguity and the corresponding type inference algorithm is shown to be sound and complete. © Springer-Verlag 2004.
CITATION STYLE
Kießling, R., & Luo, Z. (2004). Coercions in Hindley-Milner Systems. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3085, 259–275. https://doi.org/10.1007/978-3-540-24849-1_17
Mendeley helps you to discover research relevant for your work.