Hasegawa Typed Lambda Calculi and Applications

11th International Conference, TLCA 2013, Eindhoven, The Netherlands, June 26-28, 2013, Proceedings
Erscheinungsjahr 2013
ISBN: 978-3-642-38946-7
Verlag: Springer
Format: PDF
Kopierschutz: 1 - PDF Watermark

E-Book, Englisch, Band 7941, 251 Seiten, eBook

Reihe: Lecture Notes in Computer Science

This book constitutes the refereed proceedings of the 11th International Conference on Typed Lambda Calculi and Applications, TLCA 2013, held in Eindhoven, The Netherlands, in June 2013 as part of RDP 2013, the 7th Federated Conference on Rewriting, Deduction, and Programming, together with the 24th International Conference on Rewriting Techniques and Applications, RTA 2013, and several related events. The 15 revised full papers presented were carefully reviewed and selected from 41 submissions. The papers provide prevailing research results on all current aspects of typed lambda calculi, ranging from theoretical and methodological issues to applications in various contexts addressing a wide variety of topics such as proof-theory, semantics, implementation, types, and programming.

Zielgruppe

Research

Autoren/Hrsg.

Hasegawa, Masahito

Inhaltsverzeichnis

Type-Directed Compilation in the Wild: Haskell and Core.- Proving with Side Effects.- Non-linearity as the Metric Completion of Linearity.- System F i : 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 andExact 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.