Safe and decidable type checking in an object-oriented language (1993)
| Venue: | In OOPSLA '93 Conference Proceedings |
| Citations: | 33 - 2 self |
BibTeX
@INPROCEEDINGS{Bruce93safeand,
author = {Kim B. Bruce and Jon Crabtree and Thomas P. Murtagh and Robert Van Gent and Williamstown Ma and Allyn Dimock and Robert Muller},
title = {Safe and decidable type checking in an object-oriented language},
booktitle = {In OOPSLA '93 Conference Proceedings},
year = {1993},
pages = {29--46}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Over the last several years, much interesting work has been done in modelling object-oriented programming languages in terms of extensions of the bounded second-order lambda calculus, F . Unfortunately, it has recently been shown by Pierce ([Pie92]) that type checking F is undecidable. Moreover, he showed that the undecidability arises in the seemingly simpler problem of determining whether one type is a subtype of another. In [Bru93a, Bru93b], the first author introduced a statically-typed, functional, object-oriented programming language, TOOPL, which supports classes, objects, methods, instance variables, subtypes, and inheritance. The semantics of TOOPL is based on F , so the question arises whether type checking in this language is decidable. In this paper we show that type checking for TOOPLE, a minor variant of TOOPL (Typed Object-Oriented Programming Language), is decidable. The proof proceeds by showing that subtyping is decidable, that all terms of TOOPLE have minimum types...
