Table of contents

  1. Front Matter
  2. Yohji Akama
    Pages 1-12
  3. Nick Benton, Gavin Bierman, Valeria de Paiva, Martin Hyland
    Pages 75-90
  4. Giuseppe Castagna, Giorgio Ghelli, Giuseppe Longo
    Pages 107-123
  5. Pietro Di Gianantonio, Furio Honsell
    Pages 124-138
  6. Giorgio Ghelli
    Pages 146-162
  7. Philippe Groote
    Pages 163-178
  8. J. M. E. Hyland, C. -H. L. Ong
    Pages 179-194
  9. Bart Jacobs, Tom Melham
    Pages 209-229
  10. Achim Jung, Jerzy Tiuryn
    Pages 245-257
  11. Hans Leiß
    Pages 258-273
  12. Daniel Leivant, Jean-Yves Marion
    Pages 274-288
  13. James McKinna, Robert Pollack
    Pages 289-305
  14. Daniel F. Otth
    Pages 318-327
  15. Christine Paulin-Mohring
    Pages 328-345
  16. Benjamin C. Pierce
    Pages 346-360
  17. Gordon Plotkin, Martín Abadi
    Pages 361-375
  18. Kurt Sieber
    Pages 376-390
  19. Masako Takahashi
    Pages 406-417
  20. Paweł Urzyczyn
    Pages 418-432
  21. Back Matter

About these proceedings


The lambda calculus was developed in the 1930s by Alonzo Church. The calculus turned out to be an interesting model of computation and became theprototype for untyped functional programming languages. Operational and denotational semantics for the calculus served as examples for otherprogramming languages. In typed lambda calculi, lambda terms are classified according to their applicative behavior. In the 1960s it was discovered that the types of typed lambda calculi are in fact appearances of logical propositions. Thus there are two possible views of typed lambda calculi: - as models of computation, where terms are viewed as programs in a typed programming language; - as logical theories, where the types are viewed as propositions and the terms as proofs. The practical spin-off from these studies are: - functional programming languages which are mathematically more succinct than imperative programs; - systems for automated proof checking based on lambda caluli. This volume is the proceedings of TLCA '93, the first international conference on Typed Lambda Calculi and Applications,organized by the Department of Philosophy of Utrecht University. It includes29 papers selected from 51 submissions.


Automat Beweis-Verifikation Denotational Semantics Getypter Lambda-Kalkül Models of Computation Proof Verification Rechenmodelle SPIN Term Rewriting Term-Ersetzung lambda calculus programming programming language semantics

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 1993
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-56517-8
  • Online ISBN 978-3-540-47586-6
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site