default search action
7th FSCD 2022: Haifa, Israel
- Amy P. Felty
:
7th International Conference on Formal Structures for Computation and Deduction, FSCD 2022, August 2-5, 2022, Haifa, Israel. LIPIcs 228, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-233-4 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:18
- Cynthia Kop:
Cutting a Proof into Bite-Sized Chunks: Incrementally proving termination in higher-order term rewriting (Invited Talk). 1:1-1:17 - Alwen Tiu:
A Methodology for Designing Proof Search Calculi for Non-Classical Logics (Invited Talk). 2:1-2:4 - Francesco Dagnino, Francesco Gavazzo
A Fibrational Tale of Operational Logical Relations. 3:1-3:21 - Ugo Dal Lago, Furio Honsell, Marina Lenisa, Paolo Pistone:
On Quantitative Algebraic Higher-Order Theories. 4:1-4:18 - Jonathan Sterling
Sheaf Semantics of Termination-Insensitive Noninterference. 5:1-5:19 - Serdar Erbatur, Andrew M. Marshall
Combined Hierarchical Matching: the Regular Case. 6:1-6:22 - Manfred Schmidt-Schauß, Daniele Nantes-Sobrinho
Nominal Anti-Unification with Atom-Variables. 7:1-7:22 - Mauricio Ayala-Rincón, Maribel Fernández, Gabriel Ferreira Silva, Daniele Nantes Sobrinho:
A Certified Algorithm for AC-Unification. 8:1-8:21 - Marc Hermes
An Analysis of Tennenbaum's Theorem in Constructive Type Theory. 9:1-9:19 - Liron Cohen, Vincent Rahli
Constructing Unprejudiced Extensional Type Theories with Choices via Modalities. 10:1-10:23 - Samuel Mimram, Émile Oleon:
Division by Two, in Homotopy Type Theory. 11:1-11:17 - Siva Somayyajula, Frank Pfenning:
Type-Based Termination for Futures. 12:1-12:21 - Emmanuel Jeandel, Simon Perdrix, Margarita Veshchezerova:
Addition and Differentiation of ZX-Diagrams. 13:1-13:19 - Jan Bessai, Lukasz Czajka, Felix Laarmann
Restricting Tree Grammars with Term Rewriting. 14:1-14:19 - Nariyoshi Chida, Tachio Terauchi:
On Lookaheads in Regular Expressions with Backreferences. 15:1-15:18 - Andrej Dudenhefner
Certified Decision Procedures for Two-Counter Machines. 16:1-16:18 - Claudia Faggian, Giulio Guerrieri
Strategies for Asymptotic Normalization. 17:1-17:24 - Delia Kesner, Loïc Peyrot
Solvability for Generalized Applications. 18:1-18:22 - Willem B. Heijltjes
Normalization Without Syntax. 19:1-19:19 - Anupam Das
Decision Problems for Linear Logic with Least and Greatest Fixed Points. 20:1-20:20 - Alejandro Díaz-Caro, Gilles Dowek:
Linear Lambda-Calculus is Linear. 21:1-21:17 - Matteo Acclavio
A Graphical Proof Theory of Logical Time. 22:1-22:25 - Daniel Gratzer
A Stratified Approach to Löb Induction. 23:1-23:22 - Frédéric Blanqui:
Encoding Type Universes Without Using Matching Modulo Associativity and Commutativity. 24:1-24:14 - Thiago Felicissimo:
Adequate and Computational Encodings in the Logical Framework Dedukti. 25:1-25:18 - Clément Aubert
mwp-Analysis Improvement and Implementation: Realizing Implicit Computational Complexity. 26:1-26:23 - Fabian Mitterwallner, Aart Middeldorp:
Polynomial Termination Over ℕ Is Undecidable. 27:1-27:17 - Kiraku Shintani, Nao Hirokawa:
Compositional Confluence Criteria. 28:1-28:19 - Mario Alvarez-Picallo, Dan R. Ghica, David Sprunger, Fabio Zanasi
Rewriting for Monoidal Closed Categories. 29:1-29:20 - Sergey Goncharov, Stefan Milius, Lutz Schröder, Stelios Tsampas
Stateful Structural Operational Semantics. 30:1-30:19 - Marcelo Fiore, Zeinab Galal, Hugo Paquet:
A Combinatorial Approach to Higher-Order Structure for Polynomial Functors. 31:1-31:19 - Dylan McDermott
Galois Connecting Call-by-Value and Call-by-Name. 32:1-32:19
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-13 18:59 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: