Published by Cambridge University Press, 1988
ISBN 10: 0521345898 ISBN 13: 9780521345897
Language: English
Seller: Better World Books, Mishawaka, IN, U.S.A.
Condition: Good. Former library book; may include library markings. Used book that is in clean, average condition without any missing pages.
Published by Cambridge University Press, 2009
ISBN 10: 0521114292 ISBN 13: 9780521114295
Language: English
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Condition: New.
Published by Cambridge University Press 2009-06, 2009
ISBN 10: 0521114292 ISBN 13: 9780521114295
Language: English
Seller: Chiron Media, Wallingford, United Kingdom
£ 43.05
Convert currencyQuantity: 10 available
Add to basketPF. Condition: New.
Published by Cambridge University Press, 2009
ISBN 10: 0521114292 ISBN 13: 9780521114295
Language: English
Seller: California Books, Miami, FL, U.S.A.
Condition: New.
Published by Cambridge University Press, 2009
ISBN 10: 0521114292 ISBN 13: 9780521114295
Language: English
Seller: Ria Christie Collections, Uxbridge, United Kingdom
£ 47.70
Convert currencyQuantity: Over 20 available
Add to basketCondition: New. In.
Published by Cambridge University Press, Cambridge, 2010
ISBN 10: 0521114292 ISBN 13: 9780521114295
Language: English
Seller: Grand Eagle Retail, Fairfield, OH, 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
Published by Cambridge University Press CUP, 2009
ISBN 10: 0521114292 ISBN 13: 9780521114295
Language: English
Seller: Books Puddle, New York, NY, U.S.A.
Condition: New. pp. 192.
Published by Cambridge University Press, 1988
ISBN 10: 0521345898 ISBN 13: 9780521345897
Language: English
£ 50
Convert currencyQuantity: 1 available
Add to basketCloth/Laminated Boards. Condition: Very Good. Type: Book N.B. Small gold label to ffep. Pen marks to top edge of pages, content unaffected.
Published by Cambridge University Press, Cambridge, 2010
ISBN 10: 0521114292 ISBN 13: 9780521114295
Language: English
Seller: CitiRetail, Stevenage, United Kingdom
£ 51.49
Convert currencyQuantity: 1 available
Add to basketPaperback. 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. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.
Published by Cambridge University Press, 2009
ISBN 10: 0521114292 ISBN 13: 9780521114295
Language: English
Seller: AHA-BUCH GmbH, Einbeck, Germany
£ 68.17
Convert currencyQuantity: 1 available
Add to basketTaschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Provides computer science students and researchers with a firm background in lambda-calculus and combinators.
Published by Cambridge University Press, Cambridge, 2010
ISBN 10: 0521114292 ISBN 13: 9780521114295
Language: English
Seller: AussieBookSeller, Truganina, VIC, Australia
£ 91.38
Convert currencyQuantity: 1 available
Add to basketPaperback. 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. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
Published by Cambridge University Press, 2009
ISBN 10: 0521114292 ISBN 13: 9780521114295
Language: English
Seller: Mispah books, Redhill, SURRE, United Kingdom
£ 103
Convert currencyQuantity: 1 available
Add to basketPaperback. Condition: Like New. Like New. book.
Published by Cambridge University Press, 2009
ISBN 10: 0521114292 ISBN 13: 9780521114295
Language: English
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
£ 52.65
Convert currencyQuantity: Over 20 available
Add to basketPaperback / softback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 350.
Seller: Revaluation Books, Exeter, United Kingdom
£ 56.80
Convert currencyQuantity: 1 available
Add to basketPaperback. Condition: Brand New. 1st edition. 191 pages. 9.61x6.69x0.41 inches. In Stock. This item is printed on demand.
Published by Cambridge University Press, 2009
ISBN 10: 0521114292 ISBN 13: 9780521114295
Language: English
Seller: Majestic Books, Hounslow, United Kingdom
£ 73.80
Convert currencyQuantity: 4 available
Add to basketCondition: 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.
Published by Cambridge University Press, 2009
ISBN 10: 0521114292 ISBN 13: 9780521114295
Language: English
Seller: Biblios, Frankfurt am main, HESSE, Germany
Condition: New. PRINT ON DEMAND pp. 192.
Published by Cambridge University Press, 2009
ISBN 10: 0521114292 ISBN 13: 9780521114295
Language: English
Seller: moluna, Greven, Germany
£ 57.19
Convert currencyQuantity: Over 20 available
Add to basketCondition: 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.