Concept

Substructural type system

Related publications (62)

Concurrency Combinators for Declarative Synchronization

Developing computer systems that are both concurrent and evolving is challenging. To guarantee consistent access to resources by concurrent software components, some synchronization is required. A synchronization logic, or policy, is at present entangled i ...

Springer2004

Isolation-only Transactions by Typing and Versioning

In this paper we design a language and runtime support for isolation-only, multithreaded transactions (called tasks) that are intended for time-critical systems. The key concept of our design is the use of a type system to support rollback-free and safe ru ...

2004

PiLib: A Hosted Language for Pi-Calculus Style Concurrency

Martin Odersky, Vincent Cremet

PiLib is a library written in Scala that implements the concurrency constructs of the Pi-calculus. Some features of the programming language Scala, examined in the paper, make it possible to use almost the same syntax as in the Pi-calculus. The advantages ...

2003

A Nominal Theory of Objects with Dependent Types

Martin Odersky, Vincent Cremet, Matthias Zenger

We design and study newObj, a calculus and dependent type system forobjects and classes which can have types as members. Type members canbe aliases, abstract types, or new types. The type system can modelthe essential concepts of Java's inner classes as we ...

2002

Type-Safe Prototype-Based Component Evolution

Matthias Zenger

Component-based programming is currently carried out using mainstream object-oriented languages. These languages have to be used in a highly disciplined way to guarantee flexible component composition and extensibility. This paper investigates abstractions ...

2002

Type-Safe Prototype-Based Component Evolution

Matthias Zenger

Component-based programming is currently carried out us- ing mainstream object-oriented languages. These languages have to be used in a highly disciplined way to guarantee flexible component composition and extensibility. This paper investigates abstractio ...

Springer Berlin Heidelberg2002

A Nominal Theory of Objects with Dependent Types

Martin Odersky, Vincent Cremet, Matthias Zenger

We design and study newObj, a calculus and dependent type system for objects and classes which can have types as members. Type members can be aliases, abstract types, or new types. The type system can model the essential concepts of Java's inner classes as ...

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

Type Inference with Constrained Types

Martin Odersky

In this paper we present a general framework HM(X) for Hindley/Milner style type systems with constraints, analogous to the CLP(X) framework in constrained logic programming. We show that the type system is sound with respect to a standard untyped composit ...

1999

A Functional View of Join

Martin Odersky, Matthias Zenger

Join calculus, usually presented as a process calculus, is suitable as a foundation of both sequential and concurrent programming. We give a new operational semantics of join calculus, expressed as a reduction system with a single reduction rule similar to ...

1999

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.