Parametry
- 192 stránek
- 7 hodin čtení
Více o knize
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 vydání
- 2009
- product-detail.submit-box.info.binding
- (měkká),
- Stav knihy
- Poškozená
- Cena
- 820 Kč
Doručení
Platební metody
Nikdo zatím neohodnotil.
- Titul
- Cambridge Tracts in Theoretical Computer Science - 4: Lambda-calculus, Combinators and Functional Programming
- Jazyk
- anglicky
- Autoři
- György E. Révész
- Vydavatel
- Cambridge University Press
- Rok vydání
- 2009
- Vazba
- měkká
- Počet stran
- 192
- ISBN10
- 0521114292
- ISBN13
- 9780521114295
- Série
- Štítky
- Naučná literatura, Společenské vědy, Technologie & Průmysl, Věda & Matematika, Počítače & Internet, Matematika, Jazyky, Logika
- Anotace
- 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.