Abstract is missing.
- Pointers in Recursion: Exploring the TropicsPaulin Jacobé de Naurois. [doi]
- A Linear-Logical Reconstruction of Intuitionistic Modal Logic S4Yosuke Fukuda, Akira Yoshimizu. [doi]
- Differentials and Distances in Probabilistic Coherence SpacesThomas Ehrhard. [doi]
- Proof Normalisation in a Logic Identifying Isomorphic PropositionsAlejandro Díaz-Caro, Gilles Dowek. [doi]
- Probabilistic Rewriting: Normalization, Termination, and Unique Normal FormsClaudia Faggian. [doi]
- Extending Maximal Completion (Invited Talk)Sarah Winkler. [doi]
- Sparse Tiling Through Overlap Closures for Termination of String RewritingAlfons Geser, Dieter Hofbauer, Johannes Waldmann. [doi]
- Model Checking Strategy-Controlled Rewriting Systems (System Description)Rubén Rubio, Narciso Martí-Oliet, Isabel Pita, Alberto Verdejo. [doi]
- A Generic Framework for Higher-Order GeneralizationsDavid M. Cerna, Temur Kutsia. [doi]
- Bicategories in Univalent FoundationsBenedikt Ahrens, Dan Frumin, Marco Maggesi, Niels van der Weide. [doi]
- Template Games, Simple Games, and Day ConvolutionClovis Eberhart, Tom Hirschowitz, Alexis Laouar. [doi]
- The Delta-calculus: Syntax and TypesLuigi Liquori, Claude Stolze. [doi]
- Front Matter, Table of Contents, Preface, Conference Organization [doi]
- Towards the Average-Case Analysis of Substitution Resolution in Lambda-CalculusMaciej Bendkowski. [doi]
- Modular Specification of Monads Through Higher-Order PresentationsBenedikt Ahrens, André Hirschowitz, Ambroise Lafont, Marco Maggesi. [doi]
- On the Taylor Expansion of Probabilistic lambda-termsUgo Dal Lago, Thomas Leventis. [doi]
- Dependency Pairs Termination in Dependent Type Theory Modulo RewritingFrédéric Blanqui, Guillaume Genestier, Olivier Hermant. [doi]
- Modal Embeddings and Calling ParadigmsJosé Espírito Santo, Luís Pinto, Tarmo Uustalu. [doi]
- Cubical Syntax for Reflection-Free Extensional EqualityJonathan Sterling, Carlo Angiuli, Daniel Gratzer. [doi]
- Sequence Types for Hereditary PermutatorsPierre Vial. [doi]
- A Lower Bound of the Number of Rewrite Rules Obtained by Homological MethodsMirai Ikebuchi. [doi]
- A Linear Logical Framework in Hybrid (Invited Talk)Amy P. Felty. [doi]
- Gluing for Type TheoryAmbrus Kaposi, Simon Huber, Christian Sattler. [doi]
- Homotopy Canonicity for Cubical Type TheoryThierry Coquand, Simon Huber, Christian Sattler. [doi]
- Hilbert's Tenth Problem in CoqDominique Larchey-Wendling, Yannick Forster 0002. [doi]
- lambda!-calculus, Intersection Types, and InvolutionsAlberto Ciaffaglione, Pietro Di Gianantonio, Furio Honsell, Marina Lenisa, Ivan Scagnetto. [doi]
- Proof Nets for First-Order Additive Linear LogicWillem Heijltjes, Dominic J. D. Hughes, Lutz Straßburger. [doi]
- The Discriminating Power of the Let-In Operator in the Lazy Call-by-Name Probabilistic lambda-CalculusSimona Kasterovic, Michele Pagani. [doi]
- A Fresh Look at the lambda-Calculus (Invited Talk)Beniamino Accattoli. [doi]
- Deriving an Abstract Machine for Strong Call by NeedMalgorzata Biernacka, Witold Charatonik. [doi]
- Polymorphic Higher-Order TerminationLukasz Czajka 0001, Cynthia Kop. [doi]
- Typed Equivalence of Effect Handlers and Delimited ControlMaciej Piróg, Piotr Polesiuk, Filip Sieczkowski. [doi]
- Some Semantic Issues in Probabilistic Programming Languages (Invited Talk)Hongseok Yang. [doi]
- Guarded Recursion in Agda via Sized TypesNiccolò Veltri, Niels van der Weide. [doi]
- The Sub-Additives: A Proof Theory for Probabilistic Choice extending Linear LogicRoss Horne. [doi]