<h2>LIPIcs, Volume 131, FSCD 2019</h2>
<ul>
<li>
<span class="authors">Herman Geuvers</span>
<span class="title">LIPIcs, Volume 131, FSCD'19, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2019">10.4230/LIPIcs.FSCD.2019</a>
</li>
<li>
<span class="authors">Herman Geuvers</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2019.0">10.4230/LIPIcs.FSCD.2019.0</a>
</li>
<li>
<span class="authors">Beniamino Accattoli</span>
<span class="title">A Fresh Look at the lambda-Calculus (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2019.1">10.4230/LIPIcs.FSCD.2019.1</a>
</li>
<li>
<span class="authors">Amy P. Felty</span>
<span class="title">A Linear Logical Framework in Hybrid (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2019.2">10.4230/LIPIcs.FSCD.2019.2</a>
</li>
<li>
<span class="authors">Sarah Winkler</span>
<span class="title">Extending Maximal Completion (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2019.3">10.4230/LIPIcs.FSCD.2019.3</a>
</li>
<li>
<span class="authors">Hongseok Yang</span>
<span class="title">Some Semantic Issues in Probabilistic Programming Languages (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2019.4">10.4230/LIPIcs.FSCD.2019.4</a>
</li>
<li>
<span class="authors">Benedikt Ahrens, Dan Frumin, Marco Maggesi, and Niels van der Weide</span>
<span class="title">Bicategories in Univalent Foundations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2019.5">10.4230/LIPIcs.FSCD.2019.5</a>
</li>
<li>
<span class="authors">Benedikt Ahrens, André Hirschowitz, Ambroise Lafont, and Marco Maggesi</span>
<span class="title">Modular Specification of Monads Through Higher-Order Presentations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2019.6">10.4230/LIPIcs.FSCD.2019.6</a>
</li>
<li>
<span class="authors">Maciej Bendkowski</span>
<span class="title">Towards the Average-Case Analysis of Substitution Resolution in Lambda-Calculus</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2019.7">10.4230/LIPIcs.FSCD.2019.7</a>
</li>
<li>
<span class="authors">Małgorzata Biernacka and Witold Charatonik</span>
<span class="title">Deriving an Abstract Machine for Strong Call by Need</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2019.8">10.4230/LIPIcs.FSCD.2019.8</a>
</li>
<li>
<span class="authors">Frédéric Blanqui, Guillaume Genestier, and Olivier Hermant</span>
<span class="title">Dependency Pairs Termination in Dependent Type Theory Modulo Rewriting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2019.9">10.4230/LIPIcs.FSCD.2019.9</a>
</li>
<li>
<span class="authors">David M. Cerna and Temur Kutsia</span>
<span class="title">A Generic Framework for Higher-Order Generalizations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2019.10">10.4230/LIPIcs.FSCD.2019.10</a>
</li>
<li>
<span class="authors">Thierry Coquand, Simon Huber, and Christian Sattler</span>
<span class="title">Homotopy Canonicity for Cubical Type Theory</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2019.11">10.4230/LIPIcs.FSCD.2019.11</a>
</li>
<li>
<span class="authors">Łukasz Czajka and Cynthia Kop</span>
<span class="title">Polymorphic Higher-Order Termination</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2019.12">10.4230/LIPIcs.FSCD.2019.12</a>
</li>
<li>
<span class="authors">Ugo Dal Lago and Thomas Leventis</span>
<span class="title">On the Taylor Expansion of Probabilistic lambda-terms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2019.13">10.4230/LIPIcs.FSCD.2019.13</a>
</li>
<li>
<span class="authors">Alejandro Díaz-Caro and Gilles Dowek</span>
<span class="title">Proof Normalisation in a Logic Identifying Isomorphic Propositions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2019.14">10.4230/LIPIcs.FSCD.2019.14</a>
</li>
<li>
<span class="authors">Alberto Ciaffaglione, Pietro Di Gianantonio, Furio Honsell, Marina Lenisa, and Ivan Scagnetto</span>
<span class="title">lambda!-calculus, Intersection Types, and Involutions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2019.15">10.4230/LIPIcs.FSCD.2019.15</a>
</li>
<li>
<span class="authors">Clovis Eberhart, Tom Hirschowitz, and Alexis Laouar</span>
<span class="title">Template Games, Simple Games, and Day Convolution</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2019.16">10.4230/LIPIcs.FSCD.2019.16</a>
</li>
<li>
<span class="authors">Thomas Ehrhard</span>
<span class="title">Differentials and Distances in Probabilistic Coherence Spaces</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2019.17">10.4230/LIPIcs.FSCD.2019.17</a>
</li>
<li>
<span class="authors">José Espírito Santo, Luís Pinto, and Tarmo Uustalu</span>
<span class="title">Modal Embeddings and Calling Paradigms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2019.18">10.4230/LIPIcs.FSCD.2019.18</a>
</li>
<li>
<span class="authors">Claudia Faggian</span>
<span class="title">Probabilistic Rewriting: Normalization, Termination, and Unique Normal Forms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2019.19">10.4230/LIPIcs.FSCD.2019.19</a>
</li>
<li>
<span class="authors">Yosuke Fukuda and Akira Yoshimizu</span>
<span class="title">A Linear-Logical Reconstruction of Intuitionistic Modal Logic S4</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2019.20">10.4230/LIPIcs.FSCD.2019.20</a>
</li>
<li>
<span class="authors">Alfons Geser, Dieter Hofbauer, and Johannes Waldmann</span>
<span class="title">Sparse Tiling Through Overlap Closures for Termination of String Rewriting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2019.21">10.4230/LIPIcs.FSCD.2019.21</a>
</li>
<li>
<span class="authors">Willem B. Heijltjes, Dominic J. D. Hughes, and Lutz Straßburger</span>
<span class="title">Proof Nets for First-Order Additive Linear Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2019.22">10.4230/LIPIcs.FSCD.2019.22</a>
</li>
<li>
<span class="authors">Ross Horne</span>
<span class="title">The Sub-Additives: A Proof Theory for Probabilistic Choice extending Linear Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2019.23">10.4230/LIPIcs.FSCD.2019.23</a>
</li>
<li>
<span class="authors">Mirai Ikebuchi</span>
<span class="title">A Lower Bound of the Number of Rewrite Rules Obtained by Homological Methods</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2019.24">10.4230/LIPIcs.FSCD.2019.24</a>
</li>
<li>
<span class="authors">Ambrus Kaposi, Simon Huber, and Christian Sattler</span>
<span class="title">Gluing for Type Theory</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2019.25">10.4230/LIPIcs.FSCD.2019.25</a>
</li>
<li>
<span class="authors">Simona Kašterović and Michele Pagani</span>
<span class="title">The Discriminating Power of the Let-In Operator in the Lazy Call-by-Name Probabilistic lambda-Calculus</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2019.26">10.4230/LIPIcs.FSCD.2019.26</a>
</li>
<li>
<span class="authors">Dominique Larchey-Wendling and Yannick Forster</span>
<span class="title">Hilbert’s Tenth Problem in Coq</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2019.27">10.4230/LIPIcs.FSCD.2019.27</a>
</li>
<li>
<span class="authors">Luigi Liquori and Claude Stolze</span>
<span class="title">The Delta-calculus: Syntax and Types</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2019.28">10.4230/LIPIcs.FSCD.2019.28</a>
</li>
<li>
<span class="authors">Paulin Jacobé de Naurois</span>
<span class="title">Pointers in Recursion: Exploring the Tropics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2019.29">10.4230/LIPIcs.FSCD.2019.29</a>
</li>
<li>
<span class="authors">Maciej Piróg, Piotr Polesiuk, and Filip Sieczkowski</span>
<span class="title">Typed Equivalence of Effect Handlers and Delimited Control</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2019.30">10.4230/LIPIcs.FSCD.2019.30</a>
</li>
<li>
<span class="authors">Jonathan Sterling, Carlo Angiuli, and Daniel Gratzer</span>
<span class="title">Cubical Syntax for Reflection-Free Extensional Equality</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2019.31">10.4230/LIPIcs.FSCD.2019.31</a>
</li>
<li>
<span class="authors">Niccolò Veltri and Niels van der Weide</span>
<span class="title">Guarded Recursion in Agda via Sized Types</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2019.32">10.4230/LIPIcs.FSCD.2019.32</a>
</li>
<li>
<span class="authors">Pierre Vial</span>
<span class="title">Sequence Types for Hereditary Permutators</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2019.33">10.4230/LIPIcs.FSCD.2019.33</a>
</li>
<li>
<span class="authors">Rubén Rubio, Narciso Martí-Oliet, Isabel Pita, and Alberto Verdejo</span>
<span class="title">Model Checking Strategy-Controlled Rewriting Systems (System Description)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2019.34">10.4230/LIPIcs.FSCD.2019.34</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