Simply typed convertibility is TOWER-complete even for safe lambda-terms.
Log. Methods Comput. Sci., 2024
Two or three things I know about tree transducers.
CoRR, 2024
On the complexity of normalization for the planar λ-calculus.
CoRR, 2024
Function Spaces for Orbit-Finite Sets.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024
Syntactically and Semantically Regular Languages of λ-Terms Coincide Through Logical Relations.
Proceedings of the 32nd EACSL Annual Conference on Computer Science Logic, 2024
A System of Interaction and Structure III: The Complexity of BV and Pomset Logic.
Log. Methods Comput. Sci., 2023
Syntactically and semantically regular languages of lambda-terms coincide through logical relations.
CoRR, 2023
Two-way automata and transducers with planar behaviours are aperiodic.
CoRR, 2023
Revisiting the growth of polyregular functions: output languages, weighted automata and unary inputs.
CoRR, 2023
Algebraic Recognition of Regular Functions.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023
BV and Pomset Logic Are Not the Same.
Proceedings of the 30th EACSL Annual Conference on Computer Science Logic, 2022
Automates implicites en logique linéaire et théorie catégorique des transducteurs. (Implicit automata in linear logic and categorical transducer theory).
PhD thesis, 2021
Comparison-Free Polyregular Functions.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021
Unique perfect matchings, forbidden transitions and proof nets for linear logic with Mix.
Log. Methods Comput. Sci., 2020
Implicit automata in typed λ-calculi II: streaming transducers vs categorical semantics.
CoRR, 2020
Implicit Automata in Typed λ-Calculi I: Aperiodicity in a Non-Commutative Logic.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020
When lattice cubes meet affine subspaces: a short note.
CoRR, 2019
On the Elementary Affine Lambda-Calculus with and Without Fixed Points.
Proceedings of the Proceedings Third Joint Workshop on Developments in Implicit Computational complExity and Foundational & Practical Aspects of Resource Analysis, 2019
Typed lambda-calculi and superclasses of regular functions.
CoRR, 2019
Finite semantics of polymorphism, complexity and the power of type fixpoints.
CoRR, 2019
Unique perfect matchings, edge-colored graphs and proof nets for linear logic with Mix.
CoRR, 2019
Constrained path-finding and structure from acyclicity.
CoRR, 2019
From Normal Functors to Logarithmic Space Queries.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019
Coherent Interaction Graphs.
Proceedings of the Proceedings Joint International Workshop on Linearity & Trends in Linear Logic and Applications, 2018
Unique perfect matchings and proof nets.
Proceedings of the 3rd International Conference on Formal Structures for Computation and Deduction, 2018