Work

Sound polymorphic type inference for objects

Year: 1995

Type: conference-paper

Abstract: A polymorphic, constraint-based type inference algorithm for an object-oriented language is defined. A generalized form of type, polymorphic recursively constrained types, are inferred. These types are expressive enough for typing objects, since they generalize recursive types and F-bounded polymorphism. The well-known tradeoff between inheritance and subtyping is mitigated by the type inference mechanism. Soundness and completeness of type inference are established.

Source: Conference on Object-Oriented Programming Systems, Languages, and Applications

DOI: 10.1145/217838.217858

Authors: Jonathan Eifrig, Scott Smith, Valery Trifonov

Institution: Johns Hopkins University

Language: English

Topic: Logic, programming, and type systems

Subfield: Software

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

OpenAlex ID: W2055292912

FWCI: 9.024

Cites: 32

Cited by: 107

Related to: 10