<h2>LIPIcs, Volume 183, CSL 2021</h2>
<ul>
<li>
<span class="authors">Christel Baier and Jean Goubault-Larrecq</span>
<span class="title">LIPIcs, Volume 183, CSL 2021, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2021">10.4230/LIPIcs.CSL.2021</a>
</li>
<li>
<span class="authors">Christel Baier and Jean Goubault-Larrecq</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2021.0">10.4230/LIPIcs.CSL.2021.0</a>
</li>
<li>
<span class="authors">Bartek Klin</span>
<span class="title">μ-Calculi with Atoms (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2021.1">10.4230/LIPIcs.CSL.2021.1</a>
</li>
<li>
<span class="authors">Assia Mahboubi</span>
<span class="title">Mathematical Structures in Dependent Type Theory (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2021.2">10.4230/LIPIcs.CSL.2021.2</a>
</li>
<li>
<span class="authors">Sylvain Schmitz</span>
<span class="title">Branching in Well-Structured Transition Systems (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2021.3">10.4230/LIPIcs.CSL.2021.3</a>
</li>
<li>
<span class="authors">Linda Westrick</span>
<span class="title">Borel Sets in Reverse Mathematics (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2021.4">10.4230/LIPIcs.CSL.2021.4</a>
</li>
<li>
<span class="authors">Samson Abramsky and Rui Soares Barbosa</span>
<span class="title">The Logic of Contextuality</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2021.5">10.4230/LIPIcs.CSL.2021.5</a>
</li>
<li>
<span class="authors">Beniamino Accattoli, Claudia Faggian, and Giulio Guerrieri</span>
<span class="title">Factorize Factorization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2021.6">10.4230/LIPIcs.CSL.2021.6</a>
</li>
<li>
<span class="authors">Luca Aceto, Antonis Achilleos, Adrian Francalanza, Anna Ingólfsdóttir, and Karoliina Lehtinen</span>
<span class="title">The Best a Monitor Can Do</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2021.7">10.4230/LIPIcs.CSL.2021.7</a>
</li>
<li>
<span class="authors">Luca Aceto, Valentina Castiglioni, Wan Fokkink, Anna Ingólfsdóttir, and Bas Luttik</span>
<span class="title">Are Two Binary Operators Necessary to Finitely Axiomatise Parallel Composition?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2021.8">10.4230/LIPIcs.CSL.2021.8</a>
</li>
<li>
<span class="authors">André Arnold, Damian Niwiński, and Paweł Parys</span>
<span class="title">A Quasi-Polynomial Black-Box Algorithm for Fixed Point Evaluation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2021.9">10.4230/LIPIcs.CSL.2021.9</a>
</li>
<li>
<span class="authors">Steffen van Bergerem and Nicole Schweikardt</span>
<span class="title">Learning Concepts Described By Weight Aggregation Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2021.10">10.4230/LIPIcs.CSL.2021.10</a>
</li>
<li>
<span class="authors">Mark Bickford, Liron Cohen, Robert L. Constable, and Vincent Rahli</span>
<span class="title">Open Bar - a Brouwerian Intuitionistic Logic with a Pinch of Excluded Middle</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2021.11">10.4230/LIPIcs.CSL.2021.11</a>
</li>
<li>
<span class="authors">Udi Boker and Guy Hefetz</span>
<span class="title">Discounted-Sum Automata with Multiple Discount Factors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2021.12">10.4230/LIPIcs.CSL.2021.12</a>
</li>
<li>
<span class="authors">Benedikt Bollig, Fedor Ryabinin, and Arnaud Sangnier</span>
<span class="title">Reachability in Distributed Memory Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2021.13">10.4230/LIPIcs.CSL.2021.13</a>
</li>
<li>
<span class="authors">Sabine Broda</span>
<span class="title">Pregrammars and Intersection Types</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2021.14">10.4230/LIPIcs.CSL.2021.14</a>
</li>
<li>
<span class="authors">Thomas Colcombet, Daniela Petrişan, and Riccardo Stabile</span>
<span class="title">Learning Automata and Transducers: A Categorical Approach</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2021.15">10.4230/LIPIcs.CSL.2021.15</a>
</li>
<li>
<span class="authors">Adam Ó Conghaile and Anuj Dawar</span>
<span class="title">Game Comonads & Generalised Quantifiers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2021.16">10.4230/LIPIcs.CSL.2021.16</a>
</li>
<li>
<span class="authors">Katrin M. Dannert, Erich Grädel, Matthias Naaf, and Val Tannen</span>
<span class="title">Semiring Provenance for Fixed-Point Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2021.17">10.4230/LIPIcs.CSL.2021.17</a>
</li>
<li>
<span class="authors">Anuj Dawar and Abhisekh Sankaran</span>
<span class="title">Extension Preservation in the Finite and Prefix Classes of First Order Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2021.18">10.4230/LIPIcs.CSL.2021.18</a>
</li>
<li>
<span class="authors">Bruno Dinis and Étienne Miquey</span>
<span class="title">Realizability with Stateful Computations for Nonstandard Analysis</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2021.19">10.4230/LIPIcs.CSL.2021.19</a>
</li>
<li>
<span class="authors">Mnacho Echenim, Radu Iosif, and Nicolas Peltier</span>
<span class="title">Decidable Entailments in Separation Logic with Inductive Definitions: Beyond Establishment</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2021.20">10.4230/LIPIcs.CSL.2021.20</a>
</li>
<li>
<span class="authors">Yannick Forster</span>
<span class="title">Church’s Thesis and Related Axioms in Coq’s Type Theory</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2021.21">10.4230/LIPIcs.CSL.2021.21</a>
</li>
<li>
<span class="authors">Christine Gaßner, Arno Pauly, and Florian Steinberg</span>
<span class="title">Computing Measure as a Primitive Operation in Real Number Computation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2021.22">10.4230/LIPIcs.CSL.2021.22</a>
</li>
<li>
<span class="authors">Guillaume Geoffroy and Paolo Pistone</span>
<span class="title">A Partial Metric Semantics of Higher-Order Types and Approximate Program Transformations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2021.23">10.4230/LIPIcs.CSL.2021.23</a>
</li>
<li>
<span class="authors">Giulio Guerrieri, Willem B. Heijltjes, and Joseph W.N. Paulus</span>
<span class="title">A Deep Quantitative Type System</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2021.24">10.4230/LIPIcs.CSL.2021.24</a>
</li>
<li>
<span class="authors">Giulio Guerrieri and Federico Olimpieri</span>
<span class="title">Categorifying Non-Idempotent Intersection Types</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2021.25">10.4230/LIPIcs.CSL.2021.25</a>
</li>
<li>
<span class="authors">Merlin Göttlinger, Lutz Schröder, and Dirk Pattinson</span>
<span class="title">The Alternating-Time μ-Calculus with Disjunctive Explicit Strategies</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2021.26">10.4230/LIPIcs.CSL.2021.26</a>
</li>
<li>
<span class="authors">Miika Hannula, Juha Kontinen, Martin Lück, and Jonni Virtema</span>
<span class="title">On the Complexity of Horn and Krom Fragments of Second-Order Boolean Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2021.27">10.4230/LIPIcs.CSL.2021.27</a>
</li>
<li>
<span class="authors">Tom de Jong and Martín Hötzel Escardó</span>
<span class="title">Domain Theory in Constructive and Predicative Univalent Foundations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2021.28">10.4230/LIPIcs.CSL.2021.28</a>
</li>
<li>
<span class="authors">Mayuko Kori, Takeshi Tsukada, and Naoki Kobayashi</span>
<span class="title">A Cyclic Proof System for HFL_ℕ</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2021.29">10.4230/LIPIcs.CSL.2021.29</a>
</li>
<li>
<span class="authors">Elena Di Lavore, Jules Hedges, and Paweł Sobociński</span>
<span class="title">Compositional Modelling of Network Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2021.30">10.4230/LIPIcs.CSL.2021.30</a>
</li>
<li>
<span class="authors">Moritz Lichter and Pascal Schweitzer</span>
<span class="title">Canonization for Bounded and Dihedral Color Classes in Choiceless Polynomial Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2021.31">10.4230/LIPIcs.CSL.2021.31</a>
</li>
<li>
<span class="authors">Aliaume Lopez</span>
<span class="title">Preservation Theorems Through the Lens of Topology</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2021.32">10.4230/LIPIcs.CSL.2021.32</a>
</li>
<li>
<span class="authors">Benedikt Pago</span>
<span class="title">Choiceless Computation and Symmetry: Limitations of Definability</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2021.33">10.4230/LIPIcs.CSL.2021.33</a>
</li>
<li>
<span class="authors">Long Pham and Jan Hoffmann</span>
<span class="title">Typable Fragments of Polynomial Automatic Amortized Resource Analysis</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2021.34">10.4230/LIPIcs.CSL.2021.34</a>
</li>
<li>
<span class="authors">Paolo Pistone and Luca Tranchini</span>
<span class="title">The Yoneda Reduction of Polymorphic Types</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2021.35">10.4230/LIPIcs.CSL.2021.35</a>
</li>
<li>
<span class="authors">Alexander Rabinovich and Doron Tiferet</span>
<span class="title">Degrees of Ambiguity for Parity Tree Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2021.36">10.4230/LIPIcs.CSL.2021.36</a>
</li>
<li>
<span class="authors">Philippe Schnoebelen</span>
<span class="title">On Flat Lossy Channel Machines</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2021.37">10.4230/LIPIcs.CSL.2021.37</a>
</li>
<li>
<span class="authors">Haruka Tomita</span>
<span class="title">Realizability Without Symmetry</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2021.38">10.4230/LIPIcs.CSL.2021.38</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