Lambda-Calculus, Combinators and Functional Programming Contributor(s): Revesz, G. E. (Author) |
|||
ISBN: 0521114292 ISBN-13: 9780521114295 Publisher: Cambridge University Press
Binding Type: Paperback - See All Available Formats & Editions Published: June 2009 Annotation: Provides computer science students and researchers with a firm background in lambda-calculus and combinators. Click for more in this series: Cambridge Tracts in Theoretical Computer Science (Paperback) |
Additional Information |
BISAC Categories: - Mathematics | Logic - Computers | Software Development & Engineering - General - Computers | Programming Languages - General |
Dewey: 511.3 |
Series: Cambridge Tracts in Theoretical Computer Science (Paperback) |
Physical Information: 0.41" H x 6.69" W x 9.61" L (0.69 lbs) 192 pages |
Descriptions, Reviews, Etc. |
Publisher 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. |
Customer ReviewsSubmit your own review |
To tell a friend about this book, you must Sign In First! |