Verkauf durch Sack Fachmedien

Revesz

Lambda-Calculus, Combinators and Functional Programming

Medium: Buch
ISBN: 978-0-521-11429-5
Verlag: Cambridge University Press
Erscheinungstermin: 27.02.2009
Lieferfrist: bis zu 10 Tage

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.


Produkteigenschaften


  • Artikelnummer: 9780521114295
  • Medium: Buch
  • ISBN: 978-0-521-11429-5
  • Verlag: Cambridge University Press
  • Erscheinungstermin: 27.02.2009
  • Sprache(n): Englisch
  • Auflage: Erscheinungsjahr 2009
  • Serie: Cambridge Tracts in Theoretical Computer Science
  • Produktform: Kartoniert, Paperback
  • Gewicht: 342 g
  • Seiten: 192
  • Format (B x H x T): 170 x 244 x 11 mm
  • Ausgabetyp: Kein, Unbekannt
Autoren/Hrsg.

Autoren

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.