Typed Lambda Calculi and Applications

Typed Lambda Calculi and Applications: 5th International Conference, TLCA 2001 Kraków, Poland, May 2–5, 2001 Proceedings<br />Author: Samson Abramsky<br /> Published by Springer Berlin Heidelberg<br /> ISBN: 978-3-540-41960-0<br /> DOI: 10.1007/3-540-45413-6<br /><br />Table of Contents:<p></p><ul><li>Many Happy Re urns
</li><li>From Bounded Arithmetic to Memory Management: Use of Type Theory to Capture Complexity Classes and Space Behaviour
</li><li>Definability of Total Objects in PCF and Related Calculi
</li><li>Categorical Semantics of Control
</li><li>Representations of First Order Function Types as Terminal Coalgebras
</li><li>A Finitary Subsystem of the Polymorphic λ-Calculus
</li><li>Sequentiality and the π-Calculus
</li><li>Logical Properites of Name Restriction
</li><li>Subtyping Recursive Games
</li><li>Typing Lambda Terms in Elementary Logic with Linear Constraints
</li><li>Ramied Recurrence with Dependent Types
</li><li>Game Semantics for the Pure Lazy λ-Calculus
</li><li>Reductions, intersection types, and explicit substitutions
</li><li>The Stratified Foundations as a Theory Modulo
</li><li>Normalization by Evaluation for the Computational Lambda-Calculus
</li><li>Induction Is Not Derivable in Second Order Dependent Type Theory
</li><li>Strong Normalization of Classical Natural Deduction with Disjunction
</li><li>Partially Additive Categories and Fully Complete Models of Linear Logic
</li><li>Distinguishing Data Structures and Functions: The Constructor Calculus and Functorial Types
</li><li>The Finitely Generated Types of the λ-Calculus</li></ul>