The join-calculus is both a name passing calculus and a core language for concurrent and distributed programming. An essential part of its implementation is the compilation of join-patterns. Join-patterns deene new channels and all the synchronizations they take part to at the same time. Relying on the experience based on our two implementations, we study the translation of join-patterns into d...

This paper describes the Orbit Scheme optimizing compiler. Orbit was one of the first practical compilers for Scheme, whereas most existing Scheme compilers at the time were research prototypes. The paper walks us through the phases of the compiler, explaining design decisions along the way. The result of this research is a production-quality Scheme compiler. It generates code that is competiti...

From 3 February to 8 February 2008, the Dagstuhl Seminar 08061 Types, Logics and Semantics for State was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of sem...

In this paper we investigate how to extend a generic constraint solver that provides not only tell constraints (by adding the constraint to the store) but also ask tests (by checking whether the constraint is entailed by the store), with general ask constraints. Ask constraints are important for implementing constraint implication, extensible solvers using dynamic scheduling and reification. Wh...

The implementation of functional logic languages by means of graph 7 rewriting requires a special handling of collapsing rules. Recent advances about 8 the notion of a needed step in some constructor systems offer a new approach 9 to this problem. We present two results: a transformation of a certain class of 10 constructor-based rewrite systems that eliminates collapsing rules, and a rewrite11...

Measuring the flow of traffic along network paths is crucial for many management tasks, including traffic engineering, diagnosing congestion, and mitigating DDoS attacks. We introduce a declarative query language for efficient path-based traffic monitoring. Path queries are specified as regular expressions over predicates on packet locations and header values, with SQLlike “groupby” constructs ...

Fresh Breeze is a highly parallel architecture currently under development, which strives to provide high performance scientific computing with simple programmability. The architecture provides for multithreaded determinate execution with a write-once shared memory system. In particular, Fresh Breeze data structures must be constructed from directed acyclic graphs of immutable fixed-size chunks...