Abstract is missing.
- A Survey of Classical RealizabilityAlexandre Miquel. 1-2 [doi]
- Tree Automata, (Dis-)Equality Constraints and Term Rewriting - What s New?Sophie Tison. 3-5 [doi]
- Rewriting in PracticeAshish Tiwari. 6-8 [doi]
- Combining Proofs and ProgramsStephanie Weirich. 9 [doi]
- Higher-Order Dynamic Pattern Unification for Dependent Types and RecordsAndreas Abel, Brigitte Pientka. 10-26 [doi]
- Classical Call-by-Need and DualityZena M. Ariola, Hugo Herbelin, Alexis Saurin. 27-44 [doi]
- Homotopy-Theoretic Models of Type TheoryPeter Arndt, Krzysztof Kapulkin. 45-60 [doi]
- Game Semantics and Uniqueness of Type Inhabitance in the Simply-Typed ::::λ::::-CalculusPierre Bourreau, Sylvain Salvati. 61-75 [doi]
- Orthogonality and Boolean Algebras for Deduction ModuloAloïs Brunel, Olivier Hermant, Clément Houtmann. 76-90 [doi]
- The Biequivalence of Locally Cartesian Closed Categories and Martin-Löf Type TheoriesPierre Clairambault, Peter Dybjer. 91-106 [doi]
- Realizability Proof for Normalization of Full Differential Linear LogicStéphane Gimenez. 107-122 [doi]
- Controlling Program Extraction in Light LogicsMarc Lasson. 123-137 [doi]
- An Elementary Affine ::::λ::::-Calculus with Multithreading and Side EffectsAntoine Madet, Roberto M. Amadio. 138-152 [doi]
- Böhm s Theorem for Resource Lambda Calculus through Taylor ExpansionGiulio Manzonetto, Michele Pagani. 153-168 [doi]
- Finite Combinatory Logic with Intersection TypesJakob Rehof, Pawel Urzyczyn. 169-183 [doi]
- Linear Lambda Calculus and Deep InferenceLuca Roversi. 184-197 [doi]
- Partiality, State and Dependent TypesKasper Svendsen, Lars Birkedal, Aleksandar Nanevski. 198-212 [doi]
- A Filter Model for the ::::λμ::::-Calculus - (Extended Abstract)Steffen van Bakel, Franco Barbanera, Ugo de Liguoro. 213-228 [doi]
- Approximation Semantics and Expressive Predicate Assignment for Object-Oriented Programming - (Extended Abstract)Reuben Rowe, Steffen van Bakel. 229-244 [doi]