02804nam a22003378i 4500001001600000003000700016008004100023020001800064020001800082035002000100041000800120082001600128100003100144245010400175250002000279264007100299300003800370336002600408337002600434338003600460500001300496505074900509520093901258650002102197650002302218700002702241856005502268932003202323596000602355949010502361CR9780511809835UkCbUP101021s2008||||enk o ||1 0|eng|d a9780511809835 a9780521898850 a(Sirsi) a791627 aeng00a511.3/52221 aHindley, J. Roger,eauthor10aLambda-calculus and combinators, an introductionh[E-Book] /cJ. Roger Hindley, Jonathan P. Seldin. aSecond edition. 1aCambridge :bCambridge University Press,c2008e(CUP)fCUP20200108 a1 online resource (xi, 345 pages) atextbtxt2rdacontent acomputerbc2rdamedia aonline resourcebcr2rdacarrier aenglisch0 aPreface; 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. aCombinatory logic and lambda-calculus, 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 lambda-calculus for over 20 years: this version is thoroughly revised and offers an account of the subject with the same authoritative exposition. 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. The treatment is as non-technical as possible, with the main ideas emphasized and illustrated by examples. Many exercises are included, from routine to advanced, with solutions to most at the end of the book. 0aLambda calculus. 0aCombinatory logic.1 aSeldin, J. P.,eauthor40uhttps://doi.org/10.1017/CBO9780511809835zVolltext aCambridgeCore (Order 30059) a1 aXX(791627.1)wAUTOc1i791627-1001lELECTRONICmZBrNsYtE-BOOKu8/1/2020xUNKNOWNzUNKNOWN1ONLINE