Paramètres
- 192pages
- 7 heures de lecture
En savoir plus sur le livre
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.
Achat du livre
Cambridge Tracts in Theoretical Computer Science 4. Lambda-Calculus, Combinators and Functional Programming, György E. Révész
- Langue
- Année de publication
- 2009
- product-detail.submit-box.info.binding
- (souple),
- État du livre
- Abîmé
- Prix
- 17,77 €
Modes de paiement
Personne n'a encore évalué .
- Titre
- Cambridge Tracts in Theoretical Computer Science 4. Lambda-Calculus, Combinators and Functional Programming
- Langue
- Anglais
- Auteurs
- György E. Révész
- Éditeur
- Cambridge University Press
- Publié
- 2009
- Format
- souple
- Pages
- 192
- ISBN10
- 0521114292
- ISBN13
- 9780521114295
- Séries
- Mots clés
- Nonfiction, Sciences sociales, Technologie & Ingénierie, Science et Mathématiques, Informatique & Internet, Mathématiques, Langues, Logique
- Description
- 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.