Typed Lambda Calculi and Applications

10th International Conference, TLCA 2011, Novi Sad, Serbia, June 1-3, 2011. Proceedings

Editors:

ISBN: 978-3-642-21690-9 (Print) 978-3-642-21691-6 (Online)

Table of contents (19 chapters)

  1. Front Matter

    Pages -

  2. Abstracts of Invited Lectures

    1. No Access

      Book Chapter

      Pages 1-2

      A Survey of Classical Realizability

    2. No Access

      Book Chapter

      Pages 3-5

      Tree Automata, (Dis-)Equality Constraints and Term Rewriting

    3. No Access

      Book Chapter

      Pages 6-8

      Rewriting in Practice

    4. No Access

      Book Chapter

      Pages 9-9

      Combining Proofs and Programs

  3. Contributed Papers

    1. No Access

      Book Chapter

      Pages 10-26

      Higher-Order Dynamic Pattern Unification for Dependent Types and Records

    2. No Access

      Book Chapter

      Pages 27-44

      Classical Call-by-Need and Duality

    3. No Access

      Book Chapter

      Pages 45-60

      Homotopy-Theoretic Models of Type Theory

    4. No Access

      Book Chapter

      Pages 61-75

      Game Semantics and Uniqueness of Type Inhabitance in the Simply-Typed λ-Calculus

    5. No Access

      Book Chapter

      Pages 76-90

      Orthogonality and Boolean Algebras for Deduction Modulo

    6. No Access

      Book Chapter

      Pages 91-106

      The Biequivalence of Locally Cartesian Closed Categories and Martin-Löf Type Theories

    7. No Access

      Book Chapter

      Pages 107-122

      Realizability Proof for Normalization of Full Differential Linear Logic

    8. No Access

      Book Chapter

      Pages 123-137

      Controlling Program Extraction in Light Logics

    9. No Access

      Book Chapter

      Pages 138-152

      An Elementary Affine λ-Calculus with Multithreading and Side Effects

    10. No Access

      Book Chapter

      Pages 153-168

      Böhm’s Theorem for Resource Lambda Calculus through Taylor Expansion

    11. No Access

      Book Chapter

      Pages 169-183

      Finite Combinatory Logic with Intersection Types

    12. No Access

      Book Chapter

      Pages 184-197

      Linear Lambda Calculus and Deep Inference

    13. No Access

      Book Chapter

      Pages 198-212

      Partiality, State and Dependent Types

    14. No Access

      Book Chapter

      Pages 213-228

      A Filter Model for the λμ-Calculus

    15. No Access

      Book Chapter

      Pages 229-244

      Approximation Semantics and Expressive Predicate Assignment for Object-Oriented Programming

  4. Back Matter

    Pages -