Abstract is missing.
- A Polynomial-Time Algorithm for the Lambek Calculus with Brackets of Bounded OrderMax I. Kanovich, Stepan Kuznetsov, Glyn Morrill, Andre Scedrov. [doi]
- Is the Optimal Implementation Inefficient? Elementarily NotStefano Guerrini, Marco Solieri. [doi]
- Infinite Runs in Abstract CompletionNao Hirokawa, Aart Middeldorp, Christian Sternagel, Sarah Winkler. [doi]
- The Complexity of Principal InhabitationAndrej Dudenhefner, Jakob Rehof. [doi]
- Combinatorial Flows and Their NormalisationLutz Straßburger. [doi]
- Nested Multisets, Hereditary Multisets, and Syntactic Ordinals in Isabelle/HOLJasmin Christian Blanchette, Mathias Fleury, Dmitriy Traytel. [doi]
- Generalized Refocusing: From Hybrid Strategies to Abstract MachinesMalgorzata Biernacka, Witold Charatonik, Klara Zielinska. [doi]
- Front Matter, Table of Contents, Preface, Steering Committee, Program Committee, External Reviewers [doi]
- Optimality and the Linear Substitution CalculusPablo Barenbaum, Eduardo Bonelli. [doi]
- Quantitative Semantics for Probabilistic Programming (Invited Talk)Christine Tasson. [doi]
- There Is Only One Notion of DifferentiationJ. Robin B. Cockett, Jean-Simon Lemay. [doi]
- A Curry-Howard Approach to Church's SynthesisPierre Pradic, Colin Riba. [doi]
- The Confluent Terminating Context-Free Substitutive Rewriting System for the lambda-Calculus with Surjective Pairing and Terminal TypeYohji Akama. [doi]
- Negative Translations and Normal ModalityTadeusz Litak, Miriam Polzer, Ulrich Rabenstein. [doi]
- List Objects with Algebraic StructureMarcelo Fiore, Philip Saville. [doi]
- Böhm Reduction in Infinitary Term Graph Rewriting SystemsPatrick Bahr. [doi]
- Displayed CategoriesBenedikt Ahrens, Peter LeFanu Lumsdaine. [doi]
- Refutation of Sallé's Longstanding ConjectureBenedetto Intrigila, Giulio Manzonetto, Andrew Polonsky. [doi]
- Improving Rewriting Induction Approach for Proving Ground ConfluenceTakahito Aoto 0001, Yoshihito Toyama, Yuta Kimura. [doi]
- Streett Automata Model Checking of Higher-Order Recursion SchemesRyota Suzuki, Koichi Fujima, Naoki Kobayashi 0001, Takeshi Tsukada. [doi]
- Continuation Passing Style for Effect HandlersDaniel Hillerström, Sam Lindley, Robert Atkey, K. C. Sivaramakrishnan. [doi]
- Arrays and References in Resource Aware MLBenjamin Lichtman, Jan Hoffmann. [doi]
- Polynomial Running Times for Polynomial-Time Oracle MachinesAkitoshi Kawamura, Florian Steinberg. [doi]
- Brzozowski Goes Concurrent - A Kleene Theorem for Pomset Languages (Invited Talk)Alexandra Silva 0001. [doi]
- On Dinaturality, Typability and beta-eta-Stable ModelsPaolo Pistone. [doi]
- Types as Resources for Classical Natural DeductionDelia Kesner, Pierre Vial. [doi]
- Observably Deterministic Concurrent Strategies and Intensional Full Abstraction for Parallel-orSimon Castellan, Pierre Clairambault, Glynn Winskel. [doi]
- A Fibrational Framework for Substructural and Modal LogicsDaniel R. Licata, Michael Shulman, Mitchell Riley. [doi]
- Uniform Resource Analysis by Rewriting: Strenghts and Weaknesses (Invited Talk)Georg Moser. [doi]
- Type Systems for the Relational Verification of Higher Order Programs (Invited Talk)Marco Gaboardi. [doi]
- Confluence of an Extension of Combinatory Logic by Boolean ConstantsLukasz Czajka. [doi]
- A Sequent Calculus for a Semi-Associative LawNoam Zeilberger. [doi]
- Relating System F and Lambda2: A Case Study in Coq, Abella and BelugaJonas Kaiser, Brigitte Pientka, Gert Smolka. [doi]
- Models of Type Theory Based on Moore PathsIan Orton, Andrew M. Pitts. [doi]