LEADER 05954nam 22008055 450 001 996466072803316 005 20200702120551.0 010 $a3-540-45413-6 024 7 $a10.1007/3-540-45413-6 035 $a(CKB)1000000000211488 035 $a(SSID)ssj0000327452 035 $a(PQKBManifestationID)11230143 035 $a(PQKBTitleCode)TC0000327452 035 $a(PQKBWorkID)10301620 035 $a(PQKB)10346865 035 $a(DE-He213)978-3-540-45413-7 035 $a(MiAaPQ)EBC3073043 035 $a(PPN)155208810 035 $a(EXLCZ)991000000000211488 100 $a20121227d2001 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aTyped Lambda Calculi and Applications$b[electronic resource] $e5th International Conference, TLCA 2001 Krakow, Poland, May 2-5, 2001 Proceedings /$fedited by Samson Abramsky 205 $a1st ed. 2001. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2001. 215 $a1 online resource (XII, 436 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2044 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-41960-8 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aInvited Lectures -- Many Happy Re urns -- From Bounded Arithmetic to Memory Management: Use of Type Theory to Capture Complexity Classes and Space Behaviour -- Definability of Total Objects in PCF and Related Calculi -- Categorical Semantics of Control -- Contributed Papers -- Representations of First Order Function Types as Terminal Coalgebras -- A Finitary Subsystem of the Polymorphic ?-Calculus -- Sequentiality and the ?-Calculus -- Logical Properites of Name Restriction -- Subtyping Recursive Games -- Typing Lambda Terms in Elementary Logic with Linear Constraints -- Ramied Recurrence with Dependent Types -- Game Semantics for the Pure Lazy ?-Calculus -- Reductions, intersection types, and explicit substitutions -- The Stratified Foundations as a Theory Modulo -- Normalization by Evaluation for the Computational Lambda-Calculus -- Induction Is Not Derivable in Second Order Dependent Type Theory -- Strong Normalization of Classical Natural Deduction with Disjunction -- Partially Additive Categories and Fully Complete Models of Linear Logic -- Distinguishing Data Structures and Functions: The Constructor Calculus and Functorial Types -- The Finitely Generated Types of the ?-Calculus -- Deciding Monadic Theories of Hyperalgebraic Trees -- A Deconstruction of Non-deterministic Classical Cut Elimination -- A Token Machine for Full Geometry of Interaction (Extended Abstract) -- Second-Order Pre-logical Relations and Representation Independence -- Characterizing Convergent Terms in Object Calculi via Intersection Types -- Parigot?s Second Order ??-Calculus and Inductive Types -- The Implicit Calculus of Constructions Extending Pure Type Systems with an Intersection Type Binder and Subtyping -- Evolving Games and Essential Nets for Affine Polymorphism -- Retracts in Simple Types -- Parallel Implementation Models for the ?-Calculus Using the Geometry of Interaction (Extended Abstract) -- The complexity of ?-reduction in low orders -- Strong Normalisation for a Gentzen-like Cut-Elimination Procedure. 330 $aThis book constitutes the refereed proceedings of the 5th International Conference on Typed Lambda Calculi and Applications, TLCA 2001, held in Krakow, Poland in May 2001. The 28 revised full papers presented were carefully reviewed and selected from 55 submissions. The volume reports research results on all current aspects of typed lambda calculi. Among the topics addressed are type systems, subtypes, coalgebraic methods, pi-calculus, recursive games, various types of lambda calculi, reductions, substitutions, normalization, linear logic, cut-elimination, prelogical relations, and mu calculus. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2044 606 $aMathematical analysis 606 $aAnalysis (Mathematics) 606 $aMathematical logic 606 $aComputer logic 606 $aComputer programming 606 $aProgramming languages (Electronic computers) 606 $aAnalysis$3https://scigraph.springernature.com/ontologies/product-market-codes/M12007 606 $aMathematical Logic and Foundations$3https://scigraph.springernature.com/ontologies/product-market-codes/M24005 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 606 $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010 606 $aProgramming Languages, Compilers, Interpreters$3https://scigraph.springernature.com/ontologies/product-market-codes/I14037 615 0$aMathematical analysis. 615 0$aAnalysis (Mathematics). 615 0$aMathematical logic. 615 0$aComputer logic. 615 0$aComputer programming. 615 0$aProgramming languages (Electronic computers). 615 14$aAnalysis. 615 24$aMathematical Logic and Foundations. 615 24$aMathematical Logic and Formal Languages. 615 24$aLogics and Meanings of Programs. 615 24$aProgramming Techniques. 615 24$aProgramming Languages, Compilers, Interpreters. 676 $a511.3 702 $aAbramsky$b Samson$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aInternational Conference on Typed Lambda Calculi and Applications 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996466072803316 996 $aTyped Lambda Calculi and Applications$9772124 997 $aUNISA