We 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.
Title
A Core Calculus for Scala Type Checking
Published in
Mathematical Foundations of Computer Science 2006. MFCS 2006
Series
Lecture Notes in Computer Science, 4162
Pages
1-23
Conference
Mathematical Foundations of Computer Science, Stará Lesná, Slovak Republic, 28 August - 1 September 2006
Date
2006
Record creation date
2006-11-21