Publication

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

Related publications (54)

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 typed intermediate language and algorithms for compiling scala by successive rewritings

Philippe Altherr

Scala is a general-purpose programming language developed at EPFL. It combines concepts coming from object-oriented languages with other ones coming from functional languages. Scala is strongly typed and comes with a relatively complex type system, which i ...

EPFL2006

Foundations for SCALA

Vincent Cremet

SCALA is an attractive programming language because it is both very expressive and statically strongly typed. This marriage against nature comes at the price of a certain complexity in the language constructs and the static analysis. This complexity makes ...

EPFL2006

Variance and Generalized Constraints for C# Generics

Burak Emir

Generic types in C# behave invariantly with respect to subtyping. We propose a system of type-safe variance for C# that supports the declaration of covariant and contravariant type parameters on generic types. To support more widespread application of vari ...

2006

A Core Calculus for Scala Type Checking

Martin Odersky, Vincent Cremet

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 calcu ...

2006

Anti-Deprecation: Towards Complete Static Checking for API Evolution (Extended Version)

API evolution is the process of migrating an inter-library interface from one version to another. Such a migration requires checking that all libraries which interact through the interface be updated. Libraries can be updated one by one if there is a trans ...

2006

"May You Have a Strong (-Typed) Foundation", Why Strong-Typed Programming Languages Do Matter

Roland Siegwart, Nicola Tomatis

Programming efficient and reliable code can be considered a non-trivial task, as it requires deep understanding of the problem to be solved along with good programming skills. However, software frameworks and programming paradigms can provide a dependable ...

2004

Flexibler Subtyping Relations for Component-Oriented Formalisms

In the first part of this paper we present a new general component-oriented formalism, which has, among others, the following features: Concurrency, atomicity, synchronization between and inside components, and modularity. We give the inference rules which ...

2002

Flexible Subtyping Relations for Component-Oriented Formalisms

2002

Colored Local Type Inference (colored version) (black and white version)

Martin Odersky, Matthias Zenger

We present a type system for a language based on F-sub, which allows certain type annotations to be elided in actual programs. Local type inference determines types by a combination of type propagation and local constraint solving, rather than by global co ...

2001

Linguistic Support for Large-Scale Distributed Programming

Rachid Guerraoui, Patrick Eugster, Christian Heide Damm

We present three operators for the expression of event-based large-scale distributed programming. In short, these operators support a publish/subscribe-based interaction scheme, leading to a distributed object programming model merging the benefits of obje ...

2001