Abstract In two previous papers [33],[37], we exposed a combinatorial approach to the
program of Geometry of Interaction, a program initiated by Jean-Yves Girard [16]. The …

This article exhibits a series of semantic characterisations of sublinear nondeterministic
complexity classes. These results fall into the general domain of logic-based approaches to …

We present the stellar resolution, a" flexible" tile system based on Robinson's first-order
resolution. After establishing formal definitions and basic properties of the stellar resolution …

This paper is the fourth of a series exposing a systematic combinatorial approach to Girard's
Geometry of Interaction (GoI) program. The GoI program aims at obtaining particular …

Several techniques for analysis and transformations are used in compilers. Among them, the
peeling of loops for hoisting quasi-invariants can be used to optimize generated code, or …

This work leverages an original dependency analysis to parallelize loops regardless of their
form in imperative programs. Our algorithm distributes a loop into multiple parallelizable …

Cobordism categories are known to be compact closed. They can therefore be used to
define non-degenerate models of multiplicative linear logic by combining the Int construction …

In a recent paper, the author has shown how Interaction Graphs models for linear logic can
be used to obtain implicit characterisations of non-deterministic complexity classes. In this …

The author introduced models of linear logic known as “Interaction Graphs” which
generalise Girard's various Geometry of Interaction constructions. In this work, we establish …

We provide a new realisability model based on orthogonality for the multiplicative fragment
of linear logic, both in presence of generalised axioms (MLL^✠) and in the standard case …