Typed Lambda Calculi and Applications
5th International Conference, TLCA 2001 Krakow, Poland, May 2-5, 2001 Proceedings
Published on 20. April 2001
Book
Paperback/Softback
XII, 436 pages
978-3-540-41960-0 (ISBN)
Description
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 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.
More details
Series
Edition
2001 ed.
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Research
Illustrations
XII, 436 p.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 25 mm
Weight
674 gr
ISBN-13
978-3-540-41960-0 (9783540419600)
DOI
10.1007/3-540-45413-6
Schweitzer Classification
Other editions
Additional editions
Samson Abramsky
Typed Lambda Calculi and Applications
5th International Conference, TLCA 2001 Krakow, Poland, May 2-5, 2001 Proceedings
E-Book
06/2003
Springer
€53.49
Available for download
Content
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.- ParallelImplementation 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.