Lambda-calculus, Combinators and Functional Programming - Rilegato

Revesz, G. E.

Rilegato

ISBN 10: 0521345898 ISBN 13: 9780521345897

Casa editrice: Cambridge University Press, 1988

Riassunto

Provides computer science students and researchers with a firm background in lambda-calculus and combinators.

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: 1988
• Lingua: Inglese
• ISBN 10: 0521345898
• ISBN 13: 9780521345897
• Rilegatura: Copertina rigida
• Numero di pagine: 192
• Contatto del produttore: non disponibile
• Persona responsabile: Avery; https://www.avery.fr/; ; chemin des peupliers 27; Dardilly; Francia