Abstract is missing.
- A Modular Associative Commutative (AC) Congruence Closure AlgorithmDeepak Kapur. [doi]
- Z; Syntax-Free DevelopmentsVincent van Oostrom. [doi]
- Coalgebra Encoding for Efficient MinimizationHans-Peter Deifel, Stefan Milius, Thorsten Wißmann. [doi]
- What's Decidable About (Atomic) Polymorphism?Paolo Pistone, Luca Tranchini. [doi]
- Recursion and Sequentiality in Categories of SheavesCristina Matache, Sean K. Moss, Sam Staton. [doi]
- Polymorphic Automorphisms and the Picard GroupPieter J. W. Hofstra, Jason Parker, Philip J. Scott. [doi]
- A Strong Call-By-Need CalculusThibaut Balabonski, Antoine Lanco, Guillaume Melquiond. [doi]
- Derivation of a Virtual Machine For Four Variants of Delimited-Control OperatorsMaika Fujii, Kenichi Asai. [doi]
- Completion and Reduction Orders (Invited Talk)Nao Hirokawa. [doi]
- Positional Injectivity for Innocent StrategiesLison Blondeau-Patissier, Pierre Clairambault. [doi]
- The Expressive Power of One Variable Used Once: The Chomsky Hierarchy and First-Order Monadic Constructor RewritingJakob Grue Simonsen. [doi]
- Church's Semigroup Is Sq-UniversalRick Statman. [doi]
- Duality in Action (Invited Talk)Paul Downen, Zena M. Ariola. [doi]
- Front Matter, Table of Contents, Preface, Conference Organization [doi]
- New Minimal Linear Inferences in Boolean Logic Independent of Switch and MedialAnupam Das 0002, Alex A. Rice. [doi]
- Synthetic Undecidability of MSELL via FRACTRAN Mechanised in CoqDominique Larchey-Wendling. [doi]
- Some Formal Structures in Probability (Invited Talk)Sam Staton. [doi]
- Abstract Clones for Abstract SyntaxNathanael Arkor, Dylan McDermott. [doi]
- Process-As-Formula Interpretation: A Substructural Multimodal View (Invited Talk)Elaine Pimentel, Carlos Olarte, Vivek Nigam. [doi]
- Call-By-Value, Again!Axel Kerinec, Giulio Manzonetto, Simona Ronchi Della Rocca. [doi]
- Tuple Interpretations for Higher-Order ComplexityCynthia Kop, Deivid Vale. [doi]
- A Bicategorical Model for Finite NondeterminismZeinab Galal. [doi]
- A Functional Abstraction of Typed Invocation ContextsYouyou Cong, Chiaki Ishio, Kaho Honda, Kenichi Asai. [doi]
- Beth Semantics and Labelled Deduction for Intuitionistic Sentential Calculus with IdentityDidier Galmiche, Marta Gawek, Daniel Méry. [doi]
- Some Axioms for MathematicsFrédéric Blanqui, Gilles Dowek, Émilie Grienenberger, Gabriel Hondet, François Thiré. [doi]
- An RPO-Based Ordering Modulo Permutation Equations and Its Applications to Rewrite SystemsDohan Kim 0001, Christopher Lynch. [doi]
- Predicative Aspects of Order Theory in Univalent FoundationsTom de Jong, Martín Hötzel Escardó. [doi]
- Type-Theoretic Constructions of the Final Coalgebra of the Finite Powerset FunctorNiccolò Veltri. [doi]
- Non-Deterministic Functions as Non-Deterministic ProcessesJoseph W. N. Paulus, Daniele Nantes Sobrinho, Jorge A. Pérez 0001. [doi]
- Resource Transition Systems and Full Abstraction for Linear Higher-Order Effectful ProgramsUgo Dal Lago, Francesco Gavazzo. [doi]
- On the Logical Strength of Confluence and Normalisation for Cyclic ProofsAnupam Das 0002. [doi]
- Failure of Cut-Elimination in the Cyclic Proof System of Bunched Logic with Inductive PropositionsKenji Saotome, Koji Nakazawa, Daisuke Kimura. [doi]
- Output Without Delay: A π-Calculus Compatible with Categorical SemanticsKen Sakayori, Takeshi Tsukada. [doi]