| 2022 | Concrete categories and higher-order recursion: With applications including probability, differentiability, and full abstraction. | Cristina Matache, Sean K. Moss, Sam Staton |
| 2022 | When Locality Meets Preservation. | Aliaume Lopez |
| 2022 | Quantum Weakest Preconditions for Reasoning about Expected Runtimes of Quantum Programs. | Junyi Liu, Li Zhou, Gilles Barthe, Mingsheng Ying |
| 2022 | On the Skolem Problem and the Skolem Conjecture. | Richard Lipton, Florian Luca, Joris Nieuwveld, Jol Ouaknine, David Purser, James Worrell |
| 2022 | Probabilistic Verification Beyond Context-Freeness. | Guanyan Li, Andrzej S. Murawski, Luke Ong |
| 2022 | Choiceless Polynomial Time with Witnessed Symmetric Choice. | Moritz Lichter, Pascal Schweitzer |
| 2022 | Monoidal Streams for Dataflow Programming. | Elena Di Lavore, Giovanni de Felice, Mario Romn |
| 2022 | Size measures and alphabetic equivalence in the μ-calculus. | Clemens Kupke, Johannes Marti, Yde Venema |
| 2022 | Greatest HITs: Higher inductive types in coinductive definitions via induction under clocks. | Magnus Baunsgaard Kristensen, Rasmus Ejlers Mgelberg, Andrea Vezzosi |
| 2022 | Computing the Density of the Positivity Set for Linear Recurrence Sequences. | Edon Kelmendi |
| 2022 | Complexity of Modular Circuits. | Pawel M. Idziak, Piotr Kawalek, Jacek Krzaczkowski |
| 2022 | Zigzag normalisation for associative n-categories. | Lukas Heidemann, David Reutter, Jamie Vicary |
| 2022 | Temporal Team Semantics Revisited. | Jens Oliver Gutsfeld, Arne Meier, Christoph Ohrem, Jonni Virtema |
| 2022 | Normalization for Multimodal Type Theory. | Daniel Gratzer |
| 2022 | Zero-One Laws and Almost Sure Valuations of First-Order Logic in Semiring Semantics. | Erich Grdel, Hayyan Helal, Matthias Naaf, Richard Wilke |
| 2022 | Milner's Proof System for Regular Expressions Modulo Bisimilarity is Complete: Crystallization: Near-Collapsing Process Graph Interpretations of Regular Expressions. | Clemens Armin Grabmayer |
| 2022 | A first-order completeness result about characteristic Boolean algebras in classical realizability. | Guillaume Geoffroy |
| 2022 | The Complexity of Bidirected Reachability in Valence Systems. | Moses Ganardi, Rupak Majumdar, Georg Zetzsche |
| 2022 | Stable graphs of bounded twin-width. | Jakub Gajarsk, Michal Pilipczuk, Szymon Torunczyk |
| 2022 | Graded Monads and Behavioural Equivalence Games. | Chase Ford, Stefan Milius, Lutz Schrder, Harsh Beohar, Barbara Knig |
| 2022 | A Type Theory for Strictly Unital ∞-Categories. | Eric Finster, David Reutter, Jamie Vicary, Alex Rice |
| 2022 | Reasoning on Data Words over Numeric Domains. | Diego Figueira, Anthony Widjaja Lin |
| 2022 | Treelike Decompositions for Transductions of Sparse Graphs. | Jan Dreier, Jakub Gajarsk, Sandra Kiefer, Michal Pilipczuk, Szymon Torunczyk |
| 2022 | On Almost-Uniform Generation of SAT Solutions: The power of 3-wise independent hashing. | Remi Delannoy, Kuldeep S. Meel |
| 2022 | Separating LREC from LFP. | Anuj Dawar, Felipe Ferreira Santos |