Application of OOP type theory: state, decidability, integration

  • Authors:

  • Jonathan Eifrig;Scott Smith;Valery Trifonov;Amy Zwarico

  • Affiliations:

  • Department of Computer Science, The Johns Hopkins University;Department of Computer Science, The Johns Hopkins University;Department of Computer Science, The Johns Hopkins University;Department of Computer Science, The Johns Hopkins University

  • Venue:
  • OOPSLA '94 Proceedings of the ninth annual conference on Object-oriented programming systems, language, and applications
  • Year:
  • 1994

Quantified Score

Hi-index 0.00

Visualization

Abstract

Important strides toward developing expressive yet semantically sound type systems for object-oriented programming languages have recently been made by Cook, Bruce, Mitchell, and others. This paper focusses on how the theoretical work using F-bounded quantification may be brought more into the realm of actual language implementations while preserving rigorous soundness properties. We simultaneously address three of the more significant problems: adding a notion of global state, proving type-checking is decidable, and integrating the more widely implemented view that subclasses correspond to subtypes with the F-bounded view.