TY - GEN
T1 - Finite subtype inference with explicit polymorphism
AU - Duggan, Dominic
PY - 1998
Y1 - 1998
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84904987686&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84904987686&partnerID=8YFLogxK
U2 - 10.1007/3-540-49727-7_18
DO - 10.1007/3-540-49727-7_18
M3 - Conference contribution
AN - SCOPUS:84904987686
SN - 3540650148
SN - 9783540650140
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 295
EP - 310
BT - Static Analysis - 5th International Symposium, SAS 1998, Proceedings
T2 - 5th International Symposium on Static Analysis, SAS 1998
Y2 - 14 September 1998 through 16 September 1998
ER -