LIPIcs, Volume 152, CSL 2020

Maribel Fernández and Anca Muscholl LIPIcs, Volume 152, CSL'20, Complete Volume 10.4230/LIPIcs.CSL.2020
Maribel Fernández and Anca Muscholl Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.CSL.2020.0
Véronique Cortier Verification of Security Protocols (Invited Talk) 10.4230/LIPIcs.CSL.2020.1
Anuj Dawar Symmetric Computation (Invited Talk) 10.4230/LIPIcs.CSL.2020.2
Artur Jeż Solving Word Equations (And Other Unification Problems) by Recompression (Invited Talk) 10.4230/LIPIcs.CSL.2020.3
Delia Kesner, Eduardo Bonelli, and Andrés Viso Strong Bisimulation for Control Operators (Invited Talk) 10.4230/LIPIcs.CSL.2020.4
Iddo Tzameret From Classical Proof Theory to P versus NP: a Guide to Bounded Theories (Invited Talk) 10.4230/LIPIcs.CSL.2020.5
Matteo Acclavio and Roberto Maieli Generalized Connectives for Multiplicative Linear Logic 10.4230/LIPIcs.CSL.2020.6
Jiří Adámek On Free Completely Iterative Algebras 10.4230/LIPIcs.CSL.2020.7
Dana Angluin, Timos Antonopoulos, and Dana Fisman Strongly Unambiguous Büchi Automata Are Polynomially Predictable With Membership Queries 10.4230/LIPIcs.CSL.2020.8
Corentin Barloy, Nathanaël Fijalkow, Nathan Lhote, and Filip Mazowiecki A Robust Class of Linear Recurrence Sequences 10.4230/LIPIcs.CSL.2020.9
Gili Bielous and Orna Kupferman Coverage and Vacuity in Network Formation Games 10.4230/LIPIcs.CSL.2020.10
Paul Brunet A Complete Axiomatisation of a Fragment of Language Algebra 10.4230/LIPIcs.CSL.2020.11
Sam Buss, Anupam Das, and Alexander Knop Proof Complexity of Systems of (Non-Deterministic) Decision Trees and Branching Programs 10.4230/LIPIcs.CSL.2020.12
Evan Cavallo and Robert Harper Internal Parametricity for Cubical Type Theory 10.4230/LIPIcs.CSL.2020.13
Evan Cavallo, Anders Mörtberg, and Andrew W Swan Unifying Cubical Models of Univalent Type Theory 10.4230/LIPIcs.CSL.2020.14
Yijia Chen and Jörg Flum FO-Definability of Shrub-Depth 10.4230/LIPIcs.CSL.2020.15
Jules Chouquet and Christine Tasson Taylor expansion for Call-By-Push-Value 10.4230/LIPIcs.CSL.2020.16
Robin Cockett, Jean-Simon Pacaud Lemay, and Rory B. B. Lucyshyn-Wright Tangent Categories from the Coalgebras of Differential Categories 10.4230/LIPIcs.CSL.2020.17
Robin Cockett, Geoffrey Cruttwell, Jonathan Gallagher, Jean-Simon Pacaud Lemay, Benjamin MacAdam, Gordon Plotkin, and Dorette Pronk Reverse Derivative Categories 10.4230/LIPIcs.CSL.2020.18
Stéphane Demri, Etienne Lozes, and Alessio Mansutti Internal Calculi for Separation Logics 10.4230/LIPIcs.CSL.2020.19
Thomas Ferrère, Thomas A. Henzinger, and Bernhard Kragl Monitoring Event Frequencies 10.4230/LIPIcs.CSL.2020.20
Moses Ganardi and Bakhadyr Khoussainov Automatic Equivalence Structures of Polynomial Growth 10.4230/LIPIcs.CSL.2020.21
Erich Grädel and Martin Otto Guarded Teams: The Horizontally Guarded Case 10.4230/LIPIcs.CSL.2020.22
Julien Grange and Luc Segoufin Order-Invariant First-Order Logic over Hollow Trees 10.4230/LIPIcs.CSL.2020.23
Giulio Guerrieri, Luc Pellissier, and Lorenzo Tortora de Falco Glueability of Resource Proof-Structures: Inverting the Taylor Expansion 10.4230/LIPIcs.CSL.2020.24
Matthias Hoelzel and Richard Wilke On the Union Closed Fragment of Existential Second-Order Logic and Logics with Team Semantics 10.4230/LIPIcs.CSL.2020.25
Clemens Kupke and Jurriaan Rot Expressive Logics for Coinductive Predicates 10.4230/LIPIcs.CSL.2020.26
Christof Löding and Andreas Tollkötter State Space Reduction For Parity Automata 10.4230/LIPIcs.CSL.2020.27
Tim Lyon, Alwen Tiu, Rajeev Goré, and Ranald Clouston Syntactic Interpolation for Tense Logics and Bi-Intuitionistic Logic via Nested Sequents 10.4230/LIPIcs.CSL.2020.28
Corto Mascle and Martin Zimmermann The Keys to Decidable HyperLTL Satisfiability: Small Models or Very Simple Formulas 10.4230/LIPIcs.CSL.2020.29
Étienne Miquey Revisiting the Duality of Computation: An Algebraic Analysis of Classical Realizability Models 10.4230/LIPIcs.CSL.2020.30
Joshua Moerman and Jurriaan Rot Separation and Renaming in Nominal Sets 10.4230/LIPIcs.CSL.2020.31
Paweł Parys Parity Games: Another View on Lehtinen’s Algorithm 10.4230/LIPIcs.CSL.2020.32
Robert Passmann De Jongh’s Theorem for Intuitionistic Zermelo-Fraenkel Set Theory 10.4230/LIPIcs.CSL.2020.33
Arno Pauly, Dongseong Seon, and Martin Ziegler Computing Haar Measures 10.4230/LIPIcs.CSL.2020.34
José Espírito Santo The Call-By-Value Lambda-Calculus with Generalized Applications 10.4230/LIPIcs.CSL.2020.35
Jonas Schmidt, Thomas Schwentick, Nils Vortmeier, Thomas Zeume, and Ioannis Kokkinis Dynamic Complexity Meets Parameterised Algorithms 10.4230/LIPIcs.CSL.2020.36
Nils Vortmeier and Thomas Zeume Dynamic Complexity of Parity Exists Queries 10.4230/LIPIcs.CSL.2020.37