**Coordinates:** Tuesday March 31, 2015 at 10 am - ENS Lyon, site Monod, amphi B

**Title:** Higher-order languages: dualities and bisimulation enhancements

**Advisors:** Daniel Hirschkoff and Davide Sangiorgi

**Jury:**
Pierre-Louis Curien,
Daniel Hirschkoff,
Vasileios Koutavas,
Davide Sangiorgi,
Daniele Varacca and
Björn Victor.

**Dissertation:** phd.pdf

**Summary:** The behaviours of concurrent
processes can be expressed using process calculi, which are
simple formal languages that let us establish precise
mathematical results on the behaviours and interactions
between processes. A very simple example is CCS, another one
is the pi-calculus, which is more expressive thanks to a
name-passing mechanism. The pi-calculus supports the addition
of type systems (to refine the analysis to more subtle
environments) and the encoding of the lambda-calculus (which
represents sequential computations).

Some of these calculi, like CCS or variants of the pi-calculus such as fusion calculi, enjoy a property of symmetry. First, we use this symmetry as a tool to prove that two encodings of the lambda-calculus in the pi-calculus are in fact equivalent.

This proof using a type system and a form of symmetry, we wonder if other existing symmetric calculi can support the addition of type systems. We answer negatively to this question with an impossibility theorem.

Investigating this theorem leads us to a fundamental constraint of these calculi that forbids types: they induce an equivalence relation on names. Relaxing this constraint to make it a preorder relation yields another calculus that recovers important notions of the pi-calculus, that fusion calculi do not satisfy: the notions of types and of privacy of names. The first part of this thesis focuses on the study of this calculus, a pi-calculus with preorders on names.

The second part of this thesis focuses on bisimulation, a proof method for equivalence of agents in higher-order languages, like the pi- or the lambda-calculi. An enhancement of this method is the powerful theory of bisimulations up to, which unfortunately only applies for first-order systems, like automata or CCS.

We then proceed to describe higher-order languages as first-order systems. This way, we inherit the general theory of up-to techniques for these languages, by proving correct the translations and up-to techniques that are specific to each language. We give details on the approach, to provide the necessary tools for future applications of this method to other higher-order languages.