Table of Contents

• A comonadic view of simulation and quantum resourcesSamson Abramsky, Rui Soares Barbosa, Martti Karvonen, Shane Mansfield. 1-12 [doi]
• Codensity Games for BisimilarityYuichi Komorida, Shin-ya Katsumata, Nick Hu, Bartek Klin, Ichiro Hasuo. 1-13 [doi]
• Quantum Hoare Logic with Ghost VariablesDominique Unruh. 1-13 [doi]
• A type theory for cartesian closed bicategories (Extended Abstract)Marcelo Fiore, Philip Saville. 1-13 [doi]
• On the Power of Symmetric Linear ProgramsAlbert Atserias, Anuj Dawar, Joanna Ochremiak. 1-13 [doi]
• Canonisation and Definability for Graphs of Bounded Rank WidthMartin Grohe, Daniel Neuen. 1-13 [doi]
• Graph Planning with Expected Finite HorizonKrishnendu Chatterjee, Laurent Doyen 0001. 1-13 [doi]
• Intuitionistic proofs without syntaxWillem B. Heijltjes, Dominic J. D. Hughes, Lutz Straßburger. 1-13 [doi]
• Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems)Manuel Bodirsky, Antoine Mottet, Miroslav Olsák, Jakub Oprsal, Michael Pinsker, Ross Willard. 1-12 [doi]
• Local normal forms and their use in algorithmic meta theorems (Invited Talk)Nicole Schweikardt. 1-3 [doi]
• A Probabilistic and Non-Deterministic Call-by-Push-Value LanguageJean Goubault-Larrecq. 1-13 [doi]
• A Sequent Calculus for OpetopesCédric Ho Thanh, Pierre-Louis Curien, Samuel Mimram. 1-12 [doi]
• Describing free $\omega$ -categoriesSimon Forest, Samuel Mimram. 1-13 [doi]
• Block products for algebras over countable words and applications to logicBharat Adsul, Saptarshi Sarkar, A. V. Sreejith. 1-13 [doi]
• No-Go Theorems for Distributive LawsMaaike Zwart, Dan Marsden. 1-13 [doi]
• The Geometry of Bayesian ProgrammingUgo Dal Lago, Naohiko Hoshino. 1-13 [doi]
• Template games and differential linear logicPaul-André Melliès. 1-13 [doi]
• MSO+∇ is undecidableMikolaj Bojanczyk, Edon Kelmendi, Michal Skrzypczak. 1-13 [doi]
• Point-width and Max-CSPsClément Carbonnel, Miguel Romero 0001, Stanislav Zivny. 1-13 [doi]
• Quantum channels as a categorical completionMathieu Huot, Sam Staton. 1-13 [doi]
• Backprop as Functor: A compositional perspective on supervised learningBrendan Fong, David I. Spivak, Rémy Tuyéras. 1-13 [doi]
• Categorical Semantics for Time TravelNicola Pinzani, Stefano Gogioso, Bob Coecke. 1-20 [doi]
• Promises Make Finite (Constraint Satisfaction) Problems InfinitaryLibor Barto. 1-8 [doi]
• On the Termination Problem for Probabilistic Higher-Order Recursive ProgramsNaoki Kobayashi, Ugo Dal Lago, Charles Grellois. 1-14 [doi]
• Why Propositional Quantification Makes Modal Logics on Trees Robustly Hard?Bartosz Bednarczyk, Stéphane Demri. 1-13 [doi]
• Model Comparison Games for Horn Description LogicsJean Christoph Jung, Fabio Papacchini, Frank Wolter, Michael Zakharyaschev. 1-14 [doi]
• History-Dependent Nominal μ-CalculusClovis Eberhart, Bartek Klin. 1-13 [doi]
• Long-run Satisfaction of Path PropertiesChristel Baier, Nathalie Bertrand 0001, Jakob Piribauer, Ocan Sankur. 1-14 [doi]
• Lambda Y-Calculus With PrioritiesIgor Walukiewicz. 1-13 [doi]
• Approximate Span Liftings: Compositional Semantics for Relaxations of Differential PrivacyTetsuya Sato, Gilles Barthe, Marco Gaboardi, Justin Hsu, Shin-ya Katsumata. 1-14 [doi]
• Separation and covering for group based concatenation hierarchiesThomas Place, Marc Zeitoun. 1-13 [doi]
• Algorithmic barriers to representing conditional independenceNathanael L. Ackerman, Jeremy Avigad, Cameron E. Freer, Daniel M. Roy 0001, Jason M. Rute. 1-13 [doi]
• Higher-Kinded Data Types: Syntax and SemanticsPatricia Johann, Andrew Polonsky. 1-13 [doi]
• Presburger arithmetic with stars, rational subsets of graph groups, and nested zero testsChristoph Haase, Georg Zetzsche. 1-14 [doi]
• Learning Concepts Definable in First-Order Logic with CountingSteffen van Bergerem. 1-13 [doi]
• HoCHC: A Refutationally Complete and Semantically Invariant System of Higher-order Logic Modulo TheoriesC.-H. Luke Ong, Dominik Wagner. 1-14 [doi]
• High-level methods for homotopy construction in associative n-categoriesDavid Reutter, Jamie Vicary. 1-13 [doi]
• Lambda Calculus and Probabilistic ComputationClaudia Faggian, Simona Ronchi Della Rocca. 1-13 [doi]
• A Generic Normal Form for ZX-Diagrams and Application to the Rational Angle CompletenessEmmanuel Jeandel, Simon Perdrix, Renaud Vilmart. 1-10 [doi]
• Differentiable Causal Computations via Delayed TraceDavid Sprunger, Shin-ya Katsumata. 1-12 [doi]
• On the Existential Theories of Büchi Arithmetic and Linear p-adic FieldsFlorent Guépin, Christoph Haase, James Worrell 0001. 1-10 [doi]
• Realizability in the Unitary SphereAlejandro Díaz-Caro, Mauricio Guillermo, Alexandre Miquel, Benoît Valiron. 1-13 [doi]
• The Hierarchy of HyperlogicsNorine Coenen, Bernd Finkbeiner, Christopher Hahn, Jana Hofmann. 1-13 [doi]
• Reachability in Vector Addition Systems is Primitive-Recursive in Fixed DimensionJérôme Leroux, Sylvain Schmitz. 1-13 [doi]
• Completeness for Game LogicSebastian Enqvist, Helle Hvid Hansen, Clemens Kupke, Johannes Marti, Yde Venema. 1-13 [doi]
• Type-Based Complexity Analysis of Probabilistic Functional ProgramsMartin Avanzini, Ugo Dal Lago, Alexis Ghyselen. 1-13 [doi]
• Bisimulation Equivalence of First-Order Grammars is ACKERMANN-CompletePetr Jancar, Sylvain Schmitz. 1-12 [doi]
• Graphical Affine AlgebraFilippo Bonchi, Robin Piedeleu, Pawel Sobocinski, Fabio Zanasi. 1-12 [doi]
• Path Spaces of Higher Inductive Types in Homotopy Type TheoryNicolai Kraus, Jakob von Raumer. 1-13 [doi]
• A Type Theory for Defining Logics and ProofsBrigitte Pientka, David Thibodeau, Andreas Abel, Francisco Ferreira 0001, Rébecca Zucchini. 1-13 [doi]
• A Near-Minimal Axiomatisation of ZX-Calculus for Pure Qubit Quantum MechanicsRenaud Vilmart. 1-10 [doi]
• Walk refinement, walk logic, and the iteration number of the Weisfeiler-Leman algorithmMoritz Lichter, Ilia Ponomarenko, Pascal Schweitzer. 1-13 [doi]
• Matching μ-LogicXiaohong Chen 0002, Grigore Rosu. 1-13 [doi]
• A short story of the CSP dichotomy conjectureAndrei A. Bulatov. 1 [doi]
• The Logic of Action Lattices is UndecidableStepan Kuznetsov. 1-9 [doi]
• Perspective GamesOrna Kupferman, Gal Vardi. 1-13 [doi]
• Descriptive complexity for minimal time of cellular automataEtienne Grandjean, Théo Grente. 1-13 [doi]
• When is Ontology-Mediated Querying Efficient?Pablo Barceló, Cristina Feier, Carsten Lutz, Andreas Pieris. 1-13 [doi]
• Timed Systems through the Lens of LogicS. Akshay, Paul Gastin, Vincent Jugé, Shankara Narayanan Krishna. 1-13 [doi]
• The Theory of Traces for Systems with Nondeterminism and ProbabilityFilippo Bonchi, Ana Sokolova, Valeria Vignudelli. 1-14 [doi]
• The convex hull of finitely generable subsets and its predicate transformerMohammad-Javad Davari, Abbas Edalat, André Lieutier. 1-14 [doi]
• Probabilistic Relational Reasoning via MetricsArthur Azevedo de Amorim, Marco Gaboardi, Justin Hsu, Shin-ya Katsumata. 1-19 [doi]