Description |
1 online resource (xi, 345 pages) : illustrations |
Contents |
Preface; 1. The lambda-calculus; 2. Combinatory logic; 3. The power of lambda and combinations; 4. Representing the computable functions; 5. Undecidability theorem; 6. Formal theories; 7. Extensionality in lambda-calculus; 8. Extensionality in CL; 9. Correspondence between lambda and CL; 10. Simple typing, Church-style; 11. Simple typing, Curry-style in CL; 12. Simple typing, Curry-style in lambda; 13. Generalizations of typing; 14. Models of CL; 15. Models of lambda-calculus; 16. Scott's D and other models; Appendix A1. Bound variables and alpha-conversion; Appendix A2. Confluence proofs; Appendix A3. Strong normalization proofs; Appendix A4. Care of your pet combinator; Appendix A5. Answers to starred exercises; Bibliography; Index |
Summary |
"In this up-to-date account of the subject, the grammar and basic properties of both combinatory logic and [lambda]-calculus are discussed, followed by an introduction to type-theory. Typed and untyped versions of the systems, and their differences, are covered. [lambda]-calculus models, which lie behind much of the semantics of programming languages, are also explained in depth."--Jacket |
Bibliography |
Includes bibliographical references (pages 323-333) and index |
Notes |
Print version record |
Subject |
Lambda calculus.
|
|
Combinatory logic.
|
|
COMPUTERS -- Machine Theory.
|
|
Combinatory logic
|
|
Lambda calculus
|
Form |
Electronic book
|
Author |
Seldin, J. P.
|
ISBN |
9780511415562 |
|
0511415567 |
|
9780521898850 |
|
0521898854 |
|
0511413297 |
|
9780511413292 |
|
9780511809835 |
|
0511809832 |
|
1281751529 |
|
9781281751522 |
|
9780511412363 |
|
0511412363 |
|