12 citations · 14 across the 2 of their papers we have counts for
3 papers
cs.LO2016
From Dynamic to Static Semantics, Quantitatively
Thomas Seiller
We exhibit a new relationship between dynamic and static semantics. We define the categorical outlay needed to define Interaction Graphs models, a generalisation of Girard's Geomet…
cs.LO2015★ 2 cited
Memoization for Unary Logic Programming: Characterizing PTIME
Clément Aubert, Marc Bagnol, Thomas Seiller
We give a characterization of deterministic polynomial time computation based on an algebraic structure called the resolution semiring, whose elements can be understood as logic pr…
cs.LO2015★ 12 cited
Towards a Complexity-through-Realisability Theory
Thomas Seiller
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 a…