<h2>LIPIcs, Volume 252, CSL 2023</h2>
<ul>
<li>
<span class="authors">Bartek Klin and Elaine Pimentel</span>
<span class="title">LIPIcs, Volume 252, CSL 2023, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2023">10.4230/LIPIcs.CSL.2023</a>
</li>
<li>
<span class="authors">Bartek Klin and Elaine Pimentel</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2023.0">10.4230/LIPIcs.CSL.2023.0</a>
</li>
<li>
<span class="authors">Claudia Faggian</span>
<span class="title">Asymptotic Rewriting (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2023.1">10.4230/LIPIcs.CSL.2023.1</a>
</li>
<li>
<span class="authors">Nina Gierasimczuk</span>
<span class="title">Inductive Inference and Epistemic Modal Logic (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2023.2">10.4230/LIPIcs.CSL.2023.2</a>
</li>
<li>
<span class="authors">Dale Miller and Jui-Hsuan Wu</span>
<span class="title">A Positive Perspective on Term Representation (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2023.3">10.4230/LIPIcs.CSL.2023.3</a>
</li>
<li>
<span class="authors">Davide Sangiorgi</span>
<span class="title">Enhanced Induction in Behavioural Relations (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2023.4">10.4230/LIPIcs.CSL.2023.4</a>
</li>
<li>
<span class="authors">Bahareh Afshari, Graham E. Leigh, and Guillermo Menéndez Turata</span>
<span class="title">A Cyclic Proof System for Full Computation Tree Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2023.5">10.4230/LIPIcs.CSL.2023.5</a>
</li>
<li>
<span class="authors">Mario Alvarez-Picallo, Dan Ghica, David Sprunger, and Fabio Zanasi</span>
<span class="title">Functorial String Diagrams for Reverse-Mode Automatic Differentiation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2023.6">10.4230/LIPIcs.CSL.2023.6</a>
</li>
<li>
<span class="authors">Paolo Baldan, Richard Eggert, Barbara König, and Tommaso Padoan</span>
<span class="title">A Lattice-Theoretical View of Strategy Iteration</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2023.7">10.4230/LIPIcs.CSL.2023.7</a>
</li>
<li>
<span class="authors">Pablo Barenbaum and Eduardo Bonelli</span>
<span class="title">Reductions in Higher-Order Rewriting and Their Equivalence</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2023.8">10.4230/LIPIcs.CSL.2023.8</a>
</li>
<li>
<span class="authors">Pablo Barenbaum and Teodoro Freund</span>
<span class="title">Proofs and Refutations for Intuitionistic and Second-Order Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2023.9">10.4230/LIPIcs.CSL.2023.9</a>
</li>
<li>
<span class="authors">Chris Barrett, Willem Heijltjes, and Guy McCusker</span>
<span class="title">The Functional Machine Calculus II: Semantics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2023.10">10.4230/LIPIcs.CSL.2023.10</a>
</li>
<li>
<span class="authors">Nikolay Bazhenov and Dariusz Kalociński</span>
<span class="title">Degree Spectra, and Relative Acceptability of Notations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2023.11">10.4230/LIPIcs.CSL.2023.11</a>
</li>
<li>
<span class="authors">Harsh Beohar, Sebastian Gurke, Barbara König, and Karla Messing</span>
<span class="title">Hennessy-Milner Theorems via Galois Connections</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2023.12">10.4230/LIPIcs.CSL.2023.12</a>
</li>
<li>
<span class="authors">Kostia Chardonnet, Alexis Saurin, and Benoît Valiron</span>
<span class="title">A Curry-Howard Correspondence for Linear, Reversible Computation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2023.13">10.4230/LIPIcs.CSL.2023.13</a>
</li>
<li>
<span class="authors">Corina Cîrstea and Clemens Kupke</span>
<span class="title">Measure-Theoretic Semantics for Quantitative Parity Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2023.14">10.4230/LIPIcs.CSL.2023.14</a>
</li>
<li>
<span class="authors">Liron Cohen and Vincent Rahli</span>
<span class="title">Realizing Continuity Using Stateful Computations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2023.15">10.4230/LIPIcs.CSL.2023.15</a>
</li>
<li>
<span class="authors">Gianluca Curzi and Anupam Das</span>
<span class="title">Non-Uniform Complexity via Non-Wellfounded Proofs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2023.16">10.4230/LIPIcs.CSL.2023.16</a>
</li>
<li>
<span class="authors">Ugo Dal Lago, Francesco Gavazzo, and Alexis Ghyselen</span>
<span class="title">Open Higher-Order Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2023.17">10.4230/LIPIcs.CSL.2023.17</a>
</li>
<li>
<span class="authors">Cédric de Lacroix and Luigi Santocanale</span>
<span class="title">Frobenius Structures in Star-Autonomous Categories</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2023.18">10.4230/LIPIcs.CSL.2023.18</a>
</li>
<li>
<span class="authors">Thiago Felicissimo, Frédéric Blanqui, and Ashish Kumar Barnawal</span>
<span class="title">Translating Proofs from an Impredicative Type System to a Predicative One</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2023.19">10.4230/LIPIcs.CSL.2023.19</a>
</li>
<li>
<span class="authors">Dana Fisman, Joshua Grogin, and Gera Weiss</span>
<span class="title">A Normalized Edit Distance on Infinite Words</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2023.20">10.4230/LIPIcs.CSL.2023.20</a>
</li>
<li>
<span class="authors">Yannick Forster and Felix Jahn</span>
<span class="title">Constructive and Synthetic Reducibility Degrees: Post’s Problem for Many-One and Truth-Table Reducibility in Coq</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2023.21">10.4230/LIPIcs.CSL.2023.21</a>
</li>
<li>
<span class="authors">Jonas Forster, Sergey Goncharov, Dirk Hofmann, Pedro Nora, Lutz Schröder, and Paul Wild</span>
<span class="title">Quantitative Hennessy-Milner Theorems via Notions of Density</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2023.22">10.4230/LIPIcs.CSL.2023.22</a>
</li>
<li>
<span class="authors">Julien Grange</span>
<span class="title">Order-Invariance in the Two-Variable Fragment of First-Order Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2023.23">10.4230/LIPIcs.CSL.2023.23</a>
</li>
<li>
<span class="authors">Emile Hazard and Denis Kuperberg</span>
<span class="title">Explorable Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2023.24">10.4230/LIPIcs.CSL.2023.24</a>
</li>
<li>
<span class="authors">Lauri Hella</span>
<span class="title">The Expressive Power of CSP-Quantifiers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2023.25">10.4230/LIPIcs.CSL.2023.25</a>
</li>
<li>
<span class="authors">Reijo Jaakkola</span>
<span class="title">Complexity of Polyadic Boolean Modal Logics: Model Checking and Satisfiability</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2023.26">10.4230/LIPIcs.CSL.2023.26</a>
</li>
<li>
<span class="authors">Reijo Jaakkola and Antti Kuusisto</span>
<span class="title">Complexity Classifications via Algebraic Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2023.27">10.4230/LIPIcs.CSL.2023.27</a>
</li>
<li>
<span class="authors">Bart Jacobs and Dario Stein</span>
<span class="title">Counting and Matching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2023.28">10.4230/LIPIcs.CSL.2023.28</a>
</li>
<li>
<span class="authors">Ahmet Kara, Milos Nikolic, Dan Olteanu, and Haozhe Zhang</span>
<span class="title">Evaluation Trade-Offs for Acyclic Conjunctive Queries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2023.29">10.4230/LIPIcs.CSL.2023.29</a>
</li>
<li>
<span class="authors">Dominik Kirst and Benjamin Peters</span>
<span class="title">Gödel’s Theorem Without Tears - Essential Incompleteness in Synthetic Computability</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2023.30">10.4230/LIPIcs.CSL.2023.30</a>
</li>
<li>
<span class="authors">Benedikt Pago</span>
<span class="title">Finite Model Theory and Proof Complexity Revisited: Distinguishing Graphs in Choiceless Polynomial Time and the Extended Polynomial Calculus</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2023.31">10.4230/LIPIcs.CSL.2023.31</a>
</li>
<li>
<span class="authors">Ian Pratt-Hartmann and Lidia Tendera</span>
<span class="title">Adding Transitivity and Counting to the Fluted Fragment</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2023.32">10.4230/LIPIcs.CSL.2023.32</a>
</li>
<li>
<span class="authors">Konrad Staniszewski</span>
<span class="title">Parity Games of Bounded Tree-Depth</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2023.33">10.4230/LIPIcs.CSL.2023.33</a>
</li>
<li>
<span class="authors">Hiromi Tanaka</span>
<span class="title">Tower-Complete Problems in Contraction-Free Substructural Logics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2023.34">10.4230/LIPIcs.CSL.2023.34</a>
</li>
<li>
<span class="authors">Felix Tschirbs, Nils Vortmeier, and Thomas Zeume</span>
<span class="title">Dynamic Complexity of Regular Languages: Big Changes, Small Work</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2023.35">10.4230/LIPIcs.CSL.2023.35</a>
</li>
<li>
<span class="authors">Renaud Vilmart</span>
<span class="title">Completeness of Sum-Over-Paths for Toffoli-Hadamard and the Dyadic Fragments of Quantum Computation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2023.36">10.4230/LIPIcs.CSL.2023.36</a>
</li>
<li>
<span class="authors">Paul Wilson, Dan Ghica, and Fabio Zanasi</span>
<span class="title">String Diagrams for Non-Strict Monoidal Categories</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2023.37">10.4230/LIPIcs.CSL.2023.37</a>
</li>
<li>
<span class="authors">Thorsten Wißmann</span>
<span class="title">Supported Sets - A New Foundation for Nominal Sets and Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2023.38">10.4230/LIPIcs.CSL.2023.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