Abstract is missing.
- Generalized Connectives for Multiplicative Linear LogicMatteo Acclavio, Roberto Maieli. [doi]
- Internal Parametricity for Cubical Type TheoryEvan Cavallo, Robert Harper. [doi]
- The Keys to Decidable HyperLTL Satisfiability: Small Models or Very Simple FormulasCorto Mascle, Martin Zimmermann 0002. [doi]
- Revisiting the Duality of Computation: An Algebraic Analysis of Classical Realizability ModelsÉtienne Miquey. [doi]
- Solving Word Equations (And Other Unification Problems) by Recompression (Invited Talk)Artur Jez. [doi]
- Strong Bisimulation for Control Operators (Invited Talk)Delia Kesner, Eduardo Bonelli, Andrés Viso. [doi]
- From Classical Proof Theory to P versus NP: a Guide to Bounded Theories (Invited Talk)Iddo Tzameret. [doi]
- Dynamic Complexity of Parity Exists QueriesNils Vortmeier, Thomas Zeume. [doi]
- Symmetric Computation (Invited Talk)Anuj Dawar. [doi]
- A Complete Axiomatisation of a Fragment of Language AlgebraPaul Brunet. [doi]
- Reverse Derivative CategoriesJ. Robin B. Cockett, Geoff S. H. Cruttwell, Jonathan Gallagher, Jean-Simon Pacaud Lemay, Benjamin MacAdam, Gordon D. Plotkin, Dorette Pronk. [doi]
- Verification of Security Protocols (Invited Talk)Véronique Cortier. [doi]
- Parity Games: Another View on Lehtinen's AlgorithmPawel Parys. [doi]
- On the Union Closed Fragment of Existential Second-Order Logic and Logics with Team SemanticsMatthias Hoelzel, Richard Wilke. [doi]
- De Jongh's Theorem for Intuitionistic Zermelo-Fraenkel Set TheoryRobert Paßmann. [doi]
- State Space Reduction For Parity AutomataChristof Löding, Andreas Tollkötter. [doi]
- On Free Completely Iterative AlgebrasJirí Adámek. [doi]
- The Call-By-Value Lambda-Calculus with Generalized ApplicationsJosé Espírito Santo. [doi]
- Taylor expansion for Call-By-Push-ValueJules Chouquet, Christine Tasson. [doi]
- Order-Invariant First-Order Logic over Hollow TreesJulien Grange, Luc Segoufin. [doi]
- Automatic Equivalence Structures of Polynomial GrowthMoses Ganardi, Bakhadyr Khoussainov. [doi]
- Expressive Logics for Coinductive PredicatesClemens Kupke, Jurriaan Rot. [doi]
- Guarded Teams: The Horizontally Guarded CaseErich Grädel, Martin Otto 0001. [doi]
- Separation and Renaming in Nominal SetsJoshua Moerman, Jurriaan Rot. [doi]
- Dynamic Complexity Meets Parameterised AlgorithmsJonas Schmidt, Thomas Schwentick, Nils Vortmeier, Thomas Zeume, Ioannis Kokkinis. [doi]
- Monitoring Event FrequenciesThomas Ferrère, Thomas A. Henzinger, Bernhard Kragl. [doi]
- Strongly Unambiguous Büchi Automata Are Polynomially Predictable With Membership QueriesDana Angluin, Timos Antonopoulos, Dana Fisman. [doi]
- Syntactic Interpolation for Tense Logics and Bi-Intuitionistic Logic via Nested SequentsTim Lyon, Alwen Tiu, Rajeev Goré, Ranald Clouston. [doi]
- Front Matter, Table of Contents, Preface, Conference Organization [doi]
- FO-Definability of Shrub-DepthYijia Chen, Jörg Flum. [doi]
- Tangent Categories from the Coalgebras of Differential CategoriesJ. Robin B. Cockett, Jean-Simon Pacaud Lemay, Rory B. B. Lucyshyn-Wright. [doi]
- Unifying Cubical Models of Univalent Type TheoryEvan Cavallo, Anders Mörtberg, Andrew W. Swan. [doi]
- Internal Calculi for Separation LogicsStéphane Demri, Étienne Lozes, Alessio Mansutti. [doi]
- Glueability of Resource Proof-Structures: Inverting the Taylor ExpansionGiulio Guerrieri, Luc Pellissier, Lorenzo Tortora de Falco. [doi]
- Coverage and Vacuity in Network Formation GamesGili Bielous, Orna Kupferman. [doi]
- Proof Complexity of Systems of (Non-Deterministic) Decision Trees and Branching ProgramsSam Buss, Anupam Das 0002, Alexander Knop. [doi]
- A Robust Class of Linear Recurrence SequencesCorentin Barloy, Nathanaël Fijalkow, Nathan Lhote, Filip Mazowiecki. [doi]
- Computing Haar MeasuresArno Pauly, Dongseong Seon, Martin Ziegler 0001. [doi]