Lambda-calculus, combinators, and functional programming
Author(s)
Bibliographic Information
Lambda-calculus, combinators, and functional programming
(Cambridge tracts in theoretical computer science, 4)
Cambridge University Press, 2009
- : pbk
Available at 2 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
Bibliography: p. [176]-181
First published 1988, this digitally printed version 2009 (paperback re-issue)
Description and Table of Contents
Description
Originally published in 1988, this book presents an introduction to lambda-calculus and combinators without getting lost in the details of mathematical aspects of their theory. Lambda-calculus is treated here as a functional language and its relevance to computer science is clearly demonstrated. The main purpose of the book is to provide computer science students and researchers with a firm background in lambda-calculus and combinators and show the applicabillity of these theories to functional programming. The presentation of the material is self-contained. It can be used as a primary text for a course on functional programming. It can also be used as a supplementary text for courses on the structure and implementation of programming languages, theory of computing, or semantics of programming languages.
Table of Contents
- Preface
- 1. Introduction
- 2. Type-free lambda-calculus
- 3. Combinators and constant symbols
- 4. List manipulation in lambda-calculus
- 5. Rule-based semantics of -expressions
- 6. Outlines of a reduction machine
- 7. Towards a parallel graph-reduction
- Appendix A: A proof of the Church-Rosser theorem
- Appendix B: Introduction to typed -calculus
- Bibliographical notes
- References.
by "Nielsen BookData"