Sound polymorphic type inference for objects

  • Authors:
  • Jonathan Eifrig;Scott Smith;Valery Trifonov

  • Affiliations:
  • Department of computer science, The John Hopkins University;Department of computer science, The John Hopkins University;Department of computer science, The John Hopkins University

  • Venue:
  • Proceedings of the tenth annual conference on Object-oriented programming systems, languages, and applications
  • Year:
  • 1995

Quantified Score

Hi-index 0.00

Visualization

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.