FSCD2022 Accepted Papers

Matteo Acclavio, Ross Horne, Sjouke Mauw and Lutz Straßburger. A Graphical Proof Theory of Logical Time
Ugo Dal Lago, Furio Honsell, Marina Lenisa and Paolo Pistone. On Quantitative Algebraic Higher-Order Theories
Daniel Gratzer and Lars Birkedal. A stratified approach to Lob induction
Willem Heijltjes, Dominic Hughes and Lutz Straßburger. Normalization without syntax
Delia Kesner and Loïc Peyrot. Solvability for Generalized Applications
Kiraku Shintani and Nao Hirokawa. Compositional Confluence Criteria
Marc Hermes and Dominik Kirst. An Analysis of Tennenbaum's Theorem in Constructive Type Theory
Claudia Faggian and Giulio Guerrieri. Strategies for Asymptotic Normalization
Mauricio Ayala-Rincón, Maribel Fernandez, Gabriel Ferreira Silva and Daniele Nantes-Sobrinho. A Certified Algorithm for AC-Unification
Samuel Mimram and Émile Oleon. Division by two, in homotopy type theory
David Sprunger, Dan Ghica, Fabio Zanasi and Mario Alvarez-Picallo. Rewriting for monoidal closed categories
Siva Somayyajula and Frank Pfenning. Type-Based Termination for Futures
Nariyoshi Chida and Tachio Terauchi. On Lookaheads in Regular Expressions with Backreferences
Andrej Dudenhefner. Certified Decision Procedures for Two-Counter Machines
Jonathan Sterling and Robert Harper. Sheaf semantics of termination-insensitive noninterference
Jan Bessai, Lukasz Czajka, Felix Laarmann and Jakob Rehof. Restricting tree grammars with term rewriting
Liron Cohen and Vincent Rahli. Constructing Unprejudiced Extensional Type Theories with Choices via Modalities
Francesco Dagnino and Francesco Gavazzo. A Fibrational Tale of Operational Logical Relations
Frédéric Blanqui. Encoding type universes without using matching modulo associativity and commutativity
Anupam Das, Abhishek De and Alexis Saurin. Decision problems for linear logic with least and greatest fixed points
Thiago Felicissimo. Adequate and computational encodings in the logical framework Dedukti
Alejandro Díaz-Caro and Gilles Dowek. Linear lambda-calculus is linear
Emmanuel Jeandel, Simon Perdrix and Margarita Veshchezerova. Addition and differentiation of ZX-diagrams
Sergey Goncharov, Stefan Milius, Lutz Schröder, Stelios Tsampas and Henning Urbat. Stateful Structural Operational Semantics
Fabian Mitterwallner and Aart Middeldorp. Polynomial Termination over N is Undecidable
Serdar Erbatur, Andrew M. Marshall and Christophe Ringeissen. Combined Hierarchical Matching: The Regular Case
Marcelo Fiore, Zeinab Galal and Hugo Paquet. A combinatorial approach to higher-order structure for polynomial functors
Clément Aubert, Thomas Rubiano, Neea Rusch and Thomas Seiller. mwp-Analysis Improvement and Implementation: Realizing Implicit Computational Complexity
Dylan McDermott and Alan Mycroft. Galois connecting call-by-value and call-by-name
Manfred Schmidt-Schauss and Daniele Nantes-Sobrinho. Nominal Anti-Unification with Atom-Variables
Niels Voorneveld. Runners for concurrent effectful programs