Typed Lambda Calculi and Applications 7th International Conference, TLCA 2005, Nara, Japan, April 21-23, 2005. Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Urzyczyn, Paweł (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2005.
• Σειρά: Lecture Notes in Computer Science, 3461
• Θέματα: Computer science.; Computer programming.; Programming languages (Electronic computers).; Computer logic.; Mathematical logic.; Computer Science.; Mathematical Logic and Formal Languages.; Logics and Meanings of Programs.; Programming Techniques.; Programming Languages, Compilers, Interpreters.

 The 7th International Conference on Typed Lambda Calculi and Applications (TLCA 2005) was held in Nara (Japan) from 21 to 23 April 2005, as part of the Joint Conference on Rewriting, Deduction and Programming (RDP 2005). This book contains the contributed papers, and extended abstracts of two invited talks, given by Thierry Coquand and Susumu Hayashi. A short abstract of the joint RDP invited lecture by Amy Felty is also included. The 27 contributed papers were selected from 61 submissions of generally very high quality, and the Program Committee had a hard time making the selection. The editor would like to thank everyone who submitted a paper and to express his regret that many interesting works could not be included. The editor also wishes to thank the invited speakers, the members of the Program and Organizing Committees, the Publicity Chair, and the referees for their joint e?ort towards the success of the conference. The support from the Nara Convention Bureau is gratefully acknowledged. The typed lambda calculus continues to be an important tool in logic and theoretical computer science. Since 1993, the research progress in this area has been documented by the TLCA proceedings. The present volume contributes to this tradition. 

 Completeness Theorems and ?-Calculus -- Completeness Theorems and ?-Calculus -- A Tutorial Example of the Semantic Approach to Foundational Proof-Carrying Code: Abstract -- Can Proofs Be Animated By Games? -- Contributed Papers -- Untyped Algorithmic Equality for Martin-Löf’s Logical Framework with Surjective Pairs -- The Monadic Second Order Theory of Trees Given by Arbitrary Level-Two Recursion Schemes Is Decidable -- A Feasible Algorithm for Typing in Elementary Affine Logic -- Practical Inference for Type-Based Termination in a Polymorphic Setting -- Relational Reasoning in a Nominal Semantics for Storage -- Filters on CoInductive Streams, an Application to Eratosthenes’ Sieve -- Recursive Functions with Higher Order Domains -- Elementary Affine Logic and the Call-by-Value Lambda Calculus -- Rank-2 Intersection and Polymorphic Recursion -- Arithmetical Proofs of Strong Normalization Results for the Symmetric ??-Calculus -- Subtyping Recursive Types Modulo Associative Commutative Products -- Galois Embedding from Polymorphic Types into Existential Types -- On the Degeneracy of ?-Types in Presence of Computational Classical Logic -- Semantic Cut Elimination in the Intuitionistic Sequent Calculus -- The Elimination of Nesting in SPCF -- Naming Proofs in Classical Propositional Logic -- Reducibility and ???-Lifting for Computation Types -- Privacy in Data Mining Using Formal Methods -- L3: A Linear Language with Locations -- Binding Signatures for Generic Contexts -- Proof Contexts with Late Binding -- The -Calculus. Functional Programming with Higher-Order Encodings -- A Lambda Calculus for Quantum Computation with Classical Control -- Continuity and Discontinuity in Lambda Calculus -- Call-by-Name and Call-by-Value as Token-Passing Interaction Nets -- Avoiding Equivariance in Alpha-Prolog -- Higher-Order Abstract Non-interference.