LEADER 05556nam 22006615 450 001 996465805503316 005 20230222021738.0 024 7 $a10.1007/b135690 035 $a(CKB)1000000000212916 035 $a(SSID)ssj0000320539 035 $a(PQKBManifestationID)11238892 035 $a(PQKBTitleCode)TC0000320539 035 $a(PQKBWorkID)10249702 035 $a(PQKB)10087648 035 $a(DE-He213)978-3-540-32014-2 035 $a(MiAaPQ)EBC3067898 035 $a(PPN)123093864 035 $a(EXLCZ)991000000000212916 100 $a20101216d2005 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aTyped Lambda Calculi and Applications$b[electronic resource] $e7th International Conference, TLCA 2005, Nara, Japan, April 21-23, 2005, Proceedings /$fedited by Pawel Urzyczyn 205 $a1st ed. 2005. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2005. 215 $a1 online resource (XII, 436 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v3461 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$aPrinted edition: 9783540255932 320 $aIncludes bibliographical references and index. 327 $aCompleteness 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. 330 $aThe 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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v3461 606 $aMachine theory 606 $aComputer science 606 $aComputer programming 606 $aCompilers (Computer programs) 606 $aFormal Languages and Automata Theory 606 $aComputer Science Logic and Foundations of Programming 606 $aProgramming Techniques 606 $aCompilers and Interpreters 615 0$aMachine theory. 615 0$aComputer science. 615 0$aComputer programming. 615 0$aCompilers (Computer programs). 615 14$aFormal Languages and Automata Theory. 615 24$aComputer Science Logic and Foundations of Programming. 615 24$aProgramming Techniques. 615 24$aCompilers and Interpreters. 676 $a511.3 702 $aUrzyczyn$b Pawel$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aInternational Conference on Typed Lambda Calculi and Applications 906 $aBOOK 912 $a996465805503316 996 $aTyped Lambda Calculi and Applications$9772124 997 $aUNISA