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 …

We show a correspondence between a classification of maximal abelian sub-algebras
(MASAs) proposed by Jacques Dixmier (Dixmier 1954. Annals of Mathematics59 (2) 279 …

The resource λ-calculus is a variation of the λ-calculus where arguments are superpositions
of terms and must be linearly used; hence, it is a model for linear and non-deterministic …

What is a model of computation? What is a program, an algorithm? While theoretical
computer science has been founded on computability theory, the latter does not answer …

We present a new asynchronous model of computation named Stellar Resolution based on
first-order unification. This model of computation is obtained as a formalisation of Girard's …

This thesis provides a clarification of Girard's recent work entitled" transcendental syntax".
Girard suggests a reorganisation and a reinterpretation of concepts of mathematical logic …

Lower bounds. Complexity theory has traditionally been concerned with proving separation
results. Among the numerous open separation problems lies the much advertised Ptime vs …

This thesis aims to establish new connections between two distinct fields within theoretical
computer science. The first is automata theory, whose objects of study are models of …