default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID11th FSCD 2026: Lisbon, Portugal
- Frank Pfenning
:
11th International Conference on Formal Structures for Computation and Deduction, FSCD 2026, Lisbon, Portugal, July 20-23, 2026. LIPIcs 378, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2026, ISBN 978-3-95977-433-8 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xviii
- Danel Ahman, Andrej Bauer:
Sheaves as Oracle Computations (Invited Talk). 1:1-1:17 - Laura Kovács:
Saturation-Guided Inductive Synthesis (Invited Talk). 2:1-2:3 - Matteo Acclavio, Lutz Straßburger, Vladimir Zamdzhiev:
Proof Identity and Categorical Models of BV. 3:1-3:24 - Danel Ahman, Ilja Sobolev:
Strong Normalisation for Asynchronous Effects. 4:1-4:22 - Martin Baillon, Yannick Forster, Dominik Kirst, Assia Mahboubi, Pierre-Marie Pédrot:
Not Choosing Is Still a Choice: Constructive mathematics without any choice. 5:1-5:23 - Colin Blake:
Simpler Presentations for Many Fragments of Quantum Circuits. 6:1-6:20 - Robert I. Booth, Titouan Carette, Cole Comfort:
Graphical Symplectic Algebra. 7:1-7:22 - Robert I. Booth, Cole Comfort:
Denotational Semantics for Stabiliser Quantum Programs. 8:1-8:24 - Antonio Bucciarelli, Arturo De Faveri, Giulio Manzonetto, Antonino Salibra:
Groups and Inverse Semigroups in Lambda Calculus. 9:1-9:22 - Ali K. Caires-Santos, Maribel Fernández, Murdoch James Gabbay, Daniele Nantes-Sobrinho:
Equational Reasoning in Languages with Binders via Permutation Fixed-Points. 10:1-10:23 - Kostia Chardonnet, Jules Chouquet, Axel Kerinec:
Approximation Theory for Distant Bang Calculus. 11:1-11:20 - Kostia Chardonnet, Emmanuel Hainry, Romain Péchoux, Thomas Vinet:
Resource-Aware Quantum Programming with General Recursion and Quantum Control. 12:1-12:20 - Liron Cohen, Tomer Samara:
Evidence-Tracked Tape Semantics for Probabilistic Computation. 13:1-13:20 - Raja O. P. Damanik, Alwen Tiu:
How Term Rewriting Structures Shape the Decidability of Knowledge Problems. 14:1-14:20 - Anupam Das, Abhishek De, Stepan L. Kuznetsov:
Undecidability for Semirings with Fixed Points. 15:1-15:18 - Rémi Di Guardia, Thomas Ehrhard, Claudia Faggian:
Quantum Bayesian Networks: Compositionality and Typing via Linear Logic. 16:1-16:23 - Andrej Dudenhefner, Aleksy Schubert, Jakob Rehof:
A Bounded Parallel Intersection Type System. 17:1-17:17 - Nathan Guermond, Gopalan Nadathur:
Ground Stratified Inductive Definitions. 18:1-18:21 - Misaki Kojima, Naoki Nishida:
Abstract Framework for All-Path Reachability Analysis toward Safety and Liveness Verification. 19:1-19:23 - Piotr Kozicki, G. A. Kavvos:
Relational Dualities and Bisimulation. 20:1-20:18 - Bastiaan Laarakker, Daniël Otten, Benno van den Berg:
Constructing (Co)inductive Types via Large Sizes. 21:1-21:23 - Olivier Laurent, Jui-Hsuan Wu:
Non-Wellfounded Derivations for Intersection Subtyping with Fixpoints. 22:1-22:20 - Serge Lechenne, Hugo Paquet:
Universal Properties of Petri Net Unfoldings. 23:1-23:19 - Dale Miller:
Treating Congruences as Equalities Within Proofs. 24:1-24:17 - Yoshiki Nakamura:
The Equational Theory of Relational Kleene Algebra with Graph Loop is PSPACE-Complete. 25:1-25:19 - Josselin Poiret, Kenji Maillard, Nicolas Tabareau:
Divide and Check: Logical Relations, No Algorithms Attached. 26:1-26:23 - Rhea Ranalter, Florian Rabe, Cezary Kaliszyk:
Polymorphism Meets DHOL. 27:1-27:21 - Colin Riba, Adam Donadille:
A Complete Finitary Refinement Type System for Scott-Open Properties. 28:1-28:18 - Christine Tasson, Aymeric Walch:
Absolute Convergence and Taylor Expansion in Web Based Models of Linear Logic. 29:1-29:23 - Kazushige Terui:
On the Consistency of Naive Set Theories over Substructural and Fuzzy Logics. 30:1-30:20 - Constantine Theocharis, Edwin C. Brady:
Type Theory with Erasure. 31:1-31:21 - René Thiemann, Dieter Hofbauer, Ulysse Le Huitouze, Johannes Waldmann:
New and Formalized Proofs for Right-Forward Closures and Core Matrix Interpretations. 32:1-32:19 - Thomas Traversié, Olivier Hermant, Marc Aiguier:
Investigations on Higher-Order Infinitary Logic. 33:1-33:19 - Takeshi Tsukada, Kazuyuki Asada, Kengo Hirata:
Stabilized Profunctors and Matrix Representation. 34:1-34:18
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 2026-08-09 22:55 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
