Typed Lambda Calculi and Applications

11th International Conference, TLCA 2013, Eindhoven, The Netherlands, June 26-28, 2013. Proceedings

Editors:

ISBN: 978-3-642-38945-0 (Print) 978-3-642-38946-7 (Online)

Table of contents (18 chapters)

  1. Front Matter

    Pages -

  2. Type-Directed Compilation in the Wild: Haskell and Core

    1. No Access

      Book Chapter

      Pages 1-1

      Type-Directed Compilation in the Wild: Haskell and Core

    2. No Access

      Book Chapter

      Pages 2-2

      Proving with Side Effects

    3. No Access

      Book Chapter

      Pages 3-14

      Non-linearity as the Metric Completion of Linearity

  3. Contributed Papers

    1. No Access

      Book Chapter

      Pages 15-30

      System F i

    2. No Access

      Book Chapter

      Pages 31-47

      Non-determinism, Non-termination and the Strong Normalization of System T

    3. No Access

      Book Chapter

      Pages 48-60

      Proof-Relevant Logical Relations for Name Generation

    4. No Access

      Book Chapter

      Pages 61-76

      Games with Sequential Backtracking and Complete Game Semantics for Subclassical Logics

    5. No Access

      Book Chapter

      Pages 77-92

      Realizability for Peano Arithmetic with Winning Conditions in HON Games

    6. No Access

      Book Chapter

      Pages 93-108

      The Resource Lambda Calculus Is Short-Sighted in Its Relational Model

    7. No Access

      Book Chapter

      Pages 109-124

      Bounding Skeletons, Locally Scoped Terms and Exact Bounds for Linear Head Reduction

    8. No Access

      Book Chapter

      Pages 125-139

      Intersection Type Matching with Subtyping

    9. No Access

      Book Chapter

      Pages 140-155

      A Type-Checking Algorithm for Martin-Löf Type Theory with Subtyping Based on Normalisation by Evaluation

    10. No Access

      Book Chapter

      Pages 156-172

      Small Induction Recursion

    11. No Access

      Book Chapter

      Pages 173-188

      Generalizations of Hedberg’s Theorem

    12. No Access

      Book Chapter

      Pages 189-204

      Using Models to Model-Check Recursive Schemes

    13. No Access

      Book Chapter

      Pages 205-220

      On Interaction, Continuations and Defunctionalization

    14. No Access

      Book Chapter

      Pages 221-235

      Completeness of Conversion between Reactive Programs for Ultrametric Models

    15. No Access

      Book Chapter

      Pages 236-249

      A Constructive Model of Uniform Continuity

  4. Back Matter

    Pages -