Advertisement

Typed Lambda Calculi and Applications

7th International Conference, TLCA 2005, Nara, Japan, April 21-23, 2005. Proceedings

  • Paweł Urzyczyn

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

Table of contents

  1. Front Matter
  2. Completeness Theorems and λ-Calculus

  3. Contributed Papers

    1. Patrick Baillot, Kazushige Terui
      Pages 55-70
    2. Gilles Barthe, Benjamin Grégoire, Fernando Pastawski
      Pages 71-85
    3. Nick Benton, Benjamin Leperchey
      Pages 86-101
    4. Ana Bove, Venanzio Capretta
      Pages 116-130
    5. Paolo Coppola, Ugo Dal Lago, Simona Ronchi Della Rocca
      Pages 131-145
    6. Ferruccio Damiani
      Pages 146-161
    7. Roberto Di Cosmo, François Pottier, Didier Rémy
      Pages 179-193
    8. J. Laird
      Pages 234-245
    9. François Lamarche, Lutz Straßburger
      Pages 246-261
    10. Sam Lindley, Ian Stark
      Pages 262-277
    11. Stan Matwin, Amy Felty, István Hernádvölgyi, Venanzio Capretta
      Pages 278-292
    12. Greg Morrisett, Amal Ahmed, Matthew Fluet
      Pages 293-307
    13. John Power, Miki Tanaka
      Pages 308-323
    14. Virgile Prevosto, Sylvain Boulmé
      Pages 324-338
    15. Carsten Schürmann, Adam Poswolsky, Jeffrey Sarnat
      Pages 339-353
    16. Peter Selinger, Benoît Valiron
      Pages 354-368
    17. Paula Severi, Fer-Jan de Vries
      Pages 369-385
    18. Christian Urban, James Cheney
      Pages 401-416
    19. Damiano Zanardini
      Pages 417-432
  4. Back Matter

About these proceedings

Introduction

The 7th International Conference on Typed Lambda Calculi and Applications (TLCA 2005) was held in Nara (Japan) from 21 to 23 April 2005, as part of the Joint Conference on Rewriting, Deduction and Programming (RDP 2005). This book contains the contributed papers, and extended abstracts of two invited talks, given by Thierry Coquand and Susumu Hayashi. A short abstract of the joint RDP invited lecture by Amy Felty is also included. The 27 contributed papers were selected from 61 submissions of generally very high quality, and the Program Committee had a hard time making the selection. The editor would like to thank everyone who submitted a paper and to express his regret that many interesting works could not be included. The editor also wishes to thank the invited speakers, the members of the Program and Organizing Committees, the Publicity Chair, and the referees for their joint e?ort towards the success of the conference. The support from the Nara Convention Bureau is gratefully acknowledged. The typed lambda calculus continues to be an important tool in logic and theoretical computer science. Since 1993, the research progress in this area has been documented by the TLCA proceedings. The present volume contributes to this tradition.

Keywords

Signatur algorithm algorithms computational logic formal method formal methods lambda calculus logic logical relations program semantics programming programming calculi programming theory semantics type systems

Editors and affiliations

  • Paweł Urzyczyn
    • 1
  1. 1.Institute of InformaticsUniversity of WarsawPoland

Bibliographic information

  • DOI https://doi.org/10.1007/b135690
  • Copyright Information Springer-Verlag Berlin Heidelberg 2005
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-25593-2
  • Online ISBN 978-3-540-32014-2
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site