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.
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.
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.
Da: medimops, Berlin, Germania
Condizione: as new. Wie neu/Like new. Codice articolo M00521114292-N
Quantità: 1 disponibili
Da: Bookbot, Prague, Repubblica Ceca
Softcover. Condizione: Fair. Verschmutzung / Wasserschaden; Leichte Kratzer / Abnutzungen / Druckstellen. 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. Codice articolo 4970bdc6-3c13-4f93-8a4d-19213dfb2a96
Quantità: 1 disponibili
Da: ThriftBooks-Atlanta, AUSTELL, GA, U.S.A.
Paperback. Condizione: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less. Codice articolo G0521114292I4N00
Quantità: 1 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: New. Codice articolo 6168676-n
Quantità: Più di 20 disponibili
Da: California Books, Miami, FL, U.S.A.
Condizione: New. Codice articolo I-9780521114295
Quantità: Più di 20 disponibili
Da: Revaluation Books, Exeter, Regno Unito
Paperback. Condizione: Brand New. 1st edition. 191 pages. 9.61x6.69x0.41 inches. In Stock. This item is printed on demand. Codice articolo __0521114292
Quantità: 1 disponibili
Da: Chiron Media, Wallingford, Regno Unito
Paperback. Condizione: New. Codice articolo 6666-IUK-9780521114295
Quantità: 10 disponibili
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Condizione: New. Provides computer science students and researchers with a firm background in lambda-calculus and combinators. Series: Cambridge Tracts in Theoretical Computer Science. Num Pages: 192 pages, black & white illustrations. BIC Classification: UYA. Category: (U) Tertiary Education (US: College). Dimension: 243 x 172 x 11. Weight in Grams: 326. . 2009. 1st Edition. paperback. . . . . Codice articolo V9780521114295
Quantità: Più di 20 disponibili
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Condizione: New. Codice articolo 6168676-n
Quantità: Più di 20 disponibili
Da: Ria Christie Collections, Uxbridge, Regno Unito
Condizione: New. In. Codice articolo ria9780521114295_new
Quantità: Più di 20 disponibili