<h2>LIPIcs, Volume 167, FSCD 2020</h2>
<ul>
<li>
<span class="authors">Zena M. Ariola</span>
<span class="title">LIPIcs, Volume 167, FSCD 2020, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2020">10.4230/LIPIcs.FSCD.2020</a>
</li>
<li>
<span class="authors">Zena M. Ariola</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2020.0">10.4230/LIPIcs.FSCD.2020.0</a>
</li>
<li>
<span class="authors">Simona Ronchi Della Rocca, Ugo Dal Lago, and Claudia Faggian</span>
<span class="title">Solvability in a Probabilistic Setting (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2020.1">10.4230/LIPIcs.FSCD.2020.1</a>
</li>
<li>
<span class="authors">Brigitte Pientka</span>
<span class="title">A Modal Analysis of Metaprogramming, Revisited (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2020.2">10.4230/LIPIcs.FSCD.2020.2</a>
</li>
<li>
<span class="authors">Andrew M. Pitts</span>
<span class="title">Quotients in Dependent Type Theory (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2020.3">10.4230/LIPIcs.FSCD.2020.3</a>
</li>
<li>
<span class="authors">René Thiemann, Jonas Schöpf, Christian Sternagel, and Akihisa Yamada</span>
<span class="title">Certifying the Weighted Path Order (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2020.4">10.4230/LIPIcs.FSCD.2020.4</a>
</li>
<li>
<span class="authors">Petar Vukmirović, Alexander Bentkamp, and Visa Nummelin</span>
<span class="title">Efficient Full Higher-Order Unification</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2020.5">10.4230/LIPIcs.FSCD.2020.5</a>
</li>
<li>
<span class="authors">Paul-André Melliès and Nicolas Rolland</span>
<span class="title">Comprehension and Quotient Structures in the Language of 2-Categories</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2020.6">10.4230/LIPIcs.FSCD.2020.6</a>
</li>
<li>
<span class="authors">Dariusz Biernacki, Sergueï Lenglet, and Piotr Polesiuk</span>
<span class="title">A Complete Normal-Form Bisimilarity for Algebraic Effects and Handlers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2020.7">10.4230/LIPIcs.FSCD.2020.7</a>
</li>
<li>
<span class="authors">Paul Brunet and David Pym</span>
<span class="title">Pomsets with Boxes: Protection, Separation, and Locality in Concurrent Kleene Algebra</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2020.8">10.4230/LIPIcs.FSCD.2020.8</a>
</li>
<li>
<span class="authors">Andrej Dudenhefner</span>
<span class="title">Undecidability of Semi-Unification on a Napkin</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2020.9">10.4230/LIPIcs.FSCD.2020.9</a>
</li>
<li>
<span class="authors">Mathias Hülsbusch, Barbara König, Sebastian Küpper, and Lara Stoltenow</span>
<span class="title">Conditional Bisimilarity for Reactive Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2020.10">10.4230/LIPIcs.FSCD.2020.10</a>
</li>
<li>
<span class="authors">Masaomi Yamaguchi and Takahito Aoto</span>
<span class="title">A Fast Decision Procedure For Uniqueness of Normal Forms w.r.t. Conversion of Shallow Term Rewriting Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2020.11">10.4230/LIPIcs.FSCD.2020.11</a>
</li>
<li>
<span class="authors">André Hirschowitz, Tom Hirschowitz, and Ambroise Lafont</span>
<span class="title">Modules over Monads and Operational Semantics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2020.12">10.4230/LIPIcs.FSCD.2020.12</a>
</li>
<li>
<span class="authors">Frédéric Blanqui</span>
<span class="title">Type Safety of Rewrite Rules in Dependent Types</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2020.13">10.4230/LIPIcs.FSCD.2020.13</a>
</li>
<li>
<span class="authors">Rose Bohrer and André Platzer</span>
<span class="title">Refining Constructive Hybrid Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2020.14">10.4230/LIPIcs.FSCD.2020.14</a>
</li>
<li>
<span class="authors">Andrej Ivašković, Alan Mycroft, and Dominic Orchard</span>
<span class="title">Data-Flow Analyses as Effects and Graded Monads</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2020.15">10.4230/LIPIcs.FSCD.2020.15</a>
</li>
<li>
<span class="authors">Zeinab Galal</span>
<span class="title">A Profunctorial Scott Semantics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2020.16">10.4230/LIPIcs.FSCD.2020.16</a>
</li>
<li>
<span class="authors">Guillaume Boisseau</span>
<span class="title">String Diagrams for Optics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2020.17">10.4230/LIPIcs.FSCD.2020.17</a>
</li>
<li>
<span class="authors">Dariusz Biernacki, Mateusz Pyzik, and Filip Sieczkowski</span>
<span class="title">A Reflection on Continuation-Composing Style</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2020.18">10.4230/LIPIcs.FSCD.2020.18</a>
</li>
<li>
<span class="authors">Yo Mitani, Naoki Kobayashi, and Takeshi Tsukada</span>
<span class="title">A Probabilistic Higher-Order Fixpoint Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2020.19">10.4230/LIPIcs.FSCD.2020.19</a>
</li>
<li>
<span class="authors">Rick Erkens and Maurice Laveaux</span>
<span class="title">Adaptive Non-Linear Pattern Matching Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2020.20">10.4230/LIPIcs.FSCD.2020.20</a>
</li>
<li>
<span class="authors">Yoshiki Nakamura, Kazuyuki Asada, Naoki Kobayashi, Ryoma Sin'ya, and Takeshi Tsukada</span>
<span class="title">On Average-Case Hardness of Higher-Order Model Checking</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2020.21">10.4230/LIPIcs.FSCD.2020.21</a>
</li>
<li>
<span class="authors">Kazuyuki Asada and Naoki Kobayashi</span>
<span class="title">Size-Preserving Translations from Order-(n+1) Word Grammars to Order-n Tree Grammars</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2020.22">10.4230/LIPIcs.FSCD.2020.22</a>
</li>
<li>
<span class="authors">Ambrus Kaposi and Jakob von Raumer</span>
<span class="title">A Syntax for Mutual Inductive Families</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2020.23">10.4230/LIPIcs.FSCD.2020.23</a>
</li>
<li>
<span class="authors">Tim Lukas Diezel and Sergey Goncharov</span>
<span class="title">Towards Constructive Hybrid Semantics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2020.24">10.4230/LIPIcs.FSCD.2020.24</a>
</li>
<li>
<span class="authors">Chuangjie Xu</span>
<span class="title">A Gentzen-Style Monadic Translation of Gödel’s System T</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2020.25">10.4230/LIPIcs.FSCD.2020.25</a>
</li>
<li>
<span class="authors">David M. Cerna and Temur Kutsia</span>
<span class="title">Unital Anti-Unification: Type and Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2020.26">10.4230/LIPIcs.FSCD.2020.26</a>
</li>
<li>
<span class="authors">Yu-Yang Lin and Nikos Tzevelekos</span>
<span class="title">Symbolic Execution Game Semantics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2020.27">10.4230/LIPIcs.FSCD.2020.27</a>
</li>
<li>
<span class="authors">Wilmer Ricciotti and James Cheney</span>
<span class="title">Strongly Normalizing Higher-Order Relational Queries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2020.28">10.4230/LIPIcs.FSCD.2020.28</a>
</li>
<li>
<span class="authors">Henry DeYoung, Frank Pfenning, and Klaas Pruiksma</span>
<span class="title">Semi-Axiomatic Sequent Calculus</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2020.29">10.4230/LIPIcs.FSCD.2020.29</a>
</li>
<li>
<span class="authors">Besik Dundua, Temur Kutsia, Mircea Marin, and Cleopatra Pau</span>
<span class="title">Constraint Solving over Multiple Similarity Relations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2020.30">10.4230/LIPIcs.FSCD.2020.30</a>
</li>
<li>
<span class="authors">Guillaume Genestier</span>
<span class="title">Encoding Agda Programs Using Rewriting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2020.31">10.4230/LIPIcs.FSCD.2020.31</a>
</li>
<li>
<span class="authors">Mario Alvarez-Picallo and C.-H. Luke Ong</span>
<span class="title">The Difference λ-Calculus: A Language for Difference Categories</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2020.32">10.4230/LIPIcs.FSCD.2020.32</a>
</li>
<li>
<span class="authors">Ankush Das and Frank Pfenning</span>
<span class="title">Rast: Resource-Aware Session Types with Arithmetic Refinements (System Description)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2020.33">10.4230/LIPIcs.FSCD.2020.33</a>
</li>
<li>
<span class="authors">Cyril Cohen, Kazuhiko Sakaguchi, and Enrico Tassi</span>
<span class="title">Hierarchy Builder: Algebraic hierarchies Made Easy in Coq with Elpi (System Description)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2020.34">10.4230/LIPIcs.FSCD.2020.34</a>
</li>
<li>
<span class="authors">Gabriel Hondet and Frédéric Blanqui</span>
<span class="title">The New Rewriting Engine of Dedukti (System Description)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2020.35">10.4230/LIPIcs.FSCD.2020.35</a>
</li>
<li>
<span class="authors">Cynthia Kop</span>
<span class="title">WANDA - a Higher Order Termination Tool (System Description)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2020.36">10.4230/LIPIcs.FSCD.2020.36</a>
</li>
<li>
<span class="authors">Claude Stolze and Luigi Liquori</span>
<span class="title">A Type Checker for a Logical Framework with Union and Intersection Types (System Description)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2020.37">10.4230/LIPIcs.FSCD.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