4 citations · 9 across the 6 of their papers we have counts for
6 papers · 1 filter
Linear Realisability and Cobordisms
Valentin Maestracci, Thomas Seiller
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 wit…
Multiplicative linear logic from a resolution-based tile system
Boris Eng, Thomas Seiller
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 re…
A Cartesian Bicategory of Polynomial Functors in Homotopy Type Theory
Eric Finster, Samuel Mimram, Maxime Lucas +1
Polynomial functors are a categorical generalization of the usual notion of polynomial, which has found many applications in higher categories and type theory: those are generated…
Interaction Graphs: Nondeterministic Automata
Thomas Seiller
This paper exhibits a series of semantic characterisations of sublinear nondeterministic complexity classes. These results fall into the general domain of logic-based approaches to…
Logic Programming and Logarithmic Space
Clément Aubert, Marc Bagnol, Paolo Pistone +1
We present an algebraic view on logic programming, related to proof theory and more specifically linear logic and geometry of interaction. Within this construction, a characterizat…
Interaction Graphs: Multiplicatives
Thomas Seiller
We introduce a graph-theoretical representation of proofs of multiplicative linear logic which yields both a denotational semantics and a notion of truth. For this, we use a locati…