| 0 | -- | 0 | Étienne André, Didier Lime, Nicolas Markey. Language Preservation Problems in Parametric Timed Automata |
| 0 | -- | 0 | Jörg Endrullis, Jan Willem Klop, Roy Overbeek. Decreasing Diagrams for Confluence and Commutation |
| 0 | -- | 0 | Ambrus Kaposi, András Kovács. Signatures and Induction Principles for Higher Inductive-Inductive Types |
| 0 | -- | 0 | Thorsten Wißmann, Ulrich Dorsch, Stefan Milius, Lutz Schröder. Efficient and Modular Coalgebraic Partition Refinement |
| 0 | -- | 0 | Giuseppe Castagna. Covariance and Controvariance: a fresh look at an old issue (a primer in advanced type systems for learning functional programmers) |
| 0 | -- | 0 | Michaël Cadilhac, Olivier Carton, Charles Paperman. Continuity of Functional Transducers: A Profinite Study of Rational Functions |
| 0 | -- | 0 | Lê Thành Dung Nguyên. Unique perfect matchings, forbidden transitions and proof nets for linear logic with Mix |
| 0 | -- | 0 | Alexander A. Semenov, Ilya V. Otpuschennikov, Irina Gribanova, Oleg Zaikin 0002, Stepan Kochemazov. Translation of Algorithmic Descriptions of Discrete Functions to SAT with Applications to Cryptanalysis Problems |
| 0 | -- | 0 | Egbert Rijke, Michael Shulman, Bas Spitters. Modalities in homotopy type theory |
| 0 | -- | 0 | Marcelo Arenas, Martin Muñoz, Cristian Riveros. Descriptive Complexity for Counting Complexity Classes |
| 0 | -- | 0 | Mikolaj Bojanczyk, Laure Daviaud, Bruno Guillon, Vincent Penelle, A. V. Sreejith. Undecidability of a weak version of MSO+U |
| 0 | -- | 0 | Olivier Bournez, Amaury Pouly. A Universal Ordinary Differential Equation |
| 0 | -- | 0 | Manuel Bodirsky, Johannes Greiner. The Complexity of Combinations of Qualitative Constraint Satisfaction Problems |
| 0 | -- | 0 | Lukasz Czajka 0001. An operational interpretation of coinductive types |
| 0 | -- | 0 | Iosif Petrakis. McShane-Whitney extensions in constructive analysis |
| 0 | -- | 0 | Max S. New, Daniel R. Licata. Call-by-name Gradual Type Theory |
| 0 | -- | 0 | Olivier Gauwin, Anca Muscholl, Michael Raskin. Minimization of visibly pushdown automata is NP-complete |
| 0 | -- | 0 | Chuangjie Xu. A syntactic approach to continuity of T-definable functionals |
| 0 | -- | 0 | Thomas Colcombet, Daniela Petrisan. Automata Minimization: a Functorial Approach |
| 0 | -- | 0 | Sean Tull. A Categorical Reconstruction of Quantum Theory |
| 0 | -- | 0 | Achim Blumensath. Regular Tree Algebras |
| 0 | -- | 0 | Delia Kesner, Pierre Vial. Non-idempotent types for classical calculi in natural deduction style |
| 0 | -- | 0 | Mathys Rennela, Sam Staton. Classical Control, Quantum Circuits and Linear Logic in Enriched Category Theory |
| 0 | -- | 0 | Mauricio Ayala-Rincón, Maribel Fernández, Daniele Nantes Sobrinho. On Nominal Syntax and Permutation Fixed Points |
| 0 | -- | 0 | Robert Furber, Radu Mardare, Matteo Mio. Probabilistic logics based on Riesz spaces |
| 0 | -- | 0 | Alexi Block Gorman, Philipp Hieronymi, Elliot Kaplan, Ruoyu Meng, Erik Walsberg, Zihe Wang, Ziqin Xiong, Hongru Yang. Continuous Regular Functions |
| 0 | -- | 0 | Pawel Parys. Recursion Schemes, the MSO Logic, and the U quantifier |
| 0 | -- | 0 | Wojciech Kazana, Luc Segoufin. First-order queries on classes of structures with bounded expansion |
| 0 | -- | 0 | Bart Jacobs 0001, Abraham Westerbaan. Distances between States and between Predicates |
| 0 | -- | 0 | Francesco Ciraulo, Michele Contente. Overlap Algebras: a Constructive Look at Complete Boolean Algebras |
| 0 | -- | 0 | Lukasz Czajka 0001. A new coinductive confluence proof for infinitary lambda calculus |
| 0 | -- | 0 | Anupam Das 0002. On the logical complexity of cyclic arithmetic |