![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
8th FSCD 2023: Rome, Italy
- Marco Gaboardi, Femke van Raamsdonk:
8th International Conference on Formal Structures for Computation and Deduction, FSCD 2023, July 3-6, 2023, Rome, Italy. LIPIcs 260, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-277-8 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:18
- Maribel Fernández:
Nominal Techniques for Software Specification and Verification (Invited Talk). 1:1-1:4 - Mateja Jamnik:
How Can We Make Trustworthy AI? (Invited Talk). 2:1-2:1 - Giulio Manzonetto:
A Lambda Calculus Satellite (Invited Talk). 3:1-3:14 - Akihisa Yamada:
Termination of Term Rewriting: Foundation, Formalization, Implementation, and Competition (Invited Talk). 4:1-4:5 - Taichi Uemura
:
Homotopy Type Theory as Internal Languages of Diagrams of ∞-Logoses. 5:1-5:19 - Niels van der Weide:
The Formal Theory of Monads, Univalently. 6:1-6:23 - Théo Losekoot, Thomas Genet, Thomas P. Jensen:
Automata-Based Verification of Relational Properties of Functions over Algebraic Data Structures. 7:1-7:22 - Thomas Ehrhard, Claudia Faggian, Michele Pagani:
The Sum-Product Algorithm For Quantitative Multiplicative Linear Logic. 8:1-8:18 - Ievgen Ivanov:
Generalized Newman's Lemma for Discrete and Continuous Systems. 9:1-9:17 - Nikolai Kudasov
:
E-Unification for Second-Order Abstract Syntax. 10:1-10:22 - Pablo Barenbaum, Cristian Sottile:
Two Decreasing Measures for Simply Typed λ-Terms. 11:1-11:19 - Nao Hirokawa, Aart Middeldorp:
Hydra Battles and AC Termination. 12:1-12:16 - Lison Blondeau-Patissier, Pierre Clairambault, Lionel Vaux Auclair:
Strategies as Resource Terms, and Their Categorical Semantics. 13:1-13:22 - Dan R. Ghica, George Kaye:
Rewriting Modulo Traced Comonoid Structure. 14:1-14:21 - Cynthia Kop, Deivid Vale
:
Cost-Size Semantics for Call-By-Value Higher-Order Rewriting. 15:1-15:19 - Samuel Mimram:
Categorical Coherence from Term Rewriting Systems. 16:1-16:17 - Nicolas Behr, Paul-André Melliès, Noam Zeilberger:
Convolution Products on Double Categories and Categorification of Rule Algebras. 17:1-17:20 - Rafaël Bocquet, Ambrus Kaposi, Christian Sattler:
For the Metatheory of Type Theory, Internal Sconing Is Enough. 18:1-18:23 - José Espírito Santo
, Filipa Mendes:
The Logical Essence of Compiling with Continuations. 19:1-19:21 - Ugo Dal Lago, Naohiko Hoshino, Paolo Pistone:
On the Lattice of Program Metrics. 20:1-20:19 - Flavien Breuvart, Marie Kerjean, Simon Mirwasser:
Unifying Graded Linear Logic and Differential Operators. 21:1-21:21 - Samuel Frontull, Georg Moser
, Vincent van Oostrom
:
α-Avoidance. 22:1-22:22 - Serenella Cerrito, Valentin Goranko, Sophie Paillocher:
Partial Model Checking and Partial Model Synthesis in LTL Using a Tableau-Based Approach. 23:1-23:21 - Thorsten Altenkirch, Ambrus Kaposi, Artjoms Sinkarovs, Tamás Végh:
Combinatory Logic and Lambda Calculus Are Equal, Algebraically. 24:1-24:19 - Francesco Dagnino, Fabio Pasquali:
Quotients and Extensionality in Relational Doctrines. 25:1-25:23 - Rémi Di Guardia, Olivier Laurent:
Type Isomorphisms for Multiplicative-Additive Linear Logic. 26:1-26:21 - Anupam Das, Lukas Melgaard:
Cyclic Proofs for Arithmetical Inductive Definitions. 27:1-27:18 - Emmanuel Beffara, Félix Castro, Mauricio Guillermo, Étienne Miquey:
Concurrent Realizability on Conjunctive Structures. 28:1-28:21 - Daniele Pautasso
, Simona Ronchi Della Rocca:
A Quantitative Version of Simple Types. 29:1-29:21 - Saraid Dwyer Satterfield, Serdar Erbatur, Andrew M. Marshall
, Christophe Ringeissen:
Knowledge Problems in Security Protocols: Going Beyond Subterm Convergent Theories. 30:1-30:19 - Didier Galmiche, Daniel Méry:
Labelled Tableaux for Linear Time Bunched Implication Logic. 31:1-31:17 - Valentin Blot:
Diller-Nahm Bar Recursion. 32:1-32:16 - James Laird:
Dinaturality Meets Genericity: A Game Semantics of Bounded Polymorphism. 33:1-33:16 - Sergey Goncharov:
Representing Guardedness in Call-By-Value. 34:1-34:21
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.