Lambda-Calculus, Combinators and Functional Programming

Klappentext Provides computer science students and researchers with a firm background in lambda-calculus and combinators. Zusammenfassung Originally published in 1988! this book presents an introduction to lambda-calculus and combinators without getting lost in the details of mathematical aspects of their theory. Lambda-calculus is treated here as a functional language and its relevance to computer science is clearly demonstrated. Inhaltsverzeichnis Preface; 1. Introduction; 2. Type-free lambda-calculus; 3. Combinators and constant symbols; 4. List manipulation in lambda-calculus; 5. Rule-based semantics of ¿-expressions; 6. Outlines of a reduction machine; 7. Towards a parallel graph-reduction; Appendix A: A proof of the Church-Rosser theorem; Appendix B: Introduction to typed ¿-calculus; Bibliographical notes; References.

Détails du produit

• Auteurs: G. E. Revesz, Gyorgy E. Revesz
• Edition: Cambridge University Press ELT
• Langues: Anglais
• Format d'édition: Livre de poche
• Sortie: 25.06.2009
• EAN: 9780521114295
• ISBN: 978-0-521-11429-5
• Pages: 192
• Thèmes: Cambridge Tracts in Theoretical Computer Science; Cambridge Tracts in Theoretica
• Catégorie: Sciences naturelles, médecine, informatique, technique > Informatique, ordinateurs > Langages de programmation