<h2>LIPIcs, Volume 228, FSCD 2022</h2>
<ul>
<li>
<span class="authors">Amy P. Felty</span>
<span class="title">LIPIcs, Volume 228, FSCD 2022, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2022">10.4230/LIPIcs.FSCD.2022</a>
</li>
<li>
<span class="authors">Amy P. Felty</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2022.0">10.4230/LIPIcs.FSCD.2022.0</a>
</li>
<li>
<span class="authors">Cynthia Kop</span>
<span class="title">Cutting a Proof into Bite-Sized Chunks: Incrementally proving termination in higher-order term rewriting (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2022.1">10.4230/LIPIcs.FSCD.2022.1</a>
</li>
<li>
<span class="authors">Alwen Tiu</span>
<span class="title">A Methodology for Designing Proof Search Calculi for Non-Classical Logics (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2022.2">10.4230/LIPIcs.FSCD.2022.2</a>
</li>
<li>
<span class="authors">Francesco Dagnino and Francesco Gavazzo</span>
<span class="title">A Fibrational Tale of Operational Logical Relations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2022.3">10.4230/LIPIcs.FSCD.2022.3</a>
</li>
<li>
<span class="authors">Ugo Dal Lago, Furio Honsell, Marina Lenisa, and Paolo Pistone</span>
<span class="title">On Quantitative Algebraic Higher-Order Theories</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2022.4">10.4230/LIPIcs.FSCD.2022.4</a>
</li>
<li>
<span class="authors">Jonathan Sterling and Robert Harper</span>
<span class="title">Sheaf Semantics of Termination-Insensitive Noninterference</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2022.5">10.4230/LIPIcs.FSCD.2022.5</a>
</li>
<li>
<span class="authors">Serdar Erbatur, Andrew M. Marshall, and Christophe Ringeissen</span>
<span class="title">Combined Hierarchical Matching: the Regular Case</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2022.6">10.4230/LIPIcs.FSCD.2022.6</a>
</li>
<li>
<span class="authors">Manfred Schmidt-Schauß and Daniele Nantes-Sobrinho</span>
<span class="title">Nominal Anti-Unification with Atom-Variables</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2022.7">10.4230/LIPIcs.FSCD.2022.7</a>
</li>
<li>
<span class="authors">Mauricio Ayala-Rincón, Maribel Fernández, Gabriel Ferreira Silva, and Daniele Nantes Sobrinho</span>
<span class="title">A Certified Algorithm for AC-Unification</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2022.8">10.4230/LIPIcs.FSCD.2022.8</a>
</li>
<li>
<span class="authors">Marc Hermes and Dominik Kirst</span>
<span class="title">An Analysis of Tennenbaum’s Theorem in Constructive Type Theory</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2022.9">10.4230/LIPIcs.FSCD.2022.9</a>
</li>
<li>
<span class="authors">Liron Cohen and Vincent Rahli</span>
<span class="title">Constructing Unprejudiced Extensional Type Theories with Choices via Modalities</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2022.10">10.4230/LIPIcs.FSCD.2022.10</a>
</li>
<li>
<span class="authors">Samuel Mimram and Émile Oleon</span>
<span class="title">Division by Two, in Homotopy Type Theory</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2022.11">10.4230/LIPIcs.FSCD.2022.11</a>
</li>
<li>
<span class="authors">Siva Somayyajula and Frank Pfenning</span>
<span class="title">Type-Based Termination for Futures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2022.12">10.4230/LIPIcs.FSCD.2022.12</a>
</li>
<li>
<span class="authors">Emmanuel Jeandel, Simon Perdrix, and Margarita Veshchezerova</span>
<span class="title">Addition and Differentiation of ZX-Diagrams</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2022.13">10.4230/LIPIcs.FSCD.2022.13</a>
</li>
<li>
<span class="authors">Jan Bessai, Lukasz Czajka, Felix Laarmann, and Jakob Rehof</span>
<span class="title">Restricting Tree Grammars with Term Rewriting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2022.14">10.4230/LIPIcs.FSCD.2022.14</a>
</li>
<li>
<span class="authors">Nariyoshi Chida and Tachio Terauchi</span>
<span class="title">On Lookaheads in Regular Expressions with Backreferences</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2022.15">10.4230/LIPIcs.FSCD.2022.15</a>
</li>
<li>
<span class="authors">Andrej Dudenhefner</span>
<span class="title">Certified Decision Procedures for Two-Counter Machines</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2022.16">10.4230/LIPIcs.FSCD.2022.16</a>
</li>
<li>
<span class="authors">Claudia Faggian and Giulio Guerrieri</span>
<span class="title">Strategies for Asymptotic Normalization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2022.17">10.4230/LIPIcs.FSCD.2022.17</a>
</li>
<li>
<span class="authors">Delia Kesner and Loïc Peyrot</span>
<span class="title">Solvability for Generalized Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2022.18">10.4230/LIPIcs.FSCD.2022.18</a>
</li>
<li>
<span class="authors">Willem B. Heijltjes, Dominic J. D. Hughes, and Lutz Straßburger</span>
<span class="title">Normalization Without Syntax</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2022.19">10.4230/LIPIcs.FSCD.2022.19</a>
</li>
<li>
<span class="authors">Anupam Das, Abhishek De, and Alexis Saurin</span>
<span class="title">Decision Problems for Linear Logic with Least and Greatest Fixed Points</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2022.20">10.4230/LIPIcs.FSCD.2022.20</a>
</li>
<li>
<span class="authors">Alejandro Díaz-Caro and Gilles Dowek</span>
<span class="title">Linear Lambda-Calculus is Linear</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2022.21">10.4230/LIPIcs.FSCD.2022.21</a>
</li>
<li>
<span class="authors">Matteo Acclavio, Ross Horne, Sjouke Mauw, and Lutz Straßburger</span>
<span class="title">A Graphical Proof Theory of Logical Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2022.22">10.4230/LIPIcs.FSCD.2022.22</a>
</li>
<li>
<span class="authors">Daniel Gratzer and Lars Birkedal</span>
<span class="title">A Stratified Approach to Löb Induction</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2022.23">10.4230/LIPIcs.FSCD.2022.23</a>
</li>
<li>
<span class="authors">Frédéric Blanqui</span>
<span class="title">Encoding Type Universes Without Using Matching Modulo Associativity and Commutativity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2022.24">10.4230/LIPIcs.FSCD.2022.24</a>
</li>
<li>
<span class="authors">Thiago Felicissimo</span>
<span class="title">Adequate and Computational Encodings in the Logical Framework Dedukti</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2022.25">10.4230/LIPIcs.FSCD.2022.25</a>
</li>
<li>
<span class="authors">Clément Aubert, Thomas Rubiano, Neea Rusch, and Thomas Seiller</span>
<span class="title">mwp-Analysis Improvement and Implementation: Realizing Implicit Computational Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2022.26">10.4230/LIPIcs.FSCD.2022.26</a>
</li>
<li>
<span class="authors">Fabian Mitterwallner and Aart Middeldorp</span>
<span class="title">Polynomial Termination Over ℕ Is Undecidable</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2022.27">10.4230/LIPIcs.FSCD.2022.27</a>
</li>
<li>
<span class="authors">Kiraku Shintani and Nao Hirokawa</span>
<span class="title">Compositional Confluence Criteria</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2022.28">10.4230/LIPIcs.FSCD.2022.28</a>
</li>
<li>
<span class="authors">Mario Alvarez-Picallo, Dan Ghica, David Sprunger, and Fabio Zanasi</span>
<span class="title">Rewriting for Monoidal Closed Categories</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2022.29">10.4230/LIPIcs.FSCD.2022.29</a>
</li>
<li>
<span class="authors">Sergey Goncharov, Stefan Milius, Lutz Schröder, Stelios Tsampas, and Henning Urbat</span>
<span class="title">Stateful Structural Operational Semantics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2022.30">10.4230/LIPIcs.FSCD.2022.30</a>
</li>
<li>
<span class="authors">Marcelo Fiore, Zeinab Galal, and Hugo Paquet</span>
<span class="title">A Combinatorial Approach to Higher-Order Structure for Polynomial Functors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2022.31">10.4230/LIPIcs.FSCD.2022.31</a>
</li>
<li>
<span class="authors">Dylan McDermott and Alan Mycroft</span>
<span class="title">Galois Connecting Call-by-Value and Call-by-Name</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSCD.2022.32">10.4230/LIPIcs.FSCD.2022.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
Feedback for Dagstuhl Publishing