Thomas Seiller

According to our database, Thomas Seiller authored at least 43 papers between 2012 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

Zeta Functions and the (Linear) Logic of Markov Processes.

Thomas Seiller

Log. Methods Comput. Sci., 2024

Unifying lower bounds for algebraic machines, semantically.

Thomas Seiller, Luc Pellissier, Ulysse Léchine

Inf. Comput., 2024

Agafonov's Theorem for Probabilistic Selectors.

Ulysse Léchine, Thomas Seiller, Jakob Grue Simonsen

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

Mathematical Informatics: Outline of a mathematical theory of computer science.

Thomas Seiller

, 2024

2023

Linear Realisability and Cobordisms.

Valentin Maestracci, Thomas Seiller

CoRR, 2023

Distributing and Parallelizing Non-canonical Loops.

Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller

Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2023

Linear Realisability Over Nets and Second Order Quantification (short paper).

Adrien Ragot, Thomas Seiller, Lorenzo Tortora de Falco

Proceedings of the 24th Italian Conference on Theoretical Computer Science, 2023

pymwp: A Static Analyzer Determining Polynomial Growth Bounds.

Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller

Proceedings of the Automated Technology for Verification and Analysis, 2023

2022

Multiplicative linear logic from a resolution-based tile system.

Boris Eng, Thomas Seiller

CoRR, 2022

A Novel Loop Fission Technique Inspired by Implicit Computational Complexity.

Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller

CoRR, 2022

Realizing Implicit Computational Complexity.

Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller

CoRR, 2022

mwp-Analysis Improvement and Implementation: Realizing Implicit Computational Complexity.

Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller

Proceedings of the 7th International Conference on Formal Structures for Computation and Deduction, 2022

2021

A Cartesian Bicategory of Polynomial Functors in Homotopy Type Theory.

Eric Finster, Samuel Mimram, Maxime Lucas, Thomas Seiller

Proceedings of the Proceedings 37th Conference on Mathematical Foundations of Programming Semantics, 2021

An implementation of flow calculus for complexity analysis (tool paper).

Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller

CoRR, 2021

An extended and more practical mwp flow analysis.

Clément Aubert, Thomas Rubiano, Neea Rusch, Thomas Seiller

CoRR, 2021

2020

Agafonov's Theorem for finite and infinite alphabets and probability distributions different from equidistribution.

Thomas Seiller, Jakob Grue Simonsen

CoRR, 2020

Stellar Resolution: Multiplicatives.

Boris Eng, Thomas Seiller

CoRR, 2020

An Embellished Account of Agafonov's Proof of Agafonov's Theorem.

Thomas Seiller, Jakob Grue Simonsen

CoRR, 2020

Lower bounds for prams over Z.

Luc Pellissier, Thomas Seiller

CoRR, 2020

Probabilistic Complexity Classes through Semantics.

Thomas Seiller

CoRR, 2020

2019

Interaction Graphs: Exponentials.

Thomas Seiller

Log. Methods Comput. Sci., 2019

Finite semantics of polymorphism, complexity and the power of type fixpoints.

Lê Thành Dung Nguyên, Paolo Pistone, Thomas Seiller, Lorenzo Tortora de Falco

CoRR, 2019

2018

Interaction Graphs: Non-Deterministic Automata.

Thomas Seiller

ACM Trans. Comput. Log., 2018

A correspondence between maximal abelian sub-algebras and linear logic fragments.

Thomas Seiller

Math. Struct. Comput. Sci., 2018

Coherent Interaction Graphs.

Lê Thành Dung Nguyên, Thomas Seiller

Proceedings of the Proceedings Joint International Workshop on Linearity & Trends in Linear Logic and Applications, 2018

PRAMs over integers do not compute maxflow efficiently.

Luc Pellissier, Thomas Seiller

CoRR, 2018

2017

An intensionally fully-abstract sheaf model for π (expanded version).

Clovis Eberhart, Tom Hirschowitz, Thomas Seiller

Log. Methods Comput. Sci., 2017

Loop Quasi-Invariant Chunk Motion by peeling with statement composition.

Jean-Yves Moyen, Thomas Rubiano, Thomas Seiller

Proceedings of the Proceedings 8th Workshop on Developments in Implicit Computational Complexity and 5th Workshop on Foundational and Practical Aspects of Resource Analysis, 2017

Interaction graphs: Graphings.

Thomas Seiller

Ann. Pure Appl. Log., 2017

Loop Quasi-Invariant Chunk Detection.

Jean-Yves Moyen, Thomas Rubiano, Thomas Seiller

Proceedings of the Automated Technology for Verification and Analysis, 2017

2016

Characterizing co-NL by a group action.

Clément Aubert, Thomas Seiller

Math. Struct. Comput. Sci., 2016

Logarithmic space and permutations.

Clément Aubert, Thomas Seiller

Inf. Comput., 2016

Interaction Graphs: Nondeterministic Automata.

Thomas Seiller

CoRR, 2016

From Dynamic to Static Semantics, Quantitatively.

Thomas Seiller

CoRR, 2016

Interaction graphs: Additives.

Thomas Seiller

Ann. Pure Appl. Log., 2016

Interaction Graphs: Full Linear Logic.

Thomas Seiller

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Unary Resolution: Characterizing Ptime.

Clément Aubert, Marc Bagnol, Thomas Seiller

Proceedings of the Foundations of Software Science and Computation Structures, 2016

2015

Towards a Complexity-through-Realizability Theory.

Thomas Seiller

CoRR, 2015

Memoization for Unary Logic Programming: Characterizing PTIME.

Clément Aubert, Marc Bagnol, Thomas Seiller

CoRR, 2015

An Intensionally Fully-abstract Sheaf Model for pi.

Clovis Eberhart, Tom Hirschowitz, Thomas Seiller

Proceedings of the 6th Conference on Algebra and Coalgebra in Computer Science, 2015

2014

Logic Programming and Logarithmic Space.

Clément Aubert, Marc Bagnol, Paolo Pistone, Thomas Seiller

Proceedings of the Programming Languages and Systems - 12th Asian Symposium, 2014

2013

Fully-abstract concurrent games for pi.

Clovis Eberhart, Tom Hirschowitz, Thomas Seiller

CoRR, 2013

2012

Interaction graphs: Multiplicatives.

Thomas Seiller

Ann. Pure Appl. Log., 2012