Publication

Language Support for Distributed Functional Programming

Related publications (133)

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.

Pragmatic Type Interoperability

Rachid Guerraoui, Patrick Eugster, Philippe Altherr

Providing type interoperability consists in ensuring that, even if written by different programmers, possibly in different languages and running on different platforms, types that are supposed to represent the same software module are indeed treated as one ...

2003

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

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

Failure Detectors as First Class Objects

Rachid Guerraoui, Xavier Défago

One of the fundamental differences between a centralized system and a distributed one is the notion of partial failures. The ability to efficiently and accurately detect failures is a key element underlying reliable distributed computing. In current distri ...

1999

Evaluating the performance of software distributed shared memory as a target for parallelizing compilers

Willy Zwaenepoel, Sandhya Dwarkadas

In this paper we evaluate the use of software distributed shared memory (DSM) on a message passing machine as the target for a parallelizing compiler. We compare this approach to compiler-generated message passing, hand-coded software DSM and hand-coded me ...

1997

Teapot: Language Support for Writing Memory Coherence Protocols

James Richard Larus

Recent shared-memory parallel computer systems offer the exciting possibility of customizing memory coherence protocols to fit an application's semantics and sharing patterns. Custom protocols have been used to achieve message-passing performance---while r ...

ACM1996

A generic service management architecture for multimedia multipoint communications

Jean-Pierre Hubaux

With rapid advances in multimedia processing technologies, and in high bandwidth network technologies, new kinds of multimedia applications are now emerging. These applications require real-time, multimedia, and multipoint interactions involving multiple c ...

1995

A Light Weight Name Service and its use within a Collaborative Editor

\begin{abstract} This paper presents the LWNS a light weight name service specially designed for groupware applications and an example of its use. The chosen application, called {\sc Duplex}, is a collaborative editing environment for users connected throu ...

Chapman & Hall1995

Using the Run-Time Sizes of Data Structures to Guide Parallel-Thread Creation

James Richard Larus

Dynamic granularity estimation is a new technique for automatically identifying expressions in functional languages for parallel evaluation. Expressions with little computation relative to thread-creation costs should evaluate sequentially for maximum perf ...

ACM1994