Typed Lambda Calculi and Applications

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 A Survey of Classical Realizability
3. Altmetric Badge
   Chapter 2 Tree Automata, (Dis-)Equality Constraints and Term Rewriting
4. Altmetric Badge
   Chapter 3 Rewriting in Practice
5. Altmetric Badge
   Chapter 4 Combining Proofs and Programs
6. Altmetric Badge
   Chapter 5 Higher-Order Dynamic Pattern Unification for Dependent Types and Records
7. Altmetric Badge
   Chapter 6 Classical Call-by-Need and Duality
8. Altmetric Badge
   Chapter 7 Homotopy Theoretic Models of Type Theory
9. Altmetric Badge
   Chapter 8 Game Semantics and Uniqueness of Type Inhabitance in the Simply-Typed λ -Calculus
10. Altmetric Badge
    Chapter 9 Orthogonality and Boolean Algebras for Deduction Modulo
11. Altmetric Badge
    Chapter 10 The Biequivalence of Locally Cartesian Closed Categories and Martin-Löf Type Theories
12. Altmetric Badge
    Chapter 11 Realizability Proof for Normalization of Full Differential Linear Logic
13. Altmetric Badge
    Chapter 12 Controlling Program Extraction in Light Logics
14. Altmetric Badge
    Chapter 13 An Elementary Affine λ -Calculus with Multithreading and Side Effects
15. Altmetric Badge
    Chapter 14 Böhm’s Theorem for Resource Lambda Calculus through Taylor Expansion
16. Altmetric Badge
    Chapter 15 Finite Combinatory Logic with Intersection Types
17. Altmetric Badge
    Chapter 16 Linear Lambda Calculus and Deep Inference
18. Altmetric Badge
    Chapter 17 Partiality, State and Dependent Types
19. Altmetric Badge
    Chapter 18 A Filter Model for the λμ -Calculus
20. Altmetric Badge
    Chapter 19 Approximation Semantics and Expressive Predicate Assignment for Object-Oriented Programming