Abstract

Bounded quantification allows quantified types to specify subtyping bounds for the type variables they introduce. It has undecidable subtyping and type checking. This paper shows that subclassing-bounded quantification—type variables have subclassing bounds—has decidable type checking. The main difficulty is that, type variables can have either upper bounds or lower bounds, which complicates the minimal type property.