J. Roger Hindley (Swansea University of Wales), Jonathan P. Seldin (Alberta University of Lethbridge)

Lambda-Calculus and Combinators

An Introduction

• Gebundenes Buch

Produktbeschreibung

This book gives an account of combinatory logic and lambda-calculus. The grammar and basic properties of both systems are discussed, followed by explanations of type-theory and lambda-calculus models. The treatment is as non-technical as possible with many examples and exercises.

---

Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.

Produktdetails

• Verlag: Cambridge University Press
• 2 Revised edition
• Seitenzahl: 358
• Erscheinungstermin: 22. Februar 2013
• Englisch
• Abmessung: 235mm x 157mm x 26mm
• Gewicht: 676g
• ISBN-13: 9780521898850
• ISBN-10: 0521898854
• Artikelnr.: 23548454

Autorenporträt

J. Roger Hindley is an Honorary Research Fellow at Swansea University, Wales. His main research interests are Lambda-calculus and combinatory logic and he has taught at many international universities including Bristol University, Pennsylvania State University and Tokyo Institute of technology. This is his 7th book.

Inhaltsangabe

Preface; 1. The
-calculus; 2. Combinatory logic; 3. The power of
and CL; 4. Computable functions; 5. Undecidability; 6. Formal theories; 7. Extensionality in
-calculus; 8. Extensionality in CL; 9. Correspondence between
and CL; 10. Simple typing, Church-style; 11. Simple typing, Curry-style in CL; 12. Simple typing, Curry-style in
; 13. Generalizations of typing; 14. Models of CL; 15. Models of
; 16. Scott's D
and other models; Appendix 1.
-conversion; Appendix 2. Confluence proofs; Appendix 3. Normalization proofs; Appendix 4. Care of your pet combinator; Appendix 5. Answers to starred exercises; Bibliography; Index.