


default search action
10th FSCD 2025: Birmingham, UK
- Maribel Fernández

:
10th International Conference on Formal Structures for Computation and Deduction, FSCD 2025, Birmingham, UK, July 14-20, 2025. LIPIcs 337, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2025, ISBN 978-3-95977-374-4 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xviii

- Liron Cohen:

Computation First: Rebuilding Constructivism with Effects (Invited Talk). 1:1-1:20 - Matthew L. Daggitt

, Wen Kokke, Robert Atkey, Ekaterina Komendantskaya, Natalia Slusarz, Luca Arnaboldi:
Vehicle: Bridging the Embedding Gap in the Verification of Neuro-Symbolic Programs (Invited Talk). 2:1-2:20 - Mariangiola Dezani-Ciancaglini, Paola Giannini, Furio Honsell:

Unsolvable Terms in Filter Models (Invited Talk). 3:1-3:24 - C. B. Aberlé, Karl Crary, Chris Martens, Frank Pfenning:

Substructural Parametricity. 4:1-4:21 - Beniamino Accattoli, Francesco Magliocca, Loïc Peyrot, Claudio Sacerdoti Coen:

The Cost of Skeletal Call-By-Need, Smoothly. 5:1-5:22 - Emma Ahrens

, Jan-Christoph Kassing
, Jürgen Giesl, Joost-Pieter Katoen:
Weighted Rewriting: Semiring Semantics for Abstract Reduction Systems. 6:1-6:21 - Mauricio Ayala-Rincón, David M. Cerna, Temur Kutsia, Christophe Ringeissen:

Combining Generalization Algorithms in Regular Collapse-Free Theories. 7:1-7:18 - Franz Baader

, Oliver Fernández Gil
:
The Unification Type of an Equational Theory May Depend on the Instantiation Preorder. 8:1-8:24 - Martin Baillon, Yannick Forster, Assia Mahboubi, Pierre-Marie Pédrot, Matthieu Piquerez:

A Zoo of Continuity Properties in Constructive Type Theory. 9:1-9:20 - Flavien Breuvart, Hugo Paquet:

Categorical Continuation Semantics for Concurrency. 10:1-10:21 - Steven Bronsveld, Herman Geuvers, Niels van der Weide:

Impredicative Encodings of Inductive and Coinductive Types. 11:1-11:22 - Rémy Cerda

, Giulio Manzonetto, Alexis Saurin:
Ohana Trees and Taylor Expansion for the λI-Calculus: No variable gets left behind or forgotten! 12:1-12:20 - Baptiste Chanus, Damiano Mazza, Morgan Rogers:

Unifying Boolean and Algebraic Descriptive Complexity. 13:1-13:22 - Liron Cohen, Ariel Grunfeld, Dominik Kirst, Étienne Miquey:

From Partial to Monadic: Combinatory Algebra with Effects. 14:1-14:22 - Ugo Dal Lago, Naohiko Hoshino, Paolo Pistone:

On the Metric Nature of (Differential) Logical Relations. 15:1-15:22 - Rémi Di Guardia, Olivier Laurent, Lorenzo Tortora de Falco, Lionel Vaux Auclair:

Yeo's Theorem for Locally Colored Graphs: the Path to Sequentialization in Linear Logic. 16:1-16:18 - Andrej Dudenhefner:

Mechanized Undecidability of Higher-Order Beta-Matching. 17:1-17:15 - Serdar Erbatur, Andrew M. Marshall

, Paliath Narendran, Christophe Ringeissen:
Knowledge Problems vs Unification and Matching: Dichotomy Results. 18:1-18:17 - Martín Hötzel Escardó, Bruno da Rocha Paiva, Vincent Rahli, Ayberk Tosun:

Internal Effectful Forcing in System T. 19:1-19:17 - Carsten Fuhs, Liye Guo, Cynthia Kop:

An Innermost DP Framework for Constrained Higher-Order Rewriting. 20:1-20:24 - Dilian Gurov, Reiner Hähnle:

An Expressive Trace Logic for Recursive Programs. 21:1-21:22 - Emmanuel Hainry, Romain Péchoux, Mário Silva

:
Branch Sequentialization in Quantum Polytime. 22:1-22:22 - Eliès Harington, Samuel Mimram:

∞-Categorical Models of Linear Logic. 23:1-23:20 - Willem Heijltjes

:
Quantitative Types for the Functional Machine Calculus. 24:1-24:20 - Ievgen Ivanov:

Completeness of the Decreasing Diagrams Method for Proving Confluence of Rewriting Systems of the Least Uncountable Cardinality. 25:1-25:20 - Marie Kerjean, Valentin Maestracci, Morgan Rogers:

Functorial Models of Differential Linear Logic. 26:1-26:17 - Meven Lennon-Bertrand:

What Does It Take to Certify a Conversion Checker? 27:1-27:23 - Dylan McDermott:

Grading Call-By-Push-Value, Explicitly and Implicitly. 28:1-28:19 - Dale Miller:

Linear Logic Using Negative Connectives. 29:1-29:22 - Samuel Mimram, Émile Oleon:

Coherent Tietze Transformations of 1-Polygraphs in Homotopy Type Theory. 30:1-30:17 - Luc Passemard, Amazigh Amrane, Uli Fahrenberg:

Higher-Dimensional Automata: Extension to Infinite Tracks. 31:1-31:23 - Alexis Saurin:

Interpolation as Cut-Introduction: On the Computational Content of Craig-Lyndon Interpolation. 32:1-32:21 - Sergei Stepanenko, Amin Timany

:
Solving Guarded Domain Equations in Presheaves over Ordinals and Mechanizing It. 33:1-33:24 - Thomas Traversié:

Monad Translations for Higher-Order Logic. 34:1-34:14

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














