Theoretical Computer Science and General Issues

Typed Lambda Calculi and Applications

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

Editors: Urzyczyn, Pawel (Ed.)

Free Preview

Buy this book

eBook $89.00
price for USA in USD (gross)
  • ISBN 978-3-540-32014-2
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $119.00
price for USA in USD
  • ISBN 978-3-540-25593-2
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this book

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.

Table of contents (30 chapters)

Table of contents (30 chapters)
  • Completeness Theorems and λ-Calculus

    Coquand, Thierry

    Pages 1-9

  • A Tutorial Example of the Semantic Approach to Foundational Proof-Carrying Code: Abstract

    Felty, Amy P.

    Pages 10-10

  • Can Proofs Be Animated By Games?

    Hayashi, Susumu

    Pages 11-22

  • Untyped Algorithmic Equality for Martin-Löf’s Logical Framework with Surjective Pairs

    Abel, Andreas (et al.)

    Pages 23-38

  • The Monadic Second Order Theory of Trees Given by Arbitrary Level-Two Recursion Schemes Is Decidable

    Aehlig, Klaus (et al.)

    Pages 39-54

Buy this book

eBook $89.00
price for USA in USD (gross)
  • ISBN 978-3-540-32014-2
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $119.00
price for USA in USD
  • ISBN 978-3-540-25593-2
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Typed Lambda Calculi and Applications
Book Subtitle
7th International Conference, TLCA 2005, Nara, Japan, April 21-23, 2005, Proceedings
Editors
  • Pawel Urzyczyn
Series Title
Theoretical Computer Science and General Issues
Series Volume
3461
Copyright
2005
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-540-32014-2
DOI
10.1007/b135690
Softcover ISBN
978-3-540-25593-2
Edition Number
1
Number of Pages
XII, 436
Topics