<h2>LIPIcs, Volume 52, FSCD 2016</h2>
<ul>
<li>
<span class="authors">Delia Kesner and Brigitte Pientka</span>
<span class="title">LIPIcs, Volume 52, FSCD'16, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2016">10.4230/LIPIcs.FSCD.2016</a>
</li>
<li>
<span class="authors">Delia Kesner and Brigitte Pientka</span>
<span class="title">Front Matter, Table of Contents, Preface, Steering Committee, Program Committee, External Reviewers, Organising Commitee</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2016.0">10.4230/LIPIcs.FSCD.2016.0</a>
</li>
<li>
<span class="authors">Amal Ahmed</span>
<span class="title">Compositional Compiler Verification for a Multi-Language World</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2016.1">10.4230/LIPIcs.FSCD.2016.1</a>
</li>
<li>
<span class="authors">Ichiro Hasuo</span>
<span class="title">Coalgebras and Higher-Order Computation: a GoI Approach</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2016.2">10.4230/LIPIcs.FSCD.2016.2</a>
</li>
<li>
<span class="authors">Gérard Huet</span>
<span class="title">Teaching Foundations of Computation and Deduction Through Literate Functional Programming and Type Theory Formalization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2016.3">10.4230/LIPIcs.FSCD.2016.3</a>
</li>
<li>
<span class="authors">Tobias Nipkow</span>
<span class="title">Verified Analysis of Functional Data Structures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2016.4">10.4230/LIPIcs.FSCD.2016.4</a>
</li>
<li>
<span class="authors">Ryota Akiyoshi and Kazushige Terui</span>
<span class="title">Strong Normalization for the Parameter-Free Polymorphic Lambda Calculus Based on the Omega-Rule.</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2016.5">10.4230/LIPIcs.FSCD.2016.5</a>
</li>
<li>
<span class="authors">Thorsten Altenkirch and Ambrus Kaposi</span>
<span class="title">Normalisation by Evaluation for Dependent Types</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2016.6">10.4230/LIPIcs.FSCD.2016.6</a>
</li>
<li>
<span class="authors">Ofer Arieli and Arnon Avron</span>
<span class="title">Minimal Paradefinite Logics for Reasoning with Incompleteness and Inconsistency</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2016.7">10.4230/LIPIcs.FSCD.2016.7</a>
</li>
<li>
<span class="authors">Ryuta Arisaka</span>
<span class="title">Structural Interactions and Absorption of Structural Rules in BI Sequent Calculus</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2016.8">10.4230/LIPIcs.FSCD.2016.8</a>
</li>
<li>
<span class="authors">Andrés Aristizábal, Dariusz Biernacki, Sergueï Lenglet, and Piotr Polesiuk</span>
<span class="title">Environmental Bisimulations for Delimited-Control Operators with Dynamic Prompt Generation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2016.9">10.4230/LIPIcs.FSCD.2016.9</a>
</li>
<li>
<span class="authors">Martin Avanzini and Georg Moser</span>
<span class="title">Complexity of Acyclic Term Graph Rewriting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2016.10">10.4230/LIPIcs.FSCD.2016.10</a>
</li>
<li>
<span class="authors">Mauricio Ayala-Rincón, Maribel Fernández, and Daniele Nantes-Sobrinho</span>
<span class="title">Nominal Narrowing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2016.11">10.4230/LIPIcs.FSCD.2016.11</a>
</li>
<li>
<span class="authors">Marcin Benke, Aleksy Schubert, and Daria Walukiewicz-Chrzaszcz</span>
<span class="title">Synthesis of Functional Programs with Help of First-Order Intuitionistic Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2016.12">10.4230/LIPIcs.FSCD.2016.12</a>
</li>
<li>
<span class="authors">Valentin Blot</span>
<span class="title">Classical Extraction in Continuation Models</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2016.13">10.4230/LIPIcs.FSCD.2016.13</a>
</li>
<li>
<span class="authors">Jon Haël Brenas, Rachid Echahed, and Martin Strecker</span>
<span class="title">Proving Correctness of Logically Decorated Graph Rewriting Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2016.14">10.4230/LIPIcs.FSCD.2016.14</a>
</li>
<li>
<span class="authors">Flavien Breuvart, Giulio Manzonetto, Andrew Polonsky, and Domenico Ruoppolo</span>
<span class="title">New Results on Morris's Observational Theory: The Benefits of Separating the Inseparable</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2016.15">10.4230/LIPIcs.FSCD.2016.15</a>
</li>
<li>
<span class="authors">Kaustuv Chaudhuri, Sonia Marin, and Lutz Straßburger</span>
<span class="title">Modular Focused Proof Systems for Intuitionistic Modal Logics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2016.16">10.4230/LIPIcs.FSCD.2016.16</a>
</li>
<li>
<span class="authors">Thierry Coquand and Bassel Mannaa</span>
<span class="title">The Independence of Markov’s Principle in Type Theory</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2016.17">10.4230/LIPIcs.FSCD.2016.17</a>
</li>
<li>
<span class="authors">Fer-Jan de Vries</span>
<span class="title">On Undefined and Meaningless in Lambda Definability</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2016.18">10.4230/LIPIcs.FSCD.2016.18</a>
</li>
<li>
<span class="authors">Andrej Dudenhefner, Moritz Martens, and Jakob Rehof</span>
<span class="title">The Intersection Type Unification Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2016.19">10.4230/LIPIcs.FSCD.2016.19</a>
</li>
<li>
<span class="authors">Giulio Guerrieri, Luc Pellissier, and Lorenzo Tortora de Falco</span>
<span class="title">Computing Connected Proof(-Structure)s From Their Taylor Expansion</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2016.20">10.4230/LIPIcs.FSCD.2016.20</a>
</li>
<li>
<span class="authors">Makoto Hamana</span>
<span class="title">Strongly Normalising Cyclic Data Computation by Iteration Categories of Second-Order Algebraic Theories</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2016.21">10.4230/LIPIcs.FSCD.2016.21</a>
</li>
<li>
<span class="authors">Stefan Kahrs and Connor Smith</span>
<span class="title">Non-Omega-Overlapping TRSs are UN</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2016.22">10.4230/LIPIcs.FSCD.2016.22</a>
</li>
<li>
<span class="authors">Cynthia Kop and Jakob Grue Simonsen</span>
<span class="title">Complexity Hierarchies and Higher-Order Cons-Free Rewriting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2016.23">10.4230/LIPIcs.FSCD.2016.23</a>
</li>
<li>
<span class="authors">James Laird</span>
<span class="title">Weighted Relational Models for Mobility</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2016.24">10.4230/LIPIcs.FSCD.2016.24</a>
</li>
<li>
<span class="authors">Olivier Laurent</span>
<span class="title">Focusing in Orthologic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2016.25">10.4230/LIPIcs.FSCD.2016.25</a>
</li>
<li>
<span class="authors">Tomer Libal and Dale Miller</span>
<span class="title">Functions-as-Constructors Higher-Order Unification</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2016.26">10.4230/LIPIcs.FSCD.2016.26</a>
</li>
<li>
<span class="authors">Philippe Malbos and Samuel Mimram</span>
<span class="title">Homological Computations for Term Rewriting Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2016.27">10.4230/LIPIcs.FSCD.2016.27</a>
</li>
<li>
<span class="authors">Naoki Nishida, Adrián Palacios, and Germán Vidal</span>
<span class="title">Reversible Term Rewriting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2016.28">10.4230/LIPIcs.FSCD.2016.28</a>
</li>
<li>
<span class="authors">Christian Sternagel and Thomas Sternagel</span>
<span class="title">Certifying Confluence of Almost Orthogonal CTRSs via Exact Tree Automata Completion</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2016.29">10.4230/LIPIcs.FSCD.2016.29</a>
</li>
<li>
<span class="authors">Amin Timany and Bart Jacobs</span>
<span class="title">Category Theory in Coq 8.5</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2016.30">10.4230/LIPIcs.FSCD.2016.30</a>
</li>
<li>
<span class="authors">Dmitriy Traytel</span>
<span class="title">Formal Languages, Formally and Coinductively</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2016.31">10.4230/LIPIcs.FSCD.2016.31</a>
</li>
<li>
<span class="authors">Vincent van Oostrom and Yoshihito Toyama</span>
<span class="title">Normalisation by Random Descent</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2016.32">10.4230/LIPIcs.FSCD.2016.32</a>
</li>
<li>
<span class="authors">Takahito Aoto and Yoshihito Toyama</span>
<span class="title">Ground Confluence Prover based on Rewriting Induction</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2016.33">10.4230/LIPIcs.FSCD.2016.33</a>
</li>
<li>
<span class="authors">Krzysztof Bar, Aleks Kissinger, and Jamie Vicary</span>
<span class="title">Globular: An Online Proof Assistant for Higher-Dimensional Rewriting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2016.34">10.4230/LIPIcs.FSCD.2016.34</a>
</li>
<li>
<span class="authors">Stéphane Gimenez and David Obwaller</span>
<span class="title">Interaction Automata and the ia2d Interpreter</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2016.35">10.4230/LIPIcs.FSCD.2016.35</a>
</li>
<li>
<span class="authors">Franziska Rapp and Aart Middeldorp</span>
<span class="title">Automating the First-Order Theory of Rewriting for Left-Linear Right-Ground Rewrite Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2016.36">10.4230/LIPIcs.FSCD.2016.36</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