Language: English
Published by Cambridge University Press, 2009
ISBN 10: 0521114292 ISBN 13: 9780521114295
Seller: ThriftBooks-Atlanta, AUSTELL, GA, U.S.A.
Paperback. Condition: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less.
Language: English
Published by Cambridge University Press, 2009
ISBN 10: 0521114292 ISBN 13: 9780521114295
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New.
Language: English
Published by Cambridge University Press, 2009
ISBN 10: 0521114292 ISBN 13: 9780521114295
Seller: California Books, Miami, FL, U.S.A.
Condition: New.
Language: English
Published by Cambridge University Press, 2009
ISBN 10: 0521114292 ISBN 13: 9780521114295
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition.
Language: English
Published by Cambridge University Press, 2009
ISBN 10: 0521114292 ISBN 13: 9780521114295
Seller: Bookbot, Prague, Czech Republic
Softcover. Condition: Fair. Spuren von Feuchtigkeit / Nässe; 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.
Language: English
Published by Cambridge University Press, 2009
ISBN 10: 0521114292 ISBN 13: 9780521114295
Seller: Ria Christie Collections, Uxbridge, United Kingdom
£ 57.98
Quantity: Over 20 available
Add to basketCondition: New. In.
Language: English
Published by Cambridge University Press 2009-04-06, 2009
ISBN 10: 0521114292 ISBN 13: 9780521114295
Seller: Chiron Media, Wallingford, United Kingdom
Paperback. Condition: New.
Language: English
Published by Cambridge University Press, 2009
ISBN 10: 0521114292 ISBN 13: 9780521114295
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: New.
Language: English
Published by Cambridge University Press, 1988
ISBN 10: 0521345898 ISBN 13: 9780521345897
Cloth/Laminated Boards. Condition: Very Good. Type: Book N.B. Small gold label to ffep. Pen marks to top edge of pages, content unaffected.
Language: English
Published by Cambridge University Press, 2009
ISBN 10: 0521114292 ISBN 13: 9780521114295
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
First Edition
Condition: 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. . . . .
Language: English
Published by Cambridge University Press, 2009
ISBN 10: 0521114292 ISBN 13: 9780521114295
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: As New. Unread book in perfect condition.
Language: English
Published by Cambridge University Press CUP, 2009
ISBN 10: 0521114292 ISBN 13: 9780521114295
Seller: Books Puddle, New York, NY, U.S.A.
Condition: New. pp. 192.
Language: English
Published by Cambridge University Press, 2009
ISBN 10: 0521114292 ISBN 13: 9780521114295
Seller: Kennys Bookstore, Olney, MD, U.S.A.
Condition: 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. . . . . Books ship from the US and Ireland.
Language: English
Published by Cambridge University Press, 2009
ISBN 10: 0521114292 ISBN 13: 9780521114295
Seller: AHA-BUCH GmbH, Einbeck, Germany
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Provides computer science students and researchers with a firm background in lambda-calculus and combinators.
Language: English
Published by Cambridge University Press, 2009
ISBN 10: 0521114292 ISBN 13: 9780521114295
Seller: Mispah books, Redhill, SURRE, United Kingdom
Paperback. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
Language: English
Published by Cambridge University Press, Cambridge, 2009
ISBN 10: 0521114292 ISBN 13: 9780521114295
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.
Paperback. Condition: new. Paperback. 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. 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. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
Seller: Revaluation Books, Exeter, United Kingdom
Paperback. Condition: Brand New. 1st edition. 191 pages. 9.61x6.69x0.41 inches. In Stock. This item is printed on demand.
Language: English
Published by Cambridge University Press, 2009
ISBN 10: 0521114292 ISBN 13: 9780521114295
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
£ 64.43
Quantity: Over 20 available
Add to basketPaperback / softback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
Language: English
Published by Cambridge University Press, 2009
ISBN 10: 0521114292 ISBN 13: 9780521114295
Seller: Majestic Books, Hounslow, United Kingdom
Condition: New. Print on Demand pp. 192 67:B&W 6.69 x 9.61 in or 244 x 170 mm (Pinched Crown) Perfect Bound on White w/Gloss Lam.
Language: English
Published by Cambridge University Press, 2009
ISBN 10: 0521114292 ISBN 13: 9780521114295
Seller: Biblios, Frankfurt am main, HESSE, Germany
Condition: New. PRINT ON DEMAND pp. 192.
Language: English
Published by Cambridge University Press, Cambridge, 2009
ISBN 10: 0521114292 ISBN 13: 9780521114295
Seller: CitiRetail, Stevenage, United Kingdom
Paperback. Condition: new. Paperback. 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. 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. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.
Language: English
Published by Cambridge University Press, 2009
ISBN 10: 0521114292 ISBN 13: 9780521114295
Seller: moluna, Greven, Germany
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 co.
Language: English
Published by Cambridge University Press, Cambridge, 2009
ISBN 10: 0521114292 ISBN 13: 9780521114295
Seller: AussieBookSeller, Truganina, VIC, Australia
Paperback. Condition: new. Paperback. 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. 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. This item is printed on demand. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.