Publication

A Core Calculus for Scala Type Checking

Martin Odersky, Vincent Cremet
2006
Conference paper

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.

Official source

https://infoscience.epfl.ch/record/95716?ln=en

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

A Core Calculus for Scala Type Checking

Graph Chatbot

Chat with Graph Search

When Subtyping Constraints Liberate A Novel Type Inference Approach for First-Class Polymorphism

Type-Preserving Compilation of Class-Based Languages

A case for DOT: Theoretical Foundations for Objects with Pattern Matching and GADT-Style Reasoning

Type-Preserving Compilation of Class-Based Languages

A case for DOT: Theoretical Foundations for Objects with Pattern Matching and GADT-Style Reasoning

When Subtyping Constraints Liberate A Novel Type Inference Approach for First-Class Polymorphism