Lambda-calculus, Combinators and Functional Programming - Brossura

Revesz, G

Brossura

ISBN 10: 0521114292 ISBN 13: 9780521114295

Casa editrice: Cambridge University Press, 2009

Riassunto

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. The main purpose of the book is to provide computer science students and researchers with a firm background in lambda-calculus and combinators and show the applicabillity of these theories to functional programming. The presentation of the material is self-contained. It can be used as a primary text for a course on functional programming. It can also be used as a supplementary text for courses on the structure and implementation of programming languages, theory of computing, or semantics of programming languages.

Su questo libro

Descrizione del libro

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.

Contenuti

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.

Dettagli dell?edizione

• Editore: Cambridge University Press
• Data di pubblicazione: 2009
• ISBN 10: 0521114292
• ISBN 13: 9780521114295
• Rilegatura: Copertina flessibile
• Lingua: Inglese
• Numero edizione: 1
• Numero di pagine: 192