Typed Lambda Calculi and Applications 5th International Conference, TLCA 2001 Krakow, Poland, May 2-5, 2001 Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Abramsky, Samson (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2001.
• Έκδοση: 1st ed. 2001.
• Σειρά: Lecture Notes in Computer Science, 2044
• Θέματα: Mathematical analysis.; Analysis (Mathematics).; Mathematical logic.; Computer logic.; Computer programming.; Programming languages (Electronic computers).; Analysis.; Mathematical Logic and Foundations.; Mathematical Logic and Formal Languages.; Logics and Meanings of Programs.; Programming Techniques.; Programming Languages, Compilers, Interpreters.

This 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 resul...

Πίνακας περιεχομένων:

• Invited 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.