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.
CITATION STYLE
Wagner, F. (2007). Mathematical Foundations of Computer Science 2007. (L. Kučera & A. Kučera, Eds.) (Vol. 4708, pp. 572–583). Berlin, Heidelberg: Springer Berlin Heidelberg. Retrieved from http://www.springerlink.com/index/10.1007/978-3-540-74456-6
Mendeley helps you to discover research relevant for your work.