5. TLCA 2001:
Krakow, Poland
Samson Abramsky (Ed.):
Typed Lambda Calculi and Applications, 5th International Conference, TLCA 2001, Krakow, Poland, May 2-5, 2001, Proceedings.
Lecture Notes in Computer Science 2044 Springer 2001, ISBN 3-540-41960-8 
Invited Lectures
- Olivier Danvy:
Many Happy Returns.
1
- Martin Hofmann:
From Bounded Arithmetic to Memory Management: Use of Type Theory to Capture Complexity Classes and Space Behaviour.
2-3
- Dag Normann:
Definability of Total Objects in PCF and Related Calculi.
4-5
- Peter Selinger:
Categorical Semantics of Control.
6-7
Contributed Papers
- Thorsten Altenkirch:
Representations of First Order Function Types as Terminal Coalgebras.
8-21
- Thorsten Altenkirch, Thierry Coquand:
A Finitary Subsystem of the Polymorphic lambda-Calculus.
22-28
- Martin Berger, Kohei Honda, Nobuko Yoshida:
Sequentiality and the pi-Calculus.
29-45
- Luca Cardelli, Andrew D. Gordon:
Logical Properties of Name Restriction.
46-60
- Juliusz Chroboczek:
Subtyping Recursive Games.
61-75
- Paolo Coppola, Simone Martini:
Typing Lambda Terms in Elementary Logic with Linear Constraints.
76-90
- Norman Danner:
Ramified Recurrence with Dependent Types.
91-105
- Pietro Di Gianantonio:
Game Semantics for the Pure Lazy lambda-calculus.
106-120
- Daniel J. Dougherty, Pierre Lescanne:
Reductions, Intersection Types, and Explicit Substitutions.
121-135
- Gilles Dowek:
The Stratified Foundations as a Theory Modulo.
136-150
- Andrzej Filinski:
Normalization by Evaluation for the Computational Lambda-Calculus.
151-165
- Herman Geuvers:
Induction Is Not Derivable in Second Order Dependent Type Theory.
166-181
- Philippe de Groote:
Strong Normalization of Classical Natural Deduction with Disjunction.
182-196
- Esfandiar Haghverdi:
Partially Additive Categories and Fully Complete Models of Linear Logic.
197-216
- C. Barry Jay:
Distinguishing Data Structures and Functions: The Constructor Calculus and Functorial Types.
217-239
- Thierry Joly:
The Finitely Generated Types of the lambda-Calculus.
240-252
- Teodor Knapik, Damian Niwinski, Pawel Urzyczyn:
Deciding Monadic Theories of Hyperalgebraic Trees.
253-267
- James Laird:
A Deconstruction of Non-deterministic Classical Cut Elimination.
268-282
- Olivier Laurent:
A Token Machine for Full Geometry of Interaction.
283-297
- Hans Leiß:
Second-Order Pre-Logical Relations and Representation Independence.
298-314
- Ugo de'Liguoro:
Characterizing Convergent Terms in Object Calculi via Intersection Types.
315-328
- Ralph Matthes:
Parigot's Second Order lambda-mu-Calculus and Inductive Types.
329-343
- Alexandre Miquel:
The Implicit Calculus of Constructions.
344-359
- Andrzej S. Murawski, C.-H. Luke Ong:
Evolving Games and Essential Nets for Affine Polymorphism.
360-375
- Vincent Padovani:
Retracts in Simple Types.
376-384
- Jorge Sousa Pinto:
Parallel Implementation Models for the lambda-Calculus Using the Geometry of Interaction.
385-399
- Aleksy Schubert:
The Complexity of beta-Reduction in Low Orders.
400-414
- Christian Urban:
Strong Normalisation for a Gentzen-like Cut-Elimination Procedure.
415-430
Last update Sun May 26 03:44:35 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
