Get 40% off select Statistics books or choose from thousands of Archive eBooks at 9.99 each!

Lecture Notes in Computer Science

Typed Lambda Calculi and Applications

International Conference on Typed Lambda Calculi and Applications, TLCA '93, March 16-18, 1993, Utrecht, The Netherlands. Proceedings

Editors: Bezem, Marc, Groote, Jan F. (Eds.)

Free Preview

Buy this book

eBook $89.00
price for USA in USD (gross)
  • The eBook version of this title will be available soon
  • ISBN 978-3-540-47586-6
  • Digitally watermarked, DRM-free
  • Included format:
  • 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-56517-8
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this book

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.

Table of contents (29 chapters)

Table of contents (29 chapters)
  • On Mints' reduction for ccc-calculus

    Pages 1-12

    Akama, Yohji

  • A formalization of the strong normalization proof for System F in LEGO

    Pages 13-28

    Altenkirch, Thorsten

  • Partial intersection type assignment in applicative term rewriting systems

    Pages 29-44

    Bakel, Steffen

  • Extracting constructive content from classical logic via control-like reductions

    Pages 45-59

    Barbanera, Franco (et al.)

  • Combining first and higher order rewrite systems with type assignment systems

    Pages 60-74

    Barbanera, Franco (et al.)

Buy this book

eBook $89.00
price for USA in USD (gross)
  • The eBook version of this title will be available soon
  • ISBN 978-3-540-47586-6
  • Digitally watermarked, DRM-free
  • Included format:
  • 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-56517-8
  • 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
International Conference on Typed Lambda Calculi and Applications, TLCA '93, March 16-18, 1993, Utrecht, The Netherlands. Proceedings
Editors
  • Marc Bezem
  • Jan F. Groote
Series Title
Lecture Notes in Computer Science
Series Volume
664
Copyright
1993
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-540-47586-6
DOI
10.1007/BFb0037093
Softcover ISBN
978-3-540-56517-8
Series ISSN
0302-9743
Edition Number
1
Number of Pages
IX, 443
Topics