Parameters
- 192 pages
- 7 hours of reading
More about the book
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.
Book purchase
Cambridge Tracts in Theoretical Computer Science - 4: Lambda-calculus, Combinators and Functional Programming, György E. Révész
- Language
- Released
- 2009
- product-detail.submit-box.info.binding
- (Paperback),
- Book condition
- Damaged
- Price
- €33.90
Payment methods
No one has rated yet.
- Title
- Cambridge Tracts in Theoretical Computer Science - 4: Lambda-calculus, Combinators and Functional Programming
- Language
- English
- Authors
- György E. Révész
- Publisher
- Cambridge University Press
- Released
- 2009
- Format
- Paperback
- Pages
- 192
- ISBN10
- 0521114292
- ISBN13
- 9780521114295
- Series
- Tags
- Non-Fiction, Social Sciences, Technology & Engineering, Science & Math, Computers & Internet, Mathematics, Languages, Logic
- 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.