A bi category of very general nondeterministic concurrent games and strategies is
presented. The intention is to formalize distributed games in which both Player (or a team of …

Quantum programming languages permit a hardware independent, high-level description of
quantum algorithms. In particular, the quantum λ-calculus is a higher-order language with …

Game semantics and session types are two formalisations of the same concept: message-
passing open programs following certain protocols. Game semantics represents protocols …

A dialogue category is a symmetric monoidal category equipped with a notion of tensorial
negation. We establish that the free dialogue category is a category of dialogue games and …

We present an overview of some recent work on the quantitative semantics of the λ-calculus.
Our starting point is the fundamental degenerate model of linear logic, the relational model …

We present QBAL, an extension of Girard, Scedrov and Scott's bounded linear logic. The
main novelty of the system is the possibility of quantifying over resource variables. This …

We extend our recent template game model of multiplicative additive linear logic (MALL)
with an exponential modality of linear logic (LL) derived from the standard categorical …

We consider the distributed control problem in the setting of Zielonka asynchronous
automata. Such automata are compositions of finite processes communicating via shared …

We consider a non-uniform affine lambda-calculus, called parsimonious, and endow its
terms with two type disciplines: simply-typed and with linear polymorphism. We show that …

We propose and study a translation of a pi-calculus without sums nor recursion into an
untyped version of differential interaction nets. We define a transition system of labeled …