<h2>LIPIcs, Volume 84, FSCD 2017</h2>
<ul>
<li>
<span class="authors">Dale Miller</span>
<span class="title">LIPIcs, Volume 84, FSCD'17, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2017">10.4230/LIPIcs.FSCD.2017</a>
</li>
<li>
<span class="authors">Dale Miller</span>
<span class="title">Front Matter, Table of Contents, Preface, Steering Committee, Program Committee, External Reviewers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2017.0">10.4230/LIPIcs.FSCD.2017.0</a>
</li>
<li>
<span class="authors">Marco Gaboardi</span>
<span class="title">Type Systems for the Relational Verification of Higher Order Programs (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2017.1">10.4230/LIPIcs.FSCD.2017.1</a>
</li>
<li>
<span class="authors">Georg Moser</span>
<span class="title">Uniform Resource Analysis by Rewriting: Strenghts and Weaknesses (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2017.2">10.4230/LIPIcs.FSCD.2017.2</a>
</li>
<li>
<span class="authors">Alexandra Silva</span>
<span class="title">Brzozowski Goes Concurrent - A Kleene Theorem for Pomset Languages (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2017.3">10.4230/LIPIcs.FSCD.2017.3</a>
</li>
<li>
<span class="authors">Christine Tasson</span>
<span class="title">Quantitative Semantics for Probabilistic Programming (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2017.4">10.4230/LIPIcs.FSCD.2017.4</a>
</li>
<li>
<span class="authors">Benedikt Ahrens and Peter LeFanu Lumsdaine</span>
<span class="title">Displayed Categories</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2017.5">10.4230/LIPIcs.FSCD.2017.5</a>
</li>
<li>
<span class="authors">Yohji Akama</span>
<span class="title">The Confluent Terminating Context-Free Substitutive Rewriting System for the lambda-Calculus with Surjective Pairing and Terminal Type</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2017.6">10.4230/LIPIcs.FSCD.2017.6</a>
</li>
<li>
<span class="authors">Takahito Aoto, Yoshihito Toyama, and Yuta Kimura</span>
<span class="title">Improving Rewriting Induction Approach for Proving Ground Confluence</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2017.7">10.4230/LIPIcs.FSCD.2017.7</a>
</li>
<li>
<span class="authors">Patrick Bahr</span>
<span class="title">Böhm Reduction in Infinitary Term Graph Rewriting Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2017.8">10.4230/LIPIcs.FSCD.2017.8</a>
</li>
<li>
<span class="authors">Pablo Barenbaum and Eduardo Bonelli</span>
<span class="title">Optimality and the Linear Substitution Calculus</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2017.9">10.4230/LIPIcs.FSCD.2017.9</a>
</li>
<li>
<span class="authors">Malgorzata Biernacka, Witold Charatonik, and Klara Zielinska</span>
<span class="title">Generalized Refocusing: From Hybrid Strategies to Abstract Machines</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2017.10">10.4230/LIPIcs.FSCD.2017.10</a>
</li>
<li>
<span class="authors">Jasmin Christian Blanchette, Mathias Fleury, and Dmitriy Traytel</span>
<span class="title">Nested Multisets, Hereditary Multisets, and Syntactic Ordinals in Isabelle/HOL</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2017.11">10.4230/LIPIcs.FSCD.2017.11</a>
</li>
<li>
<span class="authors">Simon Castellan, Pierre Clairambault, and Glynn Winskel</span>
<span class="title">Observably Deterministic Concurrent Strategies and Intensional Full Abstraction for Parallel-or</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2017.12">10.4230/LIPIcs.FSCD.2017.12</a>
</li>
<li>
<span class="authors">J. Robin B. Cockett and Jean-Simon Lemay</span>
<span class="title">There Is Only One Notion of Differentiation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2017.13">10.4230/LIPIcs.FSCD.2017.13</a>
</li>
<li>
<span class="authors">Lukasz Czajka</span>
<span class="title">Confluence of an Extension of Combinatory Logic by Boolean Constants</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2017.14">10.4230/LIPIcs.FSCD.2017.14</a>
</li>
<li>
<span class="authors">Andrej Dudenhefner and Jakob Rehof</span>
<span class="title">The Complexity of Principal Inhabitation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2017.15">10.4230/LIPIcs.FSCD.2017.15</a>
</li>
<li>
<span class="authors">Marcelo Fiore and Philip Saville</span>
<span class="title">List Objects with Algebraic Structure</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2017.16">10.4230/LIPIcs.FSCD.2017.16</a>
</li>
<li>
<span class="authors">Stefano Guerrini and Marco Solieri</span>
<span class="title">Is the Optimal Implementation Inefficient? Elementarily Not</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2017.17">10.4230/LIPIcs.FSCD.2017.17</a>
</li>
<li>
<span class="authors">Daniel Hillerström, Sam Lindley, Robert Atkey, and K. C. Sivaramakrishnan</span>
<span class="title">Continuation Passing Style for Effect Handlers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2017.18">10.4230/LIPIcs.FSCD.2017.18</a>
</li>
<li>
<span class="authors">Nao Hirokawa, Aart Middeldorp, Christian Sternagel, and Sarah Winkler</span>
<span class="title">Infinite Runs in Abstract Completion</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2017.19">10.4230/LIPIcs.FSCD.2017.19</a>
</li>
<li>
<span class="authors">Benedetto Intrigila, Giulio Manzonetto, and Andrew Polonsky</span>
<span class="title">Refutation of Sallé's Longstanding Conjecture</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2017.20">10.4230/LIPIcs.FSCD.2017.20</a>
</li>
<li>
<span class="authors">Jonas Kaiser, Brigitte Pientka, and Gert Smolka</span>
<span class="title">Relating System F and Lambda2: A Case Study in Coq, Abella and Beluga</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2017.21">10.4230/LIPIcs.FSCD.2017.21</a>
</li>
<li>
<span class="authors">Max Kanovich, Stepan Kuznetsov, Glyn Morrill, and Andre Scedrov</span>
<span class="title">A Polynomial-Time Algorithm for the Lambek Calculus with Brackets of Bounded Order</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2017.22">10.4230/LIPIcs.FSCD.2017.22</a>
</li>
<li>
<span class="authors">Akitoshi Kawamura and Florian Steinberg</span>
<span class="title">Polynomial Running Times for Polynomial-Time Oracle Machines</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2017.23">10.4230/LIPIcs.FSCD.2017.23</a>
</li>
<li>
<span class="authors">Delia Kesner and Pierre Vial</span>
<span class="title">Types as Resources for Classical Natural Deduction</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2017.24">10.4230/LIPIcs.FSCD.2017.24</a>
</li>
<li>
<span class="authors">Daniel R. Licata, Michael Shulman, and Mitchell Riley</span>
<span class="title">A Fibrational Framework for Substructural and Modal Logics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2017.25">10.4230/LIPIcs.FSCD.2017.25</a>
</li>
<li>
<span class="authors">Benjamin Lichtman and Jan Hoffmann</span>
<span class="title">Arrays and References in Resource Aware ML</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2017.26">10.4230/LIPIcs.FSCD.2017.26</a>
</li>
<li>
<span class="authors">Tadeusz Litak, Miriam Polzer, and Ulrich Rabenstein</span>
<span class="title">Negative Translations and Normal Modality</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2017.27">10.4230/LIPIcs.FSCD.2017.27</a>
</li>
<li>
<span class="authors">Ian Orton and Andrew M. Pitts</span>
<span class="title">Models of Type Theory Based on Moore Paths</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2017.28">10.4230/LIPIcs.FSCD.2017.28</a>
</li>
<li>
<span class="authors">Paolo Pistone</span>
<span class="title">On Dinaturality, Typability and beta-eta-Stable Models</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2017.29">10.4230/LIPIcs.FSCD.2017.29</a>
</li>
<li>
<span class="authors">Pierre Pradic and Colin Riba</span>
<span class="title">A Curry-Howard Approach to Church's Synthesis</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2017.30">10.4230/LIPIcs.FSCD.2017.30</a>
</li>
<li>
<span class="authors">Lutz Straßburger</span>
<span class="title">Combinatorial Flows and Their Normalisation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2017.31">10.4230/LIPIcs.FSCD.2017.31</a>
</li>
<li>
<span class="authors">Ryota Suzuki, Koichi Fujima, Naoki Kobayashi, and Takeshi Tsukada</span>
<span class="title">Streett Automata Model Checking of Higher-Order Recursion Schemes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2017.32">10.4230/LIPIcs.FSCD.2017.32</a>
</li>
<li>
<span class="authors">Noam Zeilberger</span>
<span class="title">A Sequent Calculus for a Semi-Associative Law</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2017.33">10.4230/LIPIcs.FSCD.2017.33</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