Finite subtype inference with explicit polymorphism

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

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
Title of host publicationStatic Analysis - 5th International Symposium, SAS 1998, Proceedings
PublisherSpringer Verlag
Pages295-310
Number of pages16
ISBN (Print)3540650148, 9783540650140
DOIs
StatePublished - 1998
Event5th International Symposium on Static Analysis, SAS 1998 - Pisa, Italy
Duration: Sep 14 1998Sep 16 1998

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1503 LNCS

Conference

Conference5th International Symposium on Static Analysis, SAS 1998
Country/TerritoryItaly
CityPisa
Period9/14/989/16/98

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Cite this