<h2>LIPIcs, Volume 119, CSL 2018</h2>
<ul>
<li>
<span class="authors">Dan Ghica and Achim Jung</span>
<span class="title">LIPIcs, Volume 119, CSL'18, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2018">10.4230/LIPIcs.CSL.2018</a>
</li>
<li>
<span class="authors">Dan R. Ghica and Achim Jung</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2018.0">10.4230/LIPIcs.CSL.2018.0</a>
</li>
<li>
<span class="authors">Dexter Kozen and Thomas Schwentick</span>
<span class="title">The Ackermann Award 2018</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2018.1">10.4230/LIPIcs.CSL.2018.1</a>
</li>
<li>
<span class="authors">Samson Abramsky and Nihil Shah</span>
<span class="title">Relating Structure and Power: Comonadic Semantics for Computational Resources</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2018.2">10.4230/LIPIcs.CSL.2018.2</a>
</li>
<li>
<span class="authors">Faried Abu Zaid, Dietrich Kuske, and Peter Lindner</span>
<span class="title">Climbing up the Elementary Complexity Classes with Theories of Automatic Structures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2018.3">10.4230/LIPIcs.CSL.2018.3</a>
</li>
<li>
<span class="authors">Benedikt Ahrens, André Hirschowitz, Ambroise Lafont, and Marco Maggesi</span>
<span class="title">High-Level Signatures and Initial Semantics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2018.4">10.4230/LIPIcs.CSL.2018.4</a>
</li>
<li>
<span class="authors">Aurore Alcolei, Pierre Clairambault, Martin Hyland, and Glynn Winskel</span>
<span class="title">The True Concurrency of Herbrand's Theorem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2018.5">10.4230/LIPIcs.CSL.2018.5</a>
</li>
<li>
<span class="authors">Carlo Angiuli, Kuen-Bang Hou (Favonia), and Robert Harper</span>
<span class="title">Cartesian Cubical Computational Type Theory: Constructive Reasoning with Paths and Equalities</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2018.6">10.4230/LIPIcs.CSL.2018.6</a>
</li>
<li>
<span class="authors">Albert Atserias and Anuj Dawar</span>
<span class="title">Definable Inapproximability: New Challenges for Duplicator</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2018.7">10.4230/LIPIcs.CSL.2018.7</a>
</li>
<li>
<span class="authors">Arnon Avron, Shahar Lev, and Nissan Levi</span>
<span class="title">Safety, Absoluteness, and Computability</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2018.8">10.4230/LIPIcs.CSL.2018.8</a>
</li>
<li>
<span class="authors">Patrick Baillot and Alexis Ghyselen</span>
<span class="title">Combining Linear Logic and Size Types for Implicit Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2018.9">10.4230/LIPIcs.CSL.2018.9</a>
</li>
<li>
<span class="authors">Nicolas Basset, Ismaël Jecker, Arno Pauly, Jean-François Raskin, and Marie Van den Bogaard</span>
<span class="title">Beyond Admissibility: Dominance Between Chains of Strategies</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2018.10">10.4230/LIPIcs.CSL.2018.10</a>
</li>
<li>
<span class="authors">Nicolas Behr and Pawel Sobocinski</span>
<span class="title">Rule Algebras for Adhesive Categories</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2018.11">10.4230/LIPIcs.CSL.2018.11</a>
</li>
<li>
<span class="authors">Manuel Bodirsky, Marcello Mamino, and Caterina Viola</span>
<span class="title">Submodular Functions and Valued Constraint Satisfaction Problems over Infinite Domains</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2018.12">10.4230/LIPIcs.CSL.2018.12</a>
</li>
<li>
<span class="authors">Filippo Bonchi, Jens Seeber, and Pawel Sobocinski</span>
<span class="title">Graphical Conjunctive Queries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2018.13">10.4230/LIPIcs.CSL.2018.13</a>
</li>
<li>
<span class="authors">Rohit Chadha, A. Prasad Sistla, and Mahesh Viswanathan</span>
<span class="title">Approximating Probabilistic Automata by Regular Languages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2018.14">10.4230/LIPIcs.CSL.2018.14</a>
</li>
<li>
<span class="authors">Jules Chouquet and Lionel Vaux Auclair</span>
<span class="title">An Application of Parallel Cut Elimination in Unit-Free Multiplicative Linear Logic to the Taylor Expansion of Proof Nets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2018.15">10.4230/LIPIcs.CSL.2018.15</a>
</li>
<li>
<span class="authors">Pierre Clairambault and Hugo Paquet</span>
<span class="title">Fully Abstract Models of the Probabilistic lambda-calculus</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2018.16">10.4230/LIPIcs.CSL.2018.16</a>
</li>
<li>
<span class="authors">Liron Cohen and Reuben N. S. Rowe</span>
<span class="title">Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2018.17">10.4230/LIPIcs.CSL.2018.17</a>
</li>
<li>
<span class="authors">Anupam Das and Isabel Oitavem</span>
<span class="title">A Recursion-Theoretic Characterisation of the Positive Polynomial-Time Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2018.18">10.4230/LIPIcs.CSL.2018.18</a>
</li>
<li>
<span class="authors">Anupam Das and Damien Pous</span>
<span class="title">Non-Wellfounded Proof Theory For (Kleene+Action)(Algebras+Lattices)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2018.19">10.4230/LIPIcs.CSL.2018.19</a>
</li>
<li>
<span class="authors">Anuj Dawar and Gregory Wilsenach</span>
<span class="title">Symmetric Circuits for Rank Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2018.20">10.4230/LIPIcs.CSL.2018.20</a>
</li>
<li>
<span class="authors">Paul Downen and Zena M. Ariola</span>
<span class="title">Beyond Polarity: Towards a Multi-Discipline Intermediate Language with Sharing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2018.21">10.4230/LIPIcs.CSL.2018.21</a>
</li>
<li>
<span class="authors">Flavio Ferrarotti, Jan Van den Bussche, and Jonni Virtema</span>
<span class="title">Expressivity Within Second-Order Transitive-Closure Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2018.22">10.4230/LIPIcs.CSL.2018.22</a>
</li>
<li>
<span class="authors">Nathanaël Fijalkow, Bastien Maubert, Aniello Murano, and Sasha Rubin</span>
<span class="title">Quantifying Bounds in Strategy Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2018.23">10.4230/LIPIcs.CSL.2018.23</a>
</li>
<li>
<span class="authors">W. John Gowers and James D. Laird</span>
<span class="title">A Fully Abstract Game Semantics for Countable Nondeterminism</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2018.24">10.4230/LIPIcs.CSL.2018.24</a>
</li>
<li>
<span class="authors">Erich Grädel and Matthias Hoelzel</span>
<span class="title">Dependency Concepts up to Equivalence</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2018.25">10.4230/LIPIcs.CSL.2018.25</a>
</li>
<li>
<span class="authors">Béatrice Bérard, Patricia Bouyer, and Vincent Jugé</span>
<span class="title">Finite Bisimulations for Dynamical Systems with Overlapping Trajectories</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2018.26">10.4230/LIPIcs.CSL.2018.26</a>
</li>
<li>
<span class="authors">Toru Kawata</span>
<span class="title">A Contextual Reconstruction of Monadic Reflection</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2018.27">10.4230/LIPIcs.CSL.2018.27</a>
</li>
<li>
<span class="authors">Andreas Krebs, Kamal Lodaya, Paritosh K. Pandya, and Howard Straubing</span>
<span class="title">An Algebraic Decision Procedure for Two-Variable Logic with a Between Relation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2018.28">10.4230/LIPIcs.CSL.2018.28</a>
</li>
<li>
<span class="authors">Aliaume Lopez and Alex Simpson</span>
<span class="title">Basic Operational Preorders for Algebraic Effects in General, and for Combined Probability and Nondeterminism in Particular</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2018.29">10.4230/LIPIcs.CSL.2018.29</a>
</li>
<li>
<span class="authors">Martin Lück</span>
<span class="title">Canonical Models and the Complexity of Modal Team Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2018.30">10.4230/LIPIcs.CSL.2018.30</a>
</li>
<li>
<span class="authors">P. Madhusudan, Umang Mathur, Shambwaditya Saha, and Mahesh Viswanathan</span>
<span class="title">A Decidable Fragment of Second Order Logic With Applications to Synthesis</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2018.31">10.4230/LIPIcs.CSL.2018.31</a>
</li>
<li>
<span class="authors">Dan Marsden and Maaike Zwart</span>
<span class="title">Quantitative Foundations for Resource Theories</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2018.32">10.4230/LIPIcs.CSL.2018.32</a>
</li>
<li>
<span class="authors">Guy McCusker and Alessio Santamaria</span>
<span class="title">On Compositionality of Dinatural Transformations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2018.33">10.4230/LIPIcs.CSL.2018.33</a>
</li>
<li>
<span class="authors">Daniel Neider, Alexander Weinert, and Martin Zimmermann</span>
<span class="title">Synthesizing Optimally Resilient Controllers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2018.34">10.4230/LIPIcs.CSL.2018.34</a>
</li>
<li>
<span class="authors">Rémi Nollet, Alexis Saurin, and Christine Tasson</span>
<span class="title">Local Validity for Circular Proofs in Linear Logic with Fixed Points</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2018.35">10.4230/LIPIcs.CSL.2018.35</a>
</li>
<li>
<span class="authors">Sven Schewe, Alexander Weinert, and Martin Zimmermann</span>
<span class="title">Parity Games with Weights</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2018.36">10.4230/LIPIcs.CSL.2018.36</a>
</li>
<li>
<span class="authors">Kazushige Terui</span>
<span class="title">MacNeille Completion and Buchholz' Omega Rule for Parameter-Free Second Order Logics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2018.37">10.4230/LIPIcs.CSL.2018.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