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.


Published in:
Proceedings of MFCS 2006
Presented at:
Mathematical Foundations of Computer Science, Stará Lesná, Slovak Republic, 28 August - 1 September 2006
Year:
2006
Other identifiers:
Laboratories:




 Record created 2006-11-21, last modified 2018-03-17

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)