Cremet, VincentGarillot, FrançoisLenglet, SergueïOdersky, Martin2006-11-212006-11-212006-11-21200610.1007/11821069_1https://infoscience.epfl.ch/handle/20.500.14299/235800WOS:0002402717000019338We present a minimal core calculus that captures interesting constructs of the Scala programming language: nested classes, abstract types, mixin composition, and path dependent types. We show that the problems of type assignment and subtyping in this calculus are decidable.text::conference output::conference proceedings::conference paper