5. TLCA 2001: Krakow, Poland

@proceedings{DBLP:conf/tlca/2001,
  editor    = {Samson Abramsky},
  title     = {Typed Lambda Calculi and Applications, 5th International Conference,
               TLCA 2001, Krakow, Poland, May 2-5, 2001, Proceedings},
  booktitle = {TLCA},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {2044},
  year      = {2001},
  isbn      = {3-540-41960-8},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Invited Lectures

• Olivier Danvy:
  Many Happy Returns. 1
  Electronic Edition (Springer LINK) BibTeX
• Martin Hofmann:
  From Bounded Arithmetic to Memory Management: Use of Type Theory to Capture Complexity Classes and Space Behaviour. 2-3
  Electronic Edition (Springer LINK) BibTeX
• Dag Normann:
  Definability of Total Objects in PCF and Related Calculi. 4-5
  Electronic Edition (Springer LINK) BibTeX
• Peter Selinger:
  Categorical Semantics of Control. 6-7
  Electronic Edition (Springer LINK) BibTeX

Contributed Papers

• Thorsten Altenkirch:
  Representations of First Order Function Types as Terminal Coalgebras. 8-21
  Electronic Edition (Springer LINK) BibTeX
• Thorsten Altenkirch, Thierry Coquand:
  A Finitary Subsystem of the Polymorphic lambda-Calculus. 22-28
  Electronic Edition (Springer LINK) BibTeX
• Martin Berger, Kohei Honda, Nobuko Yoshida:
  Sequentiality and the pi-Calculus. 29-45
  Electronic Edition (Springer LINK) BibTeX
• Luca Cardelli, Andrew D. Gordon:
  Logical Properties of Name Restriction. 46-60
  Electronic Edition (Springer LINK) BibTeX
• Juliusz Chroboczek:
  Subtyping Recursive Games. 61-75
  Electronic Edition (Springer LINK) BibTeX
• Paolo Coppola, Simone Martini:
  Typing Lambda Terms in Elementary Logic with Linear Constraints. 76-90
  Electronic Edition (Springer LINK) BibTeX
• Norman Danner:
  Ramified Recurrence with Dependent Types. 91-105
  Electronic Edition (Springer LINK) BibTeX
• Pietro Di Gianantonio:
  Game Semantics for the Pure Lazy lambda-calculus. 106-120
  Electronic Edition (Springer LINK) BibTeX
• Daniel J. Dougherty, Pierre Lescanne:
  Reductions, Intersection Types, and Explicit Substitutions. 121-135
  Electronic Edition (Springer LINK) BibTeX
• Gilles Dowek:
  The Stratified Foundations as a Theory Modulo. 136-150
  Electronic Edition (Springer LINK) BibTeX
• Andrzej Filinski:
  Normalization by Evaluation for the Computational Lambda-Calculus. 151-165
  Electronic Edition (Springer LINK) BibTeX
• Herman Geuvers:
  Induction Is Not Derivable in Second Order Dependent Type Theory. 166-181
  Electronic Edition (Springer LINK) BibTeX
• Philippe de Groote:
  Strong Normalization of Classical Natural Deduction with Disjunction. 182-196
  Electronic Edition (Springer LINK) BibTeX
• Esfandiar Haghverdi:
  Partially Additive Categories and Fully Complete Models of Linear Logic. 197-216
  Electronic Edition (Springer LINK) BibTeX
• C. Barry Jay:
  Distinguishing Data Structures and Functions: The Constructor Calculus and Functorial Types. 217-239
  Electronic Edition (Springer LINK) BibTeX
• Thierry Joly:
  The Finitely Generated Types of the lambda-Calculus. 240-252
  Electronic Edition (Springer LINK) BibTeX
• Teodor Knapik, Damian Niwinski, Pawel Urzyczyn:
  Deciding Monadic Theories of Hyperalgebraic Trees. 253-267
  Electronic Edition (Springer LINK) BibTeX
• James Laird:
  A Deconstruction of Non-deterministic Classical Cut Elimination. 268-282
  Electronic Edition (Springer LINK) BibTeX
• Olivier Laurent:
  A Token Machine for Full Geometry of Interaction. 283-297
  Electronic Edition (Springer LINK) BibTeX
• Hans Leiß:
  Second-Order Pre-Logical Relations and Representation Independence. 298-314
  Electronic Edition (Springer LINK) BibTeX
• Ugo de'Liguoro:
  Characterizing Convergent Terms in Object Calculi via Intersection Types. 315-328
  Electronic Edition (Springer LINK) BibTeX
• Ralph Matthes:
  Parigot's Second Order lambda-mu-Calculus and Inductive Types. 329-343
  Electronic Edition (Springer LINK) BibTeX
• Alexandre Miquel:
  The Implicit Calculus of Constructions. 344-359
  Electronic Edition (Springer LINK) BibTeX
• Andrzej S. Murawski, C.-H. Luke Ong:
  Evolving Games and Essential Nets for Affine Polymorphism. 360-375
  Electronic Edition (Springer LINK) BibTeX
• Vincent Padovani:
  Retracts in Simple Types. 376-384
  Electronic Edition (Springer LINK) BibTeX
• Jorge Sousa Pinto:
  Parallel Implementation Models for the lambda-Calculus Using the Geometry of Interaction. 385-399
  Electronic Edition (Springer LINK) BibTeX
• Aleksy Schubert:
  The Complexity of beta-Reduction in Low Orders. 400-414
  Electronic Edition (Springer LINK) BibTeX
• Christian Urban:
  Strong Normalisation for a Gentzen-like Cut-Elimination Procedure. 415-430
  Electronic Edition (Springer LINK) BibTeX