Parametre
- 192 stránok
- 7 hodin čítania
Viac o knihe
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.
Nákup knihy
Cambridge Tracts in Theoretical Computer Science 4. Lambda-Calculus, Combinators and Functional Programming, György E. Révész
- Jazyk
- Rok vydania
- 2009
- product-detail.submit-box.info.binding
- (mäkká),
- Stav knihy
- Poškodená
- Cena
- 17,77 €
Platobné metódy
Nikto zatiaľ neohodnotil.
- Titul
- Cambridge Tracts in Theoretical Computer Science 4. Lambda-Calculus, Combinators and Functional Programming
- Jazyk
- anglicky
- Autori
- György E. Révész
- Vydavateľ
- Cambridge University Press
- Rok vydania
- 2009
- Väzba
- mäkká
- Počet strán
- 192
- ISBN10
- 0521114292
- ISBN13
- 9780521114295
- Série
- Štítky
- Náučná literatúra, Spoločenské vedy, Technológie & Priemysel, Veda & Matematika, Počítače & Internet, Matematika, Jazyky, Logika
- Anotácia
- 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.