内容

目次

Preface; 1. The lambda-calculus; 2. Combinatory logic; 3. The power oflambda and CL; 4. Computable functions; 5. Undecidability; 6. Formaltheories; 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; 16.Scott's D and other models; Appendix A1. alpha-conversion; Appendix A2.Confluence proofs; Appendix A3. Normalization proofs; Appendix A4. Care ofyour pet combinator; Appendix A5. Answers to starred exercises; Bibliography;Index.