Typed Lambda Calculi and Applications : 11th International Conference, TLCA 2013, Eindhoven, the Netherlands, June 26-28, 2013. Proceedings / Masahito Hasegawa (ed.).
By: (11th : International Conference on Typed Lambda Calculi and Applications (11th : 2013 : Eindhoven, Netherlands)
Contributor(s): Hasegawa, Masahito [editor.]Material type: TextSeries: SerienbezeichnungLecture notes in computer science: 7941.; LNCS sublibrary: Publisher: Berlin : Springer, Copyright date: ©2013Description: 1 online resource (xii, 249 pages)Content type: text Media type: computer Carrier type: online resourceISBN: 9783642389467; 3642389465Other title: TLCA 2013Subject(s): Lambda calculus -- Congresses | Computer science -- Mathematics -- Congresses | Computer science -- Mathematics | Lambda calculus | Mathematics | Physical Sciences & Mathematics | Mathematical Theory | Mathematics -- Congresses | Mathematics | Computer science | Logic design | Algebra -- Data processing | Electronic data processing | Logic, Symbolic and mathematical | Mathematical Logic and Formal Languages | Mathematics of Computing | Logics and Meanings of Programs | Symbolic and Algebraic Manipulation | Computing MethodologiesGenre/Form: Electronic books. | Conference papers and proceedings. | Ebook. | Congresses. Additional physical formats: Print verson:: Typed lambda calculi and applications.DDC classification: 511.3/5 LOC classification: QA9.5 | .I58 2013Online resources: Click here to access online
|Item type||Current location||Collection||Call number||Status||Date due||Barcode||Item holds|
Type-Directed Compilation in the Wild: Haskell and Core. Type-Directed Compilation in the Wild: Haskell and Core / Simon Peyton-Jones -- Proving with Side Effects / Hugo Herbelin -- Non-linearity as the Metric Completion of Linearity / Damiano Mazza -- Contributed Papers. System F i / Ki Yung Ahn, Tim Sheard, Marcelo Fiore, Andrew M. Pitts -- Non-determinism, Non-termination and the Strong Normalization of System T / Federico Aschieri, Margherita Zorzi -- Proof-Relevant Logical Relations for Name Generation / Nick Benton, Martin Hofmann, Vivek Nigam -- Games with Sequential Backtracking and Complete Game Semantics for Subclassical Logics / Stefano Berardi, Makoto Tatsuta -- Realizability for Peano Arithmetic with Winning Conditions in HON Games / Valentin Blot -- The Resource Lambda Calculus Is Short-Sighted in Its Relational Model / Flavien Breuvart -- Bounding Skeletons, Locally Scoped Terms and Exact Bounds for Linear Head Reduction / Pierre Clairambault -- Intersection Type Matching with Subtyping / Boris Düdder, Moritz Martens, Jakob Rehof -- A Type-Checking Algorithm for Martin-Löf Type Theory with Subtyping Based on Normalisation by Evaluation / Daniel Fridlender, Miguel Pagano -- Small Induction Recursion / Peter Hancock, Conor McBride, Neil Ghani, Lorenzo Malatesta, Thorsten Altenkirch -- Generalizations of Hedberg's Theorem / Nicolai Kraus, Martín Escardó, Thierry Coquand, Thorsten Altenkirch -- Using Models to Model-Check Recursive Schemes / Sylvain Salvati, Igor Walukiewicz -- On Interaction, Continuations and Defunctionalization / Ulrich Schöpp -- Completeness of Conversion between Reactive Programs for Ultrametric Models / Paula Severi, Fer-Jan de Vries -- A Constructive Model of Uniform Continuity / Chuangjie Xu, Martín Escardó.
International conference proceedings.
Includes author index.
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.
Print version record.