Safe and decidable type checking in an object-oriented language

Kim B. Bruce, Jon Crabtree, Thomas P. Murtagh, Robert van Gent, Allyn Dimock, Robert Muller
1993 Proceedings of the eighth annual conference on Object-oriented programming systems, languages, and applications - OOPSLA '93  
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, Fr. Unfortunately, it has recently been shown by Pierce ([Pie92]) that type checking F< is undecidable. Moreover, he showed that the undecidability arises in t,he seemingly simpler problem of determining whether one type is a subtype of another.
doi:10.1145/165854.165865 dblp:conf/oopsla/BruceCMGDM93 fatcat:mcjokskqujcnbbctdhenij5nma