Typed Lambda Calculi and Applications: 11th International Conference, Tlca 2013, Eindhoven, the Netherlands, June 26-28, 2013, Proceedings

Type-Directed Compilation in the Wild: Haskell and Core.- Proving with Side Effects.- Non-linearity as the Metric Completion of Linearity.- System Fi: A Higher-Order Polymorphic λ-Calculus with Erasable Term-Indices.- Non-determinism, Non-termination and the Strong Normalization of System T.- Proof-Relevant Logical Relations for Name Generation.- Games with Sequential Backtracking and Complete Game Semantics for Subclassical Logics.- Realizability for Peano Arithmetic with Winning Conditions in HON Games.- The Resource Lambda Calculus Is Short-Sighted in Its Relational Model.- Bounding Skeletons, Locally Scoped Terms and Exact Bounds for Linear Head Reduction.- Intersection Type Matching with Subtyping.- A Type-Checking Algorithm for Martin-L]of Type Theory with Subtyping Based on Normalisation by Evaluation.- Small Induction Recursion.- Generalizations of Hedberg's Theorem.- Using Models to Model-Check Recursive Schemes.- On Interaction, Continuations and Defunctionalization.- Completeness of Conversion between Reactive Programs for Ultrametric Models.- A Constructive Model of Uniform Continuity.

• Format: Paperback
• Language: English
• ISBN: 3642389457
• ISBN13: 9783642389450
• Release Date: June 2013
• Publisher: Springer
• Length: 251 Pages
• Weight: 0.82 lbs.
• Dimensions: 0.6" x 6.1" x 9.2"