Kostia Chardonnet, Jules Chouquet and Axel Kerinec. Approximation theory for distant Bang calculus
Andrej Dudenhefner, Aleksy Schubert and Jakob Rehof. A Bounded Parallel Intersection Type System
Colin BLAKE. Simpler Presentations for Many Fragments of Quantum Circuits
Robert I. Booth, Titouan Carette and Cole Comfort. Graphical Symplectic Algebra
Kostia Chardonnet, Emmanuel Hainry, Romain Péchoux and Thomas Vinet. Resource-Aware Quantum Programming with General Recursion and Quantum Control
Bastiaan Laarakker, Daniël Otten and Benno van den Berg. Constructing (Co)inductive Types via Large Sizes
Raja Damanik and Alwen Tiu. How Term Rewriting Structures Shape the Decidability of Knowledge Problems
Thomas Traversié, Olivier Hermant and Marc Aiguier. Investigations on Higher-Order Infinitary Logic
Constantine Theocharis and Edwin Brady. Type Theory with Erasure
Christine Tasson and Aymeric Walch. Absolute convergence and Taylor expansion in web based models of linear logic
Danel Ahman and Ilja Sobolev. Strong Normalisation for Asynchronous Effects
Misaki Kojima and Naoki Nishida. Abstract Framework for All-Path Reachability Analysis toward Safety and Liveness Verification
Daniel Ranalter, Florian Rabe and Cezary Kaliszyk. Polymorphism Meets Dependently Typed Higher-Order Logic
Antonio Bucciarelli, Arturo De Faveri, Giulio Manzonetto and Antonino Salibra. Groups and Inverse Semigroups in Lambda Calculus
Colin Riba and Adam Donadille. A Complete Finitary Refinement Type System for Scott-Open Properties
Martin Baillon, Yannick Forster, Dominik Kirst, Assia Mahboubi and Pierre-marie Pédrot. Not choosing is still a choice: Constructive mathematics without any choice
Olivier Laurent and Jui-Hsuan Wu. Non-Wellfounded Derivations for Intersection Subtyping with Fixpoints
Anupam Das, Abhishek De and Stepan L. Kuznetsov. Undecidability for semirings with fixed points
Josselin Poiret, Kenji Maillard and Nicolas Tabareau. Divide and Check: Logical Relations, No Algorithms Attached
Cole Comfort and Robert Booth. Denotational semantics for stabiliser quantum programs
Takeshi Tsukada, Kazuyuki Asada and Kengo Hirata. Stable Profunctors and Matrix Representation
Matteo Acclavio, Lutz Strassburger and Vladimir Zamdzhiev. Proof Identity and Categorical Models of BV
Piotr Kozicki and G. A. Kavvos. Relational Dualities and Bisimulation
Ali K. Caires-Santos, Maribel Fernández, Murdoch James Gabbay and Daniele Nantes-Sobrinho. Equational Reasoning in Languages with Binders via Permutation Fixed-Points
Remi Di Guardia, Thomas Ehrhard and Claudia Faggian. Quantum Bayesian Networks: Compositionality and Typing via Linear Logic
Serge Lechenne and Hugo Paquet. The Universal Property of Petri Net Unfoldings
Kazushige Terui. On the consistency of naive set theories over substructural and fuzzy logics
Liron Cohen and Tomer Samara. Evidence-Tracked Tape Semantics for Probabilistic Computation
Nathan Guermond and Gopalan Nadathur. Ground Stratified Inductive Definitions
René Thiemann, Dieter Hofbauer, Ulysse Le Huitouze and Johannes Waldmann. New and Formalized Proofs for Right-Forward Closures and Core Matrix Interpretations
Dale Miller. Treating congruences as equalities within proofs
Yoshiki Nakamura. The Equational Theory of Relational Kleene Algebra with Graph Loop is PSPACE-Complete
Danel Ahman and Andrej Bauer. Sheaves as Oracle Computations (Invited Talk)
Laura Kovács. Saturation-Guided Inductive Synthesis (Invited Talk)