A Core Calculus for Scala Type Checking
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.
- View record in Web of Science
Record created on 2006-11-21, modified on 2016-08-08