We study logic in the light of the Kantian distinction between analytic (untyped, meaningless,
locative) answers and synthetic (typed, meaningful, spiritual) questions. Which is specially …

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 give a characterization of deterministic polynomial time computation based on an
algebraic structure called the resolution semiring, whose elements can be understood as …

We present an algebraic characterization of the complexity classes Logspace and
NLogspace, using an algebra with a composition law based on unification. This new bridge …

We explain how recent developments in the fields of realisability models for linear logic--or
geometry of interaction--and implicit computational complexity can lead to a new approach …

In this thesis, we study a semiring structure with a product based on the resolution rule of
logic programming. This mathematical object was introduced initially in the setting of the …

Slot and van Emde Boas Invariance Thesis states that a time (respectively, space) cost
model is reasonable for a computational model C if there are mutual simulations between …

Implicit Computational Complexity makes two aspects implicit, by manipulating
programming languages rather than models of com-putation, and by internalizing the …

We give a characterization of deterministic polynomial time computation based on an
algebraic structure called the resolution semiring, whose elements can be understood as …

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 …