HTML Export for FSCD 2018

Copy to Clipboard Download

<h2>LIPIcs, Volume 108, FSCD 2018</h2>
<ul>
<li>
    <span class="authors">Hélène Kirchner</span>
    <span class="title">LIPIcs, Volume 108, FSCD&#039;18, Complete Volume</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2018">10.4230/LIPIcs.FSCD.2018</a>
</li>
<li>
    <span class="authors">Hélène Kirchner</span>
    <span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2018.0">10.4230/LIPIcs.FSCD.2018.0</a>
</li>
<li>
    <span class="authors">Stéphanie Delaune</span>
    <span class="title">Analysing Privacy-Type Properties in Cryptographic Protocols (Invited Talk)</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2018.1">10.4230/LIPIcs.FSCD.2018.1</a>
</li>
<li>
    <span class="authors">Grigore Rosu</span>
    <span class="title">Formal Design, Implementation and Verification of Blockchain Languages (Invited Talk)</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2018.2">10.4230/LIPIcs.FSCD.2018.2</a>
</li>
<li>
    <span class="authors">Peter Selinger</span>
    <span class="title">Challenges in Quantum Programming Languages (Invited Talk)</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2018.3">10.4230/LIPIcs.FSCD.2018.3</a>
</li>
<li>
    <span class="authors">Valeria Vignudelli</span>
    <span class="title">Proof Techniques for Program Equivalence in Probabilistic Higher-Order Languages (Invited Talk)</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2018.4">10.4230/LIPIcs.FSCD.2018.4</a>
</li>
<li>
    <span class="authors">Sandra Alves and Sabine Broda</span>
    <span class="title">A Unifying Framework for Type Inhabitation</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2018.5">10.4230/LIPIcs.FSCD.2018.5</a>
</li>
<li>
    <span class="authors">Nirina Andrianarivelo and Pierre Réty</span>
    <span class="title">Confluence of Prefix-Constrained Rewrite Systems</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2018.6">10.4230/LIPIcs.FSCD.2018.6</a>
</li>
<li>
    <span class="authors">Mauricio Ayala-Rincón, Maribel Fernández, and Daniele Nantes-Sobrinho</span>
    <span class="title">Fixed-Point Constraints for Nominal Equational Unification</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2018.7">10.4230/LIPIcs.FSCD.2018.7</a>
</li>
<li>
    <span class="authors">Patrick Bahr</span>
    <span class="title">Strict Ideal Completions of the Lambda Calculus</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2018.8">10.4230/LIPIcs.FSCD.2018.8</a>
</li>
<li>
    <span class="authors">Alexander Baumgartner, Temur Kutsia, Jordi Levy, and Mateu Villaret</span>
    <span class="title">Term-Graph Anti-Unification</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2018.9">10.4230/LIPIcs.FSCD.2018.9</a>
</li>
<li>
    <span class="authors">Gianluigi Bellin and Willem B. Heijltjes</span>
    <span class="title">Proof Nets for Bi-Intuitionistic Linear Logic</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2018.10">10.4230/LIPIcs.FSCD.2018.10</a>
</li>
<li>
    <span class="authors">Maciej Bendkowski and Pierre Lescanne</span>
    <span class="title">Counting Environments and Closures</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2018.11">10.4230/LIPIcs.FSCD.2018.11</a>
</li>
<li>
    <span class="authors">David M. Cerna and Temur Kutsia</span>
    <span class="title">Higher-Order Equational Pattern Anti-Unification</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2018.12">10.4230/LIPIcs.FSCD.2018.12</a>
</li>
<li>
    <span class="authors">Lukasz Czajka</span>
    <span class="title">Term Rewriting Characterisation of LOGSPACE for Finite and Infinite Data</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2018.13">10.4230/LIPIcs.FSCD.2018.13</a>
</li>
<li>
    <span class="authors">Jörg Endrullis, Jan Willem Klop, and Roy Overbeek</span>
    <span class="title">Decreasing Diagrams with Two Labels Are Complete for Confluence of Countable Systems</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2018.14">10.4230/LIPIcs.FSCD.2018.14</a>
</li>
<li>
    <span class="authors">Simon Forest and Samuel Mimram</span>
    <span class="title">Coherence of Gray Categories via Rewriting</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2018.15">10.4230/LIPIcs.FSCD.2018.15</a>
</li>
<li>
    <span class="authors">Thomas Genet</span>
    <span class="title">Completeness of Tree Automata Completion</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2018.16">10.4230/LIPIcs.FSCD.2018.16</a>
</li>
<li>
    <span class="authors">Amar Hadzihasanovic, Giovanni de Felice, and Kang Feng Ng</span>
    <span class="title">A Diagrammatic Axiomatisation of Fermionic Quantum Circuits</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2018.17">10.4230/LIPIcs.FSCD.2018.17</a>
</li>
<li>
    <span class="authors">Mirai Ikebuchi and Keisuke Nakano</span>
    <span class="title">On Repetitive Right Application of B-Terms</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2018.18">10.4230/LIPIcs.FSCD.2018.18</a>
</li>
<li>
    <span class="authors">Rohan Jacob-Rao, Brigitte Pientka, and David Thibodeau</span>
    <span class="title">Index-Stratified Types</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2018.19">10.4230/LIPIcs.FSCD.2018.19</a>
</li>
<li>
    <span class="authors">Ambrus Kaposi and András Kovács</span>
    <span class="title">A Syntax for Higher Inductive-Inductive Types</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2018.20">10.4230/LIPIcs.FSCD.2018.20</a>
</li>
<li>
    <span class="authors">Jean-Simon Pacaud Lemay</span>
    <span class="title">Lifting Coalgebra Modalities and IMELL Model Structure to Eilenberg-Moore Categories</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2018.21">10.4230/LIPIcs.FSCD.2018.21</a>
</li>
<li>
    <span class="authors">Daniel R. Licata, Ian Orton, Andrew M. Pitts, and Bas Spitters</span>
    <span class="title">Internal Universes in Models of Homotopy Type Theory</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2018.22">10.4230/LIPIcs.FSCD.2018.22</a>
</li>
<li>
    <span class="authors">Bassel Mannaa and Rasmus Ejlers Møgelberg</span>
    <span class="title">The Clocks They Are Adjunctions Denotational Semantics for Clocked Type Theory</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2018.23">10.4230/LIPIcs.FSCD.2018.23</a>
</li>
<li>
    <span class="authors">Max S. New and Daniel R. Licata</span>
    <span class="title">Call-by-Name Gradual Type Theory</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2018.24">10.4230/LIPIcs.FSCD.2018.24</a>
</li>
<li>
    <span class="authors">Lê Thành Dung Nguyen</span>
    <span class="title">Unique perfect matchings and proof nets</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2018.25">10.4230/LIPIcs.FSCD.2018.25</a>
</li>
<li>
    <span class="authors">Naoki Nishida and Yuya Maeda</span>
    <span class="title">Narrowing Trees for Syntactically Deterministic Conditional Term Rewriting Systems</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2018.26">10.4230/LIPIcs.FSCD.2018.26</a>
</li>
<li>
    <span class="authors">Pawel Parys</span>
    <span class="title">Homogeneity Without Loss of Generality</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2018.27">10.4230/LIPIcs.FSCD.2018.27</a>
</li>
<li>
    <span class="authors">Manfred Schmidt-Schauß and David Sabel</span>
    <span class="title">Nominal Unification with Atom and Context Variables</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2018.28">10.4230/LIPIcs.FSCD.2018.28</a>
</li>
<li>
    <span class="authors">Amin Timany and Matthieu Sozeau</span>
    <span class="title">Cumulative Inductive Types In Coq</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2018.29">10.4230/LIPIcs.FSCD.2018.29</a>
</li>
<li>
    <span class="authors">Sarah Winkler and Aart Middeldorp</span>
    <span class="title">Completion for Logically Constrained Rewriting</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2018.30">10.4230/LIPIcs.FSCD.2018.30</a>
</li>
<li>
    <span class="authors">Christina Kohl and Aart Middeldorp</span>
    <span class="title">ProTeM: A Proof Term Manipulator (System Description)</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2018.31">10.4230/LIPIcs.FSCD.2018.31</a>
</li>
<li>
    <span class="authors">Takahito Aoto, Makoto Hamana, Nao Hirokawa, Aart Middeldorp, Julian Nagele, Naoki Nishida, Kiraku Shintani, and Harald Zankl</span>
    <span class="title">Confluence Competition 2018</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2018.32">10.4230/LIPIcs.FSCD.2018.32</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

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail