Skip to Main content Skip to Navigation
Conference papers

A Core Calculus for Scala Type Checking

Abstract : 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.
Complete list of metadatas

Cited literature [35 references]  Display  Hide  Download

https://hal.inria.fr/hal-00903812
Contributor : Sergueï Lenglet <>
Submitted on : Friday, November 15, 2013 - 4:58:10 PM
Last modification on : Monday, October 2, 2017 - 4:06:03 PM
Document(s) archivé(s) le : Sunday, February 16, 2014 - 4:28:54 AM

File

06-Cremet.pdf
Files produced by the author(s)

Identifiers

Citation

Vincent Cremet, François Garillot, Sergueï Lenglet, Martin Odersky. A Core Calculus for Scala Type Checking. Mathematical Foundations of Computer Science 2006, Aug 2006, Stará Lesná, Slovakia. pp.1-23, ⟨10.1007/11821069_1⟩. ⟨hal-00903812⟩

Share

Metrics

Record views

122

Files downloads

378