Table of Contents

• When Reachability Meets GrzegorczykJérôme Leroux. 1-6 [doi]
• A tale of intersection typesViviana Bono, Mariangiola Dezani-Ciancaglini. 7-20 [doi]
• Automatic Structures: Twenty Years LaterErich Grädel. 21-34 [doi]
• Contextual Types, Explained: Invited TutorialBrigitte Pientka. 35-37 [doi]
• Logic Beyond Formulas: A Proof System on GraphsMatteo Acclavio, Ross Horne, Lutz Straßburger. 38-52 [doi]
• A Higher Structure Identity PrincipleBenedikt Ahrens, Paige Randall North, Michael Shulman, Dimitris Tsementzis. 53-66 [doi]
• The Integers as a Higher Inductive TypeThorsten Altenkirch, Luis Scoccola. 67-73 [doi]
• Space-efficient Query Evaluation over Probabilistic Event StreamsRajeev Alur, Yu Chen, Kishor Jothimurugan, Sanjeev Khanna. 74-87 [doi]
• Algebraic models of simple type theories: A polynomial approachNathanael Arkor, Marcelo Fiore. 88-101 [doi]
• Approximating Values of Generalized-Reachability Stochastic GamesPranav Ashok, Krishnendu Chatterjee, Jan Kretínský, Maximilian Weininger, Tobias Winkler. 102-115 [doi]
• Reconciling noninterference and gradual typingArthur Azevedo de Amorim, Matt Fredrikson, Limin Jia. 116-129 [doi]
• Complexity of controlled bad sequences over finite sets of NdA. R. Balasubramanian. 130-140 [doi]
• Deciding Differential Privacy for Programs with Finite Inputs and OutputsGilles Barthe, Rohit Chadha, Vishal Jagannath, A. Prasad Sistla, Mahesh Viswanathan 0001. 141-154 [doi]
• Universal equivalence and majority of probabilistic programs over finite fieldsGilles Barthe, Charlie Jacomme, Steve Kremer. 155-166 [doi]
• Modal Logics with Composition on Finite Forests: Expressivity and ComplexityBartosz Bednarczyk, Stéphane Demri, Raul Fervari, Alessio Mansutti. 167-180 [doi]
• A Hennessy-Milner Theorem for ATL with Imperfect InformationFrancesco Belardinelli, Catalin Dima, Vadim Malvone, Ferucio Laurentiu Tiplea. 181-194 [doi]
• Mixing Probabilistic and non-Probabilistic Objectives in Markov Decision ProcessesRaphaël Berthon, Shibashis Guha, Jean-François Raskin. 195-208 [doi]
• Hardness Characterisations and Size-Width Lower Bounds for QBF ResolutionOlaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan. 209-223 [doi]
• The Complexity of Reachability in Affine Vector Addition Systems with StatesMichael Blondin, Mikhail A. Raskin. 224-236 [doi]
• Temporal Constraint Satisfaction Problems in Fixed-Point LogicManuel Bodirsky, Wied Pakusa, Jakub Rydval. 237-251 [doi]
• First-order tree-to-tree functionsMikolaj Bojanczyk, Amina Doumane. 252-265 [doi]
• Extensions of ω-Regular LanguagesMikolaj Bojanczyk, Edon Kelmendi, Rafal Stefanski, Georg Zetzsche. 266-272 [doi]
• A Cellular Howe TheoremPeio Borthelle, Tom Hirschowitz, Ambroise Lafont. 273-286 [doi]
• On the Weisfeiler-Leman Dimension of Finite GroupsJendrik Brachter, Pascal Schweitzer. 287-300 [doi]
• A Fixed Point Theorem on Lexicographic Lattice StructuresAngelos Charalambidis, Giannos Chatziagapis, Panos Rondogiannis. 301-311 [doi]
• Re-pairing bracketsDmitry Chistikov, Mikhail Vyalyi. 312-326 [doi]
• The Benefit of Being Non-Lazy in Probabilistic λ-calculus: Applicative Bisimulation is Fully Abstract for Non-Lazy Probabilistic Call-by-NameGianluca Curzi, Michele Pagani. 327-340 [doi]
• An Approach to Regular Separability in Vector Addition SystemsWojciech Czerwinski, Georg Zetzsche. 341-354 [doi]
• Modal Intuitionistic Logics as Dialgebraic LogicsJim de Groot, Dirk Pattinson. 355-369 [doi]
• Cones as a model of intuitionistic linear logicThomas Ehrhard. 370-383 [doi]
• Uniformisations of Regular Relations Over Bi-Infinite WordsGrzegorz Fabianski, Michal Skrzypczak, Szymon Torunczyk. 384-396 [doi]
• One-Clock Priced Timed Games are PSPACE-hardJohn Fearnley, Rasmus Ibsen-Jensen, Rahul Savani. 397-409 [doi]
• Lower Bounds for QBFs of Bounded TreewidthJohannes Klaus Fichte, Markus Hecher, Andreas Pfandler. 410-424 [doi]
• Coherence and normalisation-by-evaluation for bicategorical cartesian closed structureMarcelo Fiore, Philip Saville. 425-439 [doi]
• Linear Dependent Type Theory for Quantum Programming Languages: Extended AbstractPeng Fu, Kohei Kishida, Peter Selinger. 440-453 [doi]
• Combining probabilistic and non-deterministic choice via weak distributive lawsAlexandre Goy 0003, Daniela Petrisan. 454-464 [doi]
• A Complete Proof System for 1-Free Regular Expressions Modulo BisimilarityClemens Grabmayer, Wan J. Fokkink. 465-478 [doi]
• Successor-Invariant First-Order Logic on Classes of Bounded DegreeJulien Grange. 479-491 [doi]
• Multimodal Dependent Type TheoryDaniel Gratzer, G. A. Kavvos, Andreas Nuyts, Lars Birkedal. 492-506 [doi]
• Counting Bounded Tree Depth HomomorphismsMartin Grohe. 507-520 [doi]
• Bisimulation Finiteness of Pushdown Systems Is ElementaryStefan Göller, Pawel Parys. 521-534 [doi]
• A tier-based typed programming language characterizing Feasible FunctionalsEmmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux. 535-549 [doi]
• Descriptive complexity of real computation and probabilistic independence logicMiika Hannula, Juha Kontinen, Jan Van den Bussche, Jonni Virtema. 550-563 [doi]
• A calculus of expandable stores: Continuation-and-environment-passing style translationsHugo Herbelin, Étienne Miquey. 564-577 [doi]
• Intermediate problems in modular circuits satisfiabilityPawel M. Idziak, Piotr Kawalek, Jacek Krzaczkowski. 578-590 [doi]
• The Surprising Power of Constant Depth Algebraic ProofsRussell Impagliazzo, Sasank Mouli, Toniann Pitassi. 591-603 [doi]
• Interaction Laws of Monads and ComonadsShin-ya Katsumata, Exequiel Rivas, Tarmo Uustalu. 604-618 [doi]
• Consuming and Persistent Types for Classical LogicDelia Kesner, Pierre Vial. 619-632 [doi]
• Refinement-Based Game Semantics for Certified Abstraction LayersJérémie Koenig, Zhong Shao. 633-647 [doi]
• Large and Infinitary Quotient Inductive-Inductive TypesAndrás Kovács, Ambrus Kaposi. 648-661 [doi]
• Coherence via Well-Foundedness: Taming Set-Quotients in Homotopy Type TheoryNicolai Kraus, Jakob von Raumer. 662-675 [doi]
• Efficient Analysis of VASS Termination ComplexityAntonín Kucera 0001, Jérôme Leroux, Dominik Velan. 676-688 [doi]
• Good-for-games ω-Pushdown AutomataKaroliina Lehtinen, Martin Zimmermann 0002. 689-702 [doi]
• Pebble Minimization of Polyregular FunctionsNathan Lhote. 703-712 [doi]
• The Complexity of Dynamic Data Race PredictionUmang Mathur 0001, Andreas Pavlogiannis, Mahesh Viswanathan 0001. 713-727 [doi]
• Sparse Hashing for Scalable Approximate Model Counting: Theory and PracticeKuldeep S. Meel, S. Akshay. 728-741 [doi]
• Concurrent Separation Logic Meets Template GamesPaul-André Melliès, Léo Stefanesco. 742-755 [doi]
• The Hidden Subgroup Problem for Universal AlgebrasMatthew Moore, Taylor Walenczyk. 756-767 [doi]
• On the computational content of Zorn's lemmaThomas Powell 0001. 768-781 [doi]
• Russian Constructivism in a Prefascist TheoryPierre-Marie Pédrot. 782-794 [doi]
• Extended Kripke lemma and decidability for hypersequent substructural logicsRevantha Ramanayake. 795-806 [doi]
• Partial Univalence in n-truncated Type TheoryChristian Sattler, Andrea Vezzosi. 807-819 [doi]
• Resolving finite indeterminacy: A definitive constructive universal prime ideal theoremPeter Schuster 0001, Daniel Wessel. 820-830 [doi]
• An Efficient Normalisation Procedure for Linear Temporal Logic and Very Weak Alternating AutomataSalomon Sickert, Javier Esparza. 831-844 [doi]
• Sequential Colimits in Homotopy Type TheoryKristina Sojakova, Floris van Doorn, Egbert Rijke. 845-858 [doi]
• Making Streett Determinization TightCong Tian, Wensheng Wang, Zhenhua Duan. 859-872 [doi]
• Register Automata with Extrema Constraints, and an Application to Two-Variable LogicSzymon Torunczyk, Thomas Zeume. 873-885 [doi]
• On Computability of Logical Approaches to Branching-Time Property Verification of ProgramsTakeshi Tsukada. 886-899 [doi]
• Automata Learning: An Algebraic ApproachHenning Urbat, Lutz Schröder. 900-914 [doi]
• A Constructive Model of Directed Univalence in Bicubical SetsMatthew Z. Weaver, Daniel R. Licata. 915-928 [doi]
• Constructing Higher Inductive Types as Groupoid QuotientsNiels van der Weide. 929-943 [doi]
• A characterisation of ordered abstract probabilitiesAbraham Westerbaan, Bas Westerbaan, John van de Wetering. 944-957 [doi]
• On The Relational Width of First-Order Expansions of Finitely Bounded Homogeneous Binary Cores with Bounded Strict WidthMichal Wrona. 958-971 [doi]