Lambda-calculus and combinators: An introduction J. Roger Hindley, Jonathan P. Seldin
Publication details: Cambridge ; New York : Cambridge University Press, 2008.Description: xi, 345 p. : ill. ; 24 cmISBN:- 9780521898850
- 511.6
- QA9.5
| Item type | Current library | Call number | Copy number | Status | Date due | Barcode | |
|---|---|---|---|---|---|---|---|
| Carti | IMAR | 511.6-HIN (Browse shelf(Opens below)) | 1 | Available | 0036488 |
Browsing IMAR shelves Close shelf browser (Hides shelf browser)
|
No cover image available |
|
|
No cover image available |
|
|
||
| 511.6-GRE-3 Lectures in Pattern Theory: vol. 3: Regular Structures | 511.6-GRE-3 Lectures in Pattern Theory: Volume 3: Regular Structures: | 511.6-HAR Combinatorics and graph theory | 511.6-HIN Lambda-calculus and combinators: An introduction | 511.6-LOT Combinatorics on Words | 511.6-LOT-1 Algebraic combinatorics on words | 511.6-LOT-1 Applied combinatorics on words |
eng
Bibliografie p. 323
Index p. 337
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.
There are no comments on this title.