FLOC 2022: FEDERATED LOGIC CONFERENCE 2022

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

Disclaimer | Powered by EasyChair Smart Program