A core calculus for scala type checking

Authors:
Vincent Cremet;François Garillot;Sergueï Lenglet;Martin Odersky
Affiliations:
École Polytechnique Fédérale de Lausanne, INR Ecublens, Lausanne, Switzerland;École Normale Supérieure, Paris, France;École Normale Supérieure de Lyon, Lyon, France;École Polytechnique Fédérale de Lausanne, INR Ecublens, Lausanne, Switzerland
Venue:
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Year:
2006

Citing 16
Cited 8

The programming language jigsaw: mixins, modularity and multiple inheritance

The programming language jigsaw: mixins, modularity and multiple inheritance
A type-theoretic approach to higher-order modules with sharing

POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Bounded quantification is undecidable

Information and Computation
Local type inference

POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
What is a recursive module?

Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation
Featherweight Java: a minimal core calculus for Java and GJ

Proceedings of the 14th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Colored local type inference

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On inner classes

Information and Computation - FOOL VII
Mixin Modules in a Call-by-Value Setting

ESOP '02 Proceedings of the 11th European Symposium on Programming Languages and Systems
A Primitive Calculus for Module Systems

PPDP '99 Proceedings of the International Conference PPDP'99 on Principles and Practice of Declarative Programming
Family Polymorphism

ECOOP '01 Proceedings of the 15th European Conference on Object-Oriented Programming
Adding wildcards to the Java programming language

Proceedings of the 2004 ACM symposium on Applied computing
A calculus of module systems

Journal of Functional Programming
Scalable extensibility via nested inheritance

OOPSLA '04 Proceedings of the 19th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Scalable component abstractions

OOPSLA '05 Proceedings of the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
A virtual class calculus

Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Tribe: a simple virtual class calculus

Proceedings of the 6th international conference on Aspect-oriented software development
Variant path types for scalable extensibility

Proceedings of the 22nd annual ACM SIGPLAN conference on Object-oriented programming systems and applications
Dependent classes

Proceedings of the 22nd annual ACM SIGPLAN conference on Object-oriented programming systems and applications
EriLex: an embedded domain specific language generator

TOOLS'10 Proceedings of the 48th international conference on Objects, models, components, patterns
Search combinators

CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Matching objects with patterns

ECOOP'07 Proceedings of the 21st European conference on Object-Oriented Programming
Mixin’ Up the ML Module System

ACM Transactions on Programming Languages and Systems (TOPLAS)
Search combinators

Constraints

Quantified Score

Hi-index	0.01

Visualization

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.