Realizability without Symmetry
Haruka Tomita
Pregrammars and Intersection Types
Sabine Broda
Canonization for Bounded and Dihedral Color Classes in Choiceless Polynomial Time
Moritz Lichter and Pascal Schweitzer
On the Complexity of Horn and Krom Fragments of Second-Order Boolean Logic
Miika Hannula, Juha Kontinen, Martin Lück and Jonni Virtema
A Quasi-Polynomial Black-Box Algorithm for Fixed Point Evaluation
André Arnold, Damian Niwiński and Paweł Parys
Learning Concepts Described by Weight Aggregation Logic
Steffen van Bergerem and Nicole Schweikardt
Decidable Entailments in Separation Logic with Inductive Definitions
Mnacho Echenim, Radu Iosif and Nicolas Peltier
Choiceless Computation and Symmetry: Limitations of Definability
Benedikt Pago
The Alternating-Time µ-Calculus With Disjunctive Explicit Strategies
Merlin Göttlinger, Lutz Schröder and Dirk Pattinson
Computing measure as a primitive operation in real number computation
Christine Gaßner, Arno Pauly and Florian Steinberg
Extension Preservation in the Finite and Prefix Classes of First Order Logic
Anuj Dawar and Abhisekh Sankaran
The best a monitor can do
Luca Aceto, Antonis Achilleos, Adrian Francalanza, Anna Ingolfsdottir and Karoliina Lehtinen
Game Comonads & Generalised Quantifiers
Adam Ó Conghaile and Anuj Dawar
Domain Theory in Constructive and Predicative Univalent Foundations
Tom de Jong and Martin Escardó
Compositional modelling of games on networks
Elena Di Lavore, Jules Hedges and Paweł Sobociński
Open Bar - a Brouwerian Intuitionistic Logic with a Pinch of Excluded Middle
Mark Bickford, Liron Cohen, Robert Constable and Vincent Rahli
Factorize Factorization
Beniamino Accattoli, Claudia Faggian and Giulio Guerrieri
Discounted-Sum Automata with Multiple Discount Factors
Udi Boker and Guy Hefetz
Semiring Provenance for Fixed-Point Logic
Katrin Martine Dannert, Erich Grädel, Matthias Naaf and Val Tannen
Are Two Binary Operators Necessary to Finitely Axiomatise Parallel Composition?
Luca Aceto, Valentina Castiglioni, Wan Fokkink, Anna Ingolfsdottir and Bas Luttik
Typable Fragments of Polynomial Automatic Amortized Resource Analysis
Long Pham and Jan Hoffmann
A Cyclic Proof System for HFLN
Mayuko Kori, Takeshi Tsukada and Naoki Kobayashi
Realizability with stateful computations for nonstandard analysis
Bruno Dinis and Étienne Miquey
Preservation Theorems Through the Lens of Topology
Aliaume Lopez
On flat lossy channel machines
Philippe Schnoebelen
The Yoneda Reduction of Polymorphic Types
Paolo Pistone and Luca Tranchini
A Partial Metric Semantics of Higher-Order Types and Approximate Program Transformations
Guillaume Geoffroy and Paolo Pistone
A Deep Quantitative Type System
Willem Heijltjes, Giulio Guerrieri and Joseph Paulus
The logic of contextuality
Samson Abramsky and Rui Soares Barbosa
Reachability in Distributed Memory Automata
Benedikt Bollig, Fedor Ryabinin and Arnaud Sangnier
Learning automata and transducers: a categorical approach
Thomas Colcombet, Daniela Petrisan and Riccardo Stabile
Degrees of Ambiguity for Parity Tree Automata
Alexander Rabinovich and Doron Tiferet
Categorifying Non-Idempotent Intersection Types
Giulio Guerrieri and Federico Olimpieri
Church’s thesis and related axioms in Coq’s type theory
Yannick Forster