Finite subtype inference with explicit polymorphism

Research output: Contribution to journalArticlepeer-review

3 Scopus citations

Abstract

Finite subtype inference occupies a middle ground between Hindley-Milner-type inference (as in ML) and subtype inference with recursively constrained types. It refers to subtype inference where only finite types are allowed as solutions. This approach avoids some open problems with general subtype inference, and has practical motivation where recursively constrained types are not appropriate. This paper presents algorithms for finite subtype inference, including checking for entailment of inferred types against explicitly declared polymorphic types. This resolves for finite types a problem that is still open for recursively constrained types. Some motivation for this work, particularly for finite types and explicit polymorphism, is in providing subtype inference for first-class container objects with polymorphic methods.

Original languageEnglish
Pages (from-to)57-92
Number of pages36
JournalScience of Computer Programming
Volume39
Issue number1
DOIs
StatePublished - Jan 2001

Fingerprint

Dive into the research topics of 'Finite subtype inference with explicit polymorphism'. Together they form a unique fingerprint.

Cite this