Lambda-calculus, Combinators and Functional Programming - Brossura

Revesz, G

 
9780521114295: Lambda-calculus, Combinators and Functional Programming

Sinossi

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

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

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.

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

Altre edizioni note dello stesso titolo

9780521345897: Lambda-calculus, Combinators and Functional Programming

Edizione in evidenza

ISBN 10:  0521345898 ISBN 13:  9780521345897
Casa editrice: Cambridge University Press, 1988
Rilegato