Please note: In order to keep Hive up to date and provide users with the best features, we are no longer able to fully support Internet Explorer. The site is still available to you, however some sections of the site may appear broken. We would encourage you to move to a more modern browser like Firefox, Edge or Chrome in order to experience the site fully.

Lambda-calculus, Combinators and Functional Programming, Paperback / softback Book

Lambda-calculus, Combinators and Functional Programming Paperback / softback

Part of the Cambridge Tracts in Theoretical Computer Science series

Paperback / softback

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.

Information

Save 5%

£47.99

£45.59

 
Free Home Delivery

on all orders

 
Pick up orders

from local bookshops

Information

Also in the Cambridge Tracts in Theoretical Computer Science series  |  View all