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