A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
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