Dependent Classes Vaidas Gasiunas and Mira Mezini Technische Universit¨at Darmstadt, Germany Abstract. Dependent classes are parameterized classes, the interface and implementation of which depend on the types of their parameters. The most interestications of dependent classes involve abstract classes and methods. Type of abstract declarations for dependent classes is challenging, because it requires completeness and uniqueness checks for methods dispatched by dependent types. We demonstrate that precise completeness checking is undecidable, and therefore propose an algorithm that conservatively approximates the required checks. The algorithm requires a generalization of the initially proposed semantic definitions of the dependent classes in order to support type intersections. The new semantics of dependent classes is based on a constraint system, which also provides a novel view on the semantics of dependent classes and related type systems.