An Introduction to Lambda Calculi for Computer Scientists, Second Edition (Softcover)

Condition

VERY GOOD: This book is in very good condition, showing very few signs of use and wear. There is no writing on the pages.

Product Details

Continued from the back cover: "Besides its historical role in computability theory it has had significant influence on programming language design and implementation, denotational semantics, and domain theory. The book emphasises the proof theory for the type-free λ-calculus. The first six chapters concern this calculus and cover the basic theory, reduction, models, computability, and the relationship between the λ-calculus and combinatory logic. Chapter 7 presents a variety of typed calculi; first the simply typed λ-calculus, then Milner-style polymorphism, and finally, the polymorphic λ-calculus. Chapter 8 concerns two variants of the type-free λ-calculus that have appeared in the research literature: the lazy λ-calculus, and the λσ-calculus. The final chapter contains references and a guide to further reading. There are exercises throughout. In contrast to earlier books on these topics, which were written by logicians, this book is written from a computer science perspective and emphasises the practical relevance of many of the key theoretical ideas. The book is intended as a course text for final year undergraduates or first year graduate students in computer science. Research students should find it a useful introduction to more specialist literature."

Notes

British spelling.

This is Volume 2 of the Texts in Computing series by King's College Publications. The author notes that this second edition is an update of his 1994 first edition, stating, "The main reasons for republishing the book is that it has been out of print for a few years and there now seems to be a reawakening interest in incorporating λ-calculus in the undergraduate Computer Science curriculum; there has also been considerable interest from the Computational Linguistics community."