HTML Export for FSCD 2023

Copy to Clipboard Download

<h2>LIPIcs, Volume 260, FSCD 2023</h2>
<ul>
<li>
    <span class="authors">Marco Gaboardi and Femke van Raamsdonk</span>
    <span class="title">LIPIcs, Volume 260, FSCD 2023, Complete Volume</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2023">10.4230/LIPIcs.FSCD.2023</a>
</li>
<li>
    <span class="authors">Marco Gaboardi and Femke van Raamsdonk</span>
    <span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2023.0">10.4230/LIPIcs.FSCD.2023.0</a>
</li>
<li>
    <span class="authors">Maribel Fernández</span>
    <span class="title">Nominal Techniques for Software Specification and Verification (Invited Talk)</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2023.1">10.4230/LIPIcs.FSCD.2023.1</a>
</li>
<li>
    <span class="authors">Mateja Jamnik</span>
    <span class="title">How Can We Make Trustworthy AI? (Invited Talk)</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2023.2">10.4230/LIPIcs.FSCD.2023.2</a>
</li>
<li>
    <span class="authors">Giulio Manzonetto</span>
    <span class="title">A Lambda Calculus Satellite (Invited Talk)</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2023.3">10.4230/LIPIcs.FSCD.2023.3</a>
</li>
<li>
    <span class="authors">Akihisa Yamada</span>
    <span class="title">Termination of Term Rewriting: Foundation, Formalization, Implementation, and Competition (Invited Talk)</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2023.4">10.4230/LIPIcs.FSCD.2023.4</a>
</li>
<li>
    <span class="authors">Taichi Uemura</span>
    <span class="title">Homotopy Type Theory as Internal Languages of Diagrams of ∞-Logoses</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2023.5">10.4230/LIPIcs.FSCD.2023.5</a>
</li>
<li>
    <span class="authors">Niels van der Weide</span>
    <span class="title">The Formal Theory of Monads, Univalently</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2023.6">10.4230/LIPIcs.FSCD.2023.6</a>
</li>
<li>
    <span class="authors">Théo Losekoot, Thomas Genet, and Thomas Jensen</span>
    <span class="title">Automata-Based Verification of Relational Properties of Functions over Algebraic Data Structures</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2023.7">10.4230/LIPIcs.FSCD.2023.7</a>
</li>
<li>
    <span class="authors">Thomas Ehrhard, Claudia Faggian, and Michele Pagani</span>
    <span class="title">The Sum-Product Algorithm For Quantitative Multiplicative Linear Logic</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2023.8">10.4230/LIPIcs.FSCD.2023.8</a>
</li>
<li>
    <span class="authors">Ievgen Ivanov</span>
    <span class="title">Generalized Newman’s Lemma for Discrete and Continuous Systems</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2023.9">10.4230/LIPIcs.FSCD.2023.9</a>
</li>
<li>
    <span class="authors">Nikolai Kudasov</span>
    <span class="title">E-Unification for Second-Order Abstract Syntax</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2023.10">10.4230/LIPIcs.FSCD.2023.10</a>
</li>
<li>
    <span class="authors">Pablo Barenbaum and Cristian Sottile</span>
    <span class="title">Two Decreasing Measures for Simply Typed λ-Terms</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2023.11">10.4230/LIPIcs.FSCD.2023.11</a>
</li>
<li>
    <span class="authors">Nao Hirokawa and Aart Middeldorp</span>
    <span class="title">Hydra Battles and AC Termination</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2023.12">10.4230/LIPIcs.FSCD.2023.12</a>
</li>
<li>
    <span class="authors">Lison Blondeau-Patissier, Pierre Clairambault, and Lionel Vaux Auclair</span>
    <span class="title">Strategies as Resource Terms, and Their Categorical Semantics</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2023.13">10.4230/LIPIcs.FSCD.2023.13</a>
</li>
<li>
    <span class="authors">Dan R. Ghica and George Kaye</span>
    <span class="title">Rewriting Modulo Traced Comonoid Structure</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2023.14">10.4230/LIPIcs.FSCD.2023.14</a>
</li>
<li>
    <span class="authors">Cynthia Kop and Deivid Vale</span>
    <span class="title">Cost-Size Semantics for Call-By-Value Higher-Order Rewriting</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2023.15">10.4230/LIPIcs.FSCD.2023.15</a>
</li>
<li>
    <span class="authors">Samuel Mimram</span>
    <span class="title">Categorical Coherence from Term Rewriting Systems</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2023.16">10.4230/LIPIcs.FSCD.2023.16</a>
</li>
<li>
    <span class="authors">Nicolas Behr, Paul-André Melliès, and Noam Zeilberger</span>
    <span class="title">Convolution Products on Double Categories and Categorification of Rule Algebras</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2023.17">10.4230/LIPIcs.FSCD.2023.17</a>
</li>
<li>
    <span class="authors">Rafaël Bocquet, Ambrus Kaposi, and Christian Sattler</span>
    <span class="title">For the Metatheory of Type Theory, Internal Sconing Is Enough</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2023.18">10.4230/LIPIcs.FSCD.2023.18</a>
</li>
<li>
    <span class="authors">José Espírito Santo and Filipa Mendes</span>
    <span class="title">The Logical Essence of Compiling with Continuations</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2023.19">10.4230/LIPIcs.FSCD.2023.19</a>
</li>
<li>
    <span class="authors">Ugo Dal Lago, Naohiko Hoshino, and Paolo Pistone</span>
    <span class="title">On the Lattice of Program Metrics</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2023.20">10.4230/LIPIcs.FSCD.2023.20</a>
</li>
<li>
    <span class="authors">Flavien Breuvart, Marie Kerjean, and Simon Mirwasser</span>
    <span class="title">Unifying Graded Linear Logic and Differential Operators</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2023.21">10.4230/LIPIcs.FSCD.2023.21</a>
</li>
<li>
    <span class="authors">Samuel Frontull, Georg Moser, and Vincent van Oostrom</span>
    <span class="title">α-Avoidance</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2023.22">10.4230/LIPIcs.FSCD.2023.22</a>
</li>
<li>
    <span class="authors">Serenella Cerrito, Valentin Goranko, and Sophie Paillocher</span>
    <span class="title">Partial Model Checking and Partial Model Synthesis in LTL Using a Tableau-Based Approach</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2023.23">10.4230/LIPIcs.FSCD.2023.23</a>
</li>
<li>
    <span class="authors">Thorsten Altenkirch, Ambrus Kaposi, Artjoms Šinkarovs, and Tamás Végh</span>
    <span class="title">Combinatory Logic and Lambda Calculus Are Equal, Algebraically</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2023.24">10.4230/LIPIcs.FSCD.2023.24</a>
</li>
<li>
    <span class="authors">Francesco Dagnino and Fabio Pasquali</span>
    <span class="title">Quotients and Extensionality in Relational Doctrines</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2023.25">10.4230/LIPIcs.FSCD.2023.25</a>
</li>
<li>
    <span class="authors">Rémi Di Guardia and Olivier Laurent</span>
    <span class="title">Type Isomorphisms for Multiplicative-Additive Linear Logic</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2023.26">10.4230/LIPIcs.FSCD.2023.26</a>
</li>
<li>
    <span class="authors">Anupam Das and Lukas Melgaard</span>
    <span class="title">Cyclic Proofs for Arithmetical Inductive Definitions</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2023.27">10.4230/LIPIcs.FSCD.2023.27</a>
</li>
<li>
    <span class="authors">Emmanuel Beffara, Félix Castro, Mauricio Guillermo, and Étienne Miquey</span>
    <span class="title">Concurrent Realizability on Conjunctive Structures</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2023.28">10.4230/LIPIcs.FSCD.2023.28</a>
</li>
<li>
    <span class="authors">Daniele Pautasso and Simona Ronchi Della Rocca</span>
    <span class="title">A Quantitative Version of Simple Types</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2023.29">10.4230/LIPIcs.FSCD.2023.29</a>
</li>
<li>
    <span class="authors">Saraid Dwyer Satterfield, Serdar Erbatur, Andrew M. Marshall, and Christophe Ringeissen</span>
    <span class="title">Knowledge Problems in Security Protocols: Going Beyond Subterm Convergent Theories</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2023.30">10.4230/LIPIcs.FSCD.2023.30</a>
</li>
<li>
    <span class="authors">Didier Galmiche and Daniel Méry</span>
    <span class="title">Labelled Tableaux for Linear Time Bunched Implication Logic</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2023.31">10.4230/LIPIcs.FSCD.2023.31</a>
</li>
<li>
    <span class="authors">Valentin Blot</span>
    <span class="title">Diller-Nahm Bar Recursion</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2023.32">10.4230/LIPIcs.FSCD.2023.32</a>
</li>
<li>
    <span class="authors">James Laird</span>
    <span class="title">Dinaturality Meets Genericity: A Game Semantics of Bounded Polymorphism</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2023.33">10.4230/LIPIcs.FSCD.2023.33</a>
</li>
<li>
    <span class="authors">Sergey Goncharov</span>
    <span class="title">Representing Guardedness in Call-By-Value</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2023.34">10.4230/LIPIcs.FSCD.2023.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

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