Lambdacalculus and combinators, an introduction [EBook] / J. Roger Hindley, Jonathan P. Seldin.
Lambdacalculus and combinators, an introduction [EBook] / J. Roger Hindley, Jonathan P. Seldin.
Combinatory logic and lambdacalculus, originally devised in the 1920s, have since developed into linguistic tools, especially useful in programming languages. The authors' previous book served as the main reference for introductory courses on lambdacalculus for over 20 years: this version is...
Personal Name(s):  Hindley, J. Roger, (author) 

Seldin, J. P., (author)  
Edition: 
Second edition. 
Imprint: 
Cambridge :
Cambridge University Press,
2008

Physical Description: 
1 online resource (xi, 345 pages) 
Note: 
englisch 
ISBN: 
9780521898850 9780511809835 
Subject (LOC):  
Full Text 
Table of Contents:
 Preface; 1. The lambdacalculus; 2. Combinatory logic; 3. The power of lambda and combinations; 4. Representing the computable functions; 5. Undecidability theorem; 6. Formal theories; 7. Extensionality in lambdacalculus; 8. Extensionality in CL; 9. Correspondence between lambda and CL; 10. Simple typing, Churchstyle; 11. Simple typing, Currystyle in CL; 12. Simple typing, Currystyle in lambda; 13. Generalizations of typing; 14. Models of CL; 15. Models of lambdacalculus; 16. Scott's D and other models; Appendix A1. Bound variables and alphaconversion; Appendix A2. Confluence proofs; Appendix A3. Strong normalization proofs; Appendix A4. Care of your pet combinator; Appendix A5. Answers to starred exercises; Bibliography; Index.