A Core Calculus for Scala Type Checking

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.

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Cremet, Vincent, Garillot, François, Lenglet, Sergueï, Odersky, Martin
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Abstract Type
Applied sciences
Computer Science
Computer science
control theory
systems
Exact sciences and technology
Programming Languages
Recursive Call
Theoretical computing
Type Assignment
Type Check
Type Signature
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0302-9743
1611-3349
DOI:10.1007/11821069_1