| Description |
xiii, 162 pages ; 24 cm |
| Series |
Graduate texts in computer science ; 3 |
|
Graduate texts in computer science ; 3
|
| Contents |
1. Introduction -- 2. Notation and the Basic Theory --3. Reduction -- 4. Combinatory Logic -- 5. Semantics --6. Computability -- 7. Types -- 8. Practical Issues --9. Other Calculi -- 10. Further Reading |
| Summary |
In contrast to earlier books on these topics, which were written by logicians, the book is written from a computer science perspective and emphasizes 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 |
|
The [lambda]-calculus lies at the very foundations of computer science. 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 emphasizes the proof theory for the type-free [lambda]-calculus. The first six chapters concern this calculus and cover the basic theory, reduction, models, computability, and the relationship between the [lambda]-calculus and combinatory logic. Chapter 7 presents a variety of typed calculi; first the simply typed [lambda]-calculus, then Milner-style polymorphism and, finally, the polymorphic [lambda]-calculus. Chapter 8 concerns three variants of the type-free [lambda]-calculus that have recently appeared in the research literature: the lazy [lambda]-calculus, the concurrent [gamma]-calculus and the [lambda][sigma]-calculus. The final chapter contains references and a guide to further reading. There are exercises throughout |
| Notes |
Includes bubliographical references and index |
| Bibliography |
Bibliography: pages [157]-158 |
| Subject |
Lambda calculus.
|
| LC no. |
94028188 |
| ISBN |
0198538405 (paperback) |
|
0198538413 |
|
