Publication

Initialization patterns in Dotty

Related publications (58)

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.

Distributed Consensus, Revisited

Rachele Fuzzati, Massimo Merro

We provide a novel model to formalize a well-known algorithm, by Chandra and Toueg, that solves Consensus among asynchronous distributed processes in the presence of a particular class of failure detectors (Diamond S or, equivalently, Omega), under the hyp ...

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

Typing for Reliable Distributed Systems - Recent Advances

In this paper, we report on recent progress in the area of language-based software dependability. We give examples of using advanced type systems for statically detecting non-trivial programming errors in programs. We have chosen examples that are particul ...

2005

An Overview of the Scala Programming Language

Martin Odersky, Michel Schinz, Vincent Cremet, Burak Emir, 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 ...

2004

Schema matching for structured document transformations

Aïda Boukottaya

This dissertation studies structured document content reuse problem. In structured document content reuse, a document (or a part of document) structured under one schema must be restructured and translated into an instance of a different schema. Thus, a no ...

EPFL2004

Scalable Component Abstractions

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

2004

Scalable Component Abstractions

Martin Odersky, Matthias Zenger

2004

Iplt-image processing library and toolkit for the electron microscopy community

Henning Paul-Julius Stahlberg, Andreas Engel

We present the foundation for establishing a modular, collaborative, integrated, open-source architecture for image processing of electron microscopy images, named iplt. It is designed around object oriented paradigms and implemented using the programming ...

Elsevier BV2003

Unreliable Failure Detectors via Operational Semantics

Rachele Fuzzati

The concept of unreliable failure detectors for reliable distributed systems was introduced by Chandra and Toueg as a fine-grained means to add weak forms of synchrony into asynchronous systems. Various kinds of such failure detectors have been identified ...

2003

Unreliable Failure Detectors via Operational Semantics

Rachele Fuzzati

The concept of Unreliable failure detectors for reliable distributed systems was introduced by Chandra and Toueg as a fine-grained means to add weak forms of synchrony into asynchronous systems. Various kinds of such failure detectors have been identified ...

2003