Autor: |
Královič, Rastislav, Urzyczyn, Paweł, Cremet, Vincent, Garillot, François, Lenglet, Sergueï, Odersky, Martin |
Zdroj: |
Mathematical Foundations of Computer Science 2006; 2006, p1-23, 23p |
Abstrakt: |
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. [ABSTRACT FROM AUTHOR] |
Databáze: |
Complementary Index |
Externí odkaz: |
|