Publication

Programming language abstractions for extensible software components

Related publications (124)

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.

Opis: Reliable Distributed Systems in OCaml

Viktor Kuncak, Dejan Kostic, Pierre-Evariste Dagand

Concurrency and distribution pose algorithmic and implementation challenges in developing reliable distributed systems, making the field an excellent testbed for evaluating programming language and verification paradigms. Several specialized domain-specifi ...

2009

Capabilities for Uniqueness and Borrowing

Martin Odersky, Philipp Haller

An important application of unique object references is safe and efficient message passing in concurrent object-oriented programming. However, to prevent the ill effects of aliasing, practical systems often severely restrict the shape of messages passed by ...

2009

ProtoPeer: Distributed Systems Prototyping Toolkit

Karl Aberer, Wojciech Galuba, Zoran Despotovic

Simulators are an excellent tool for quick systems prototyping and large-scale parameter sweeps, but they cannot match the accuracy of live network evaluations. Switching from the simulation to the actual implementation often requires a considerable develo ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2009

On Static Analysis for Expressive Pattern Matching

Viktor Kuncak, Philippe Paul Henri Suter, Mirco Dotta

Pattern matching is a widespread programming language construct that enables definitions of values by cases, generalizing if-then-else and case statements. The cases in a pattern matching expression should be exhaustive: when the value does not match any o ...

2008

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

An Overview of the Scala Programming Language (2. Edition)

Martin Odersky, Gilles Dubochet, Michel Schinz, Vincent Cremet, Burak Emir, Iulian Dragos, Stéphane Micheloud, Nikolay Mihaylov, Matthias Zenger, Philippe Altherr

Scala fuses object-oriented and functional programming in a statically typed programming language. It is aimed at the construction of components and component systems. This paper gives an overview of the Scala language for readers who are familar with prog ...

2006

A Component Approach to Optical Transmission Network Design

The article describes the philosophy of component approach to system design, illustrated on the optical transmission network example. The approach is based on the object oriented paradigms of Cosmos and Nyx tools. Cosmos serves as the support for system an ...

Springer2006

Autonomous Recovery in Componentized Internet Applications

George Candea

In this paper we show how to reduce downtime of J2EE applications by rapidly and automatically recovering from transient and intermittent software failures, without requiring application modifications. Our prototype combines three application-agnostic tech ...

2006

Scalable Component Abstractions

Martin Odersky, Matthias Zenger

We identify three programming language abstractions for the construction of reusable components: abstract type members, explicit selftypes, and modular mixin composition. Together, these abstractions enable us to transform an arbitrary assembly of static p ...

2005

The SLinks Language

Gilles Dubochet

This report presents a prototype interpreter for a simple functional language, called SLinks. The focus of this work is two-fold. One side is the design of a type inference system, based on the Hindley-Milner algorithm, with additional support for record a ...

2005