HTML Export for FSCD 2024

Copy to Clipboard Download

<h2>LIPIcs, Volume 299, FSCD 2024</h2>
<ul>
<li>
    <span class="authors">Jakob Rehof</span>
    <span class="title">LIPIcs, Volume 299, FSCD 2024, Complete Volume</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2024">10.4230/LIPIcs.FSCD.2024</a>
</li>
<li>
    <span class="authors">Jakob Rehof</span>
    <span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2024.0">10.4230/LIPIcs.FSCD.2024.0</a>
</li>
<li>
    <span class="authors">Delia Kesner, Victor Arrial, and Giulio Guerrieri</span>
    <span class="title">Meaningfulness and Genericity in a Subsuming Framework (Invited Talk)</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2024.1">10.4230/LIPIcs.FSCD.2024.1</a>
</li>
<li>
    <span class="authors">Filip Cano, Thomas A. Henzinger, Bettina Könighofer, Konstantin Kueffner, and Kaushik Mallik</span>
    <span class="title">Abstraction-Based Decision Making for Statistical Properties (Invited Talk)</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2024.2">10.4230/LIPIcs.FSCD.2024.2</a>
</li>
<li>
    <span class="authors">Sebastian Ullrich</span>
    <span class="title">Lean: Past, Present, and Future (Invited Talk)</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2024.3">10.4230/LIPIcs.FSCD.2024.3</a>
</li>
<li>
    <span class="authors">Niels van der Weide</span>
    <span class="title">Univalent Enriched Categories and the Enriched Rezk Completion</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2024.4">10.4230/LIPIcs.FSCD.2024.4</a>
</li>
<li>
    <span class="authors">Pablo Donato</span>
    <span class="title">The Flower Calculus</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2024.5">10.4230/LIPIcs.FSCD.2024.5</a>
</li>
<li>
    <span class="authors">Camil Champin, Samuel Mimram, and Émile Oleon</span>
    <span class="title">Delooping Generated Groups in Homotopy Type Theory</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2024.6">10.4230/LIPIcs.FSCD.2024.6</a>
</li>
<li>
    <span class="authors">Benoît Guillemet, Assia Mahboubi, and Matthieu Piquerez</span>
    <span class="title">Machine-Checked Categorical Diagrammatic Reasoning</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2024.7">10.4230/LIPIcs.FSCD.2024.7</a>
</li>
<li>
    <span class="authors">Andrej Dudenhefner and Daniele Pautasso</span>
    <span class="title">Mechanized Subject Expansion in Uniform Intersection Types for Perpetual Reductions</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2024.8">10.4230/LIPIcs.FSCD.2024.8</a>
</li>
<li>
    <span class="authors">Marie Kerjean and Jean-Simon Pacaud Lemay</span>
    <span class="title">Laplace Distributors and Laplace Transformations for Differential Categories</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2024.9">10.4230/LIPIcs.FSCD.2024.9</a>
</li>
<li>
    <span class="authors">Ambrus Kaposi and Szumi Xie</span>
    <span class="title">Second-Order Generalised Algebraic Theories: Signatures and First-Order Semantics</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2024.10">10.4230/LIPIcs.FSCD.2024.10</a>
</li>
<li>
    <span class="authors">Małgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet, and Alan Schmitt</span>
    <span class="title">Optimizing a Non-Deterministic Abstract Machine with Environments</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2024.11">10.4230/LIPIcs.FSCD.2024.11</a>
</li>
<li>
    <span class="authors">Victor Sannier and Patrick Baillot</span>
    <span class="title">A Linear Type System for L^p-Metric Sensitivity Analysis</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2024.12">10.4230/LIPIcs.FSCD.2024.12</a>
</li>
<li>
    <span class="authors">Teppei Saito and Nao Hirokawa</span>
    <span class="title">Simulating Dependency Pairs by Semantic Labeling</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2024.13">10.4230/LIPIcs.FSCD.2024.13</a>
</li>
<li>
    <span class="authors">G. A. Kavvos</span>
    <span class="title">Two-Dimensional Kripke Semantics I: Presheaves</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2024.14">10.4230/LIPIcs.FSCD.2024.14</a>
</li>
<li>
    <span class="authors">Junyoung Jang, Sophia Roshal, Frank Pfenning, and Brigitte Pientka</span>
    <span class="title">Adjoint Natural Deduction</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2024.15">10.4230/LIPIcs.FSCD.2024.15</a>
</li>
<li>
    <span class="authors">Franz Baader and Jürgen Giesl</span>
    <span class="title">On the Complexity of the Small Term Reachability Problem for Terminating Term Rewriting Systems</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2024.16">10.4230/LIPIcs.FSCD.2024.16</a>
</li>
<li>
    <span class="authors">Tao Gu, Jialu Bao, Justin Hsu, Alexandra Silva, and Fabio Zanasi</span>
    <span class="title">A Categorical Approach to DIBI Models</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2024.17">10.4230/LIPIcs.FSCD.2024.17</a>
</li>
<li>
    <span class="authors">Sohei Ito and Makoto Tatsuta</span>
    <span class="title">Representation of Peano Arithmetic in Separation Logic</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2024.18">10.4230/LIPIcs.FSCD.2024.18</a>
</li>
<li>
    <span class="authors">Kostia Chardonnet, Louis Lemonnier, and Benoît Valiron</span>
    <span class="title">Semantics for a Turing-Complete Reversible Programming Language with Inductive Types</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2024.19">10.4230/LIPIcs.FSCD.2024.19</a>
</li>
<li>
    <span class="authors">Mateo Torres-Ruiz, Robin Piedeleu, Alexandra Silva, and Fabio Zanasi</span>
    <span class="title">On Iteration in Discrete Probabilistic Programming</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2024.20">10.4230/LIPIcs.FSCD.2024.20</a>
</li>
<li>
    <span class="authors">Thiago Felicissimo and Théo Winterhalter</span>
    <span class="title">Impredicativity, Cumulativity and Product Covariance in the Logical Framework Dedukti</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2024.21">10.4230/LIPIcs.FSCD.2024.21</a>
</li>
<li>
    <span class="authors">Maximilian Doré, Evan Cavallo, and Anders Mörtberg</span>
    <span class="title">Automating Boundary Filling in Cubical Agda</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2024.22">10.4230/LIPIcs.FSCD.2024.22</a>
</li>
<li>
    <span class="authors">Beniamino Accattoli and Adrienne Lancelot</span>
    <span class="title">Mirroring Call-By-Need, or Values Acting Silly</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2024.23">10.4230/LIPIcs.FSCD.2024.23</a>
</li>
<li>
    <span class="authors">Beniamino Accattoli and Claudio Sacerdoti Coen</span>
    <span class="title">IMELL Cut Elimination with Linear Overhead</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2024.24">10.4230/LIPIcs.FSCD.2024.24</a>
</li>
<li>
    <span class="authors">Ralph Matthes, Kobe Wullaert, and Benedikt Ahrens</span>
    <span class="title">Substitution for Non-Wellfounded Syntax with Binders Through Monoidal Categories</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2024.25">10.4230/LIPIcs.FSCD.2024.25</a>
</li>
<li>
    <span class="authors">Hugo Herbelin and Jad Koleilat</span>
    <span class="title">On the Logical Structure of Some Maximality and Well-Foundedness Principles Equivalent to Choice Principles</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2024.26">10.4230/LIPIcs.FSCD.2024.26</a>
</li>
<li>
    <span class="authors">René Thiemann and Akihisa Yamada</span>
    <span class="title">A Verified Algorithm for Deciding Pattern Completeness</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2024.27">10.4230/LIPIcs.FSCD.2024.27</a>
</li>
<li>
    <span class="authors">Samson Abramsky, Şerban-Ion Cercelescu, and Carmen-Maria Constantin</span>
    <span class="title">Commutation Groups and State-Independent Contextuality</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2024.28">10.4230/LIPIcs.FSCD.2024.28</a>
</li>
<li>
    <span class="authors">Aloÿs Dufour and Damiano Mazza</span>
    <span class="title">Böhm and Taylor for All!</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2024.29">10.4230/LIPIcs.FSCD.2024.29</a>
</li>
<li>
    <span class="authors">Nathan Corbyn, Lukas Heidemann, Nick Hu, Chiara Sarti, Calin Tataru, and Jamie Vicary</span>
    <span class="title">homotopy.io: A Proof Assistant for Finitely-Presented Globular n-Categories</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2024.30">10.4230/LIPIcs.FSCD.2024.30</a>
</li>
<li>
    <span class="authors">Takahito Aoto, Naoki Nishida, and Jonas Schöpf</span>
    <span class="title">Equational Theories and Validity for Logically Constrained Term Rewriting</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2024.31">10.4230/LIPIcs.FSCD.2024.31</a>
</li>
<li>
    <span class="authors">Salvador Lucas</span>
    <span class="title">Termination of Generalized Term Rewriting Systems</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2024.32">10.4230/LIPIcs.FSCD.2024.32</a>
</li>
<li>
    <span class="authors">Mateus de Oliveira Oliveira and Farhad Vadiee</span>
    <span class="title">State Canonization and Early Pruning in Width-Based Automated Theorem Proving</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2024.33">10.4230/LIPIcs.FSCD.2024.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

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