In higher-order process calculi, the values exchanged in communications may contain
processes. A core calculus of higher-order concurrency is studied; it has only the operators …

What does it mean that an encoding is fully abstract? What does it not mean? In this position
paper, we want to help the reader to evaluate the real benefits of using such a notion when …

Encodings or the proof of their absence are the main way to compare process calculi. To
analyse the quality of encodings and to rule out trivial or meaningless encodings, they are …

Encodings or the proof of their absence are the main way to compare process calculi. To
analyse the quality of encodings and to rule out trivial or meaningless encodings, they are …

By integrating constructs from the λ-calculus and the π-calculus, in higher-order process
calculi exchanged values may contain processes. This paper studies the relative …

We propose the concept of adaptable processes as a way of overcoming the limitations that
process calculi have for describing patterns of dynamic process evolution. Such patterns rely …

Propositional Gödel logic G extends intuitionistic logic with the non-constructive principle of
linearity (A→ B)∨(B→ A). We introduce a Curry-Howard correspondence for G and show …

Higher-order process calculi are calculi in which processes can be communicated. We study
the expressiveness of strictly higher-order process calculi, and focus on two issues well …

Session types are a typed approach to message-passing concurrency, where types describe
sequences of intended exchanges over channels. Session type systems have been given …

This paper explores expressiveness of asynchronous multiparty sessions. We model the
behaviours of endpoint implementations in several ways:(i) by the existence of different …