Skip to main content
SpringerLink
Log in

Typed Lambda Calculi and Applications

5th International Conference, TLCA 2001 Krakow, Poland, May 2-5, 2001 Proceedings

  • Conference proceedings
  • © 2001

Overview

Editors:
  1. Samson Abramsky

    1. Oxford University Computing Laboratory, Oxford, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 2044)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (32 papers)

  1. Front Matter

    Pages I-XI
    Download chapter PDF

  3. Contributed Papers

    1. Representations of First Order Function Types as Terminal Coalgebras

      • Thorsten Altenkirch
      Pages 8-21

    2. A Finitary Subsystem of the Polymorphic λ-Calculus

      • Thorsten Altenkirch, Thierry Coquand
      Pages 22-28

    3. Sequentiality and the π-Calculus

      • Martin Berger, Kohei Honda, Nobuko Yoshida
      Pages 29-45

    4. Logical Properites of Name Restriction

      • Luca Cardelli, Andrew D. Gordon
      Pages 46-60

    5. Subtyping Recursive Games

      • Juliusz Chroboczek
      Pages 61-75

    6. Typing Lambda Terms in Elementary Logic with Linear Constraints

      • Paolo Coppola, Simone Martini
      Pages 76-90

    7. Ramied Recurrence with Dependent Types

      • Norman Danner
      Pages 91-105

    8. Game Semantics for the Pure Lazy λ-Calculus

      • Pietro Di Gianantonio
      Pages 106-120

    9. Reductions, intersection types, and explicit substitutions

      • Dan Doughertyy, Pierre Lescanne
      Pages 121-135

    10. The Stratified Foundations as a Theory Modulo

      • Gilles Dowek
      Pages 136-150

    11. Normalization by Evaluation for the Computational Lambda-Calculus

      • Andrzej Filinski
      Pages 151-165

    12. Induction Is Not Derivable in Second Order Dependent Type Theory

      • Herman Geuvers
      Pages 166-181

    13. Strong Normalization of Classical Natural Deduction with Disjunction

      • Philippe de Groote
      Pages 182-196

    14. Partially Additive Categories and Fully Complete Models of Linear Logic

      • Esfandiar Haghverdi
      Pages 197-216

    15. Distinguishing Data Structures and Functions: The Constructor Calculus and Functorial Types

      • C. Barry Jay
      Pages 217-239
Back to top

Keywords

About this book

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.

Editors and Affiliations

  • Oxford University Computing Laboratory, Oxford, USA

    Samson Abramsky

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation