Lambda-calculus and combinators, an introduction [E-Book] / J. Roger Hindley, Jonathan P. Seldin.
Hindley, J. Roger, (author)
Seldin, J. P., (author)
Second edition.
Cambridge : Cambridge University Press, 2008
1 online resource (xi, 345 pages)
englisch
9780521898850
9780511809835
Full Text
Table of 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.