| Publication | Date of Publication | Type |
|---|
| Linear realisability over nets: multiplicatives | 2026-06-09 | Paper |
| Agafonov's theorem for probabilistic selectors | 2026-05-12 | Paper |
Agafonov's theorem for finite and infinite alphabets and probability distributions different from equidistribution
Ergodic Theory and Dynamical Systems | 2025-10-14 | Paper |
| A Cartesian bicategory of polynomial functors in homotopy type theory | 2024-12-17 | Paper |
Unifying lower bounds for algebraic machines, semantically
Information and Computation | 2024-12-03 | Paper |
Zeta functions and the (linear) logic of Markov processes
Logical Methods in Computer Science | 2024-09-04 | Paper |
Distributing and parallelizing non-canonical loops
Lecture Notes in Computer Science | 2023-08-17 | Paper |
| Multiplicative linear logic from a resolution-based tile system | 2022-07-18 | Paper |
| mwp-Analysis Improvement and Implementation: Realizing Implicit Computational Complexity | 2022-03-08 | Paper |
Coherent interaction graphs
(available as arXiv preprint) | 2021-12-20 | Paper |
| Coherent interaction graphs | 2021-12-20 | Paper |
| An extended and more practical mwp flow analysis | 2021-06-24 | Paper |
| pymwp: A Tool for Guaranteeing Complexity Bounds for C Programs | 2021-06-24 | Paper |
Verificationism and Classical Realizability
Logic, Argumentation & Reasoning | 2020-08-06 | Paper |
| Agafonov's Proof of Agafonov's Theorem: A Modern Account and New Insights | 2020-07-07 | Paper |
Interaction graphs: exponentials
(available as arXiv preprint) | 2019-09-13 | Paper |
Interaction Graphs
ACM Transactions on Computational Logic | 2018-10-24 | Paper |
Interaction graphs: full linear logic
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
A correspondence between maximal abelian sub-algebras and linear logic fragments
Mathematical Structures in Computer Science | 2018-01-04 | Paper |
scientific article; zbMATH DE number 6816930 (Why is no real title available?)
(available as arXiv preprint) | 2017-12-11 | Paper |
| An intensionally fully-abstract sheaf model for \(\pi\) | 2017-07-11 | Paper |
Interaction graphs: graphings
Annals of Pure and Applied Logic | 2016-12-02 | Paper |
Characterizing<b>co-NL</b>by a group action
Mathematical Structures in Computer Science | 2016-07-28 | Paper |
Unary resolution: characterizing \textsc{Ptime}
Lecture Notes in Computer Science | 2016-06-10 | Paper |
Logarithmic space and permutations
Information and Computation | 2016-05-03 | Paper |
| From Dynamic to Static Semantics, Quantitatively | 2016-04-18 | Paper |
Logic programming and logarithmic space
Programming Languages and Systems | 2016-02-26 | Paper |
Interaction graphs: additives
Annals of Pure and Applied Logic | 2015-11-18 | Paper |
| Towards a Complexity-through-Realisability Theory | 2015-02-04 | Paper |
| Memoization for Unary Logic Programming: Characterizing PTIME | 2015-01-21 | Paper |
Interaction Graphs: Exponentials
(available as arXiv preprint) | 2013-12-04 | Paper |
Interaction graphs: multiplicatives
Annals of Pure and Applied Logic | 2012-10-11 | Paper |
