Paperback. Condition: Very Good. Ex-library paperback in very nice condition with the usual markings and attachments. Except for library markings, interior clean and unmarked. Tight binding.
Language: English
Published by Springer Berlin / Heidelberg, 1998
ISBN 10: 354064301X ISBN 13: 9783540643012
Seller: Better World Books, Mishawaka, IN, U.S.A.
Condition: Good. Former library copy. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.
Broschiert. Condition: Gut. 218 Seiten; Das hier angebotene Buch stammt aus einer teilaufgelösten Bibliothek und kann die entsprechenden Kennzeichnungen aufweisen (Rückenschild, Instituts-Stempel.); der Buchzustand ist ansonsten ordentlich und dem Alter entsprechend gut. In ENGLISCHER Sprache. Sprache: Englisch Gewicht in Gramm: 395.
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
Paperback. Condition: Very Good. 0387582339 Ex-library paperback in very nice condition with the usual markings and attachments.
Language: English
Published by Association of Computing Machinery,U.S., US, 2025
ISBN 13: 9798400731594
Seller: Rarewaves USA, OSWEGO, IL, U.S.A.
Paperback. Condition: New. This book is an introduction to data structures and algorithms for functional programming languages, with a focus on proofs. Starting with sorting and searching, it moves on to priority queues and advanced design and analysis techniques: dynamic programming, amortized analysis, splay trees, skew heaps and pairing heaps. The final part of the book covers a number of selected fun topics: graph algorithms, string search, Huffman's algorithm for generating optimal codes and alpha-beta pruning of game trees. The book covers both correctness (does the algorithm do what it is supposed to do?) and running time analysis (does the algorithm terminate within a specified number of steps?). It does so in a unified manner with inductive proofs about functional programs and their running time functions. What sets this book apart from existing books on algorithms is that all proofs have been machine-checked, by the proof assistant Isabelle. That is, in addition to the text in the book, which requires no knowledge of proof assistants!, the Isabelle definitions and proofs are available online. The structured nature of Isabelle proofs permits even novices to follow the high-level arguments. This book is aimed at teachers and students (it has been classroom-tested for a number of years) but is also a reference work for programmers and researchers who are interested in the (verified!) details of some algorithm or proof.
Condition: New.
Condition: As New. Unread book in perfect condition.
Seller: Ria Christie Collections, Uxbridge, United Kingdom
£ 45.35
Quantity: Over 20 available
Add to basketCondition: New. In.
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000.
Language: English
Published by Cambridge University Press, 1999
ISBN 10: 0521779200 ISBN 13: 9780521779203
Seller: MostlyAcademic, Berrima, NSW, Australia
Soft cover. Condition: As New.
Language: English
Published by Association of Computing Machinery,U.S., US, 2025
ISBN 13: 9798400731594
Seller: Rarewaves.com USA, London, LONDO, United Kingdom
Paperback. Condition: New. This book is an introduction to data structures and algorithms for functional programming languages, with a focus on proofs. Starting with sorting and searching, it moves on to priority queues and advanced design and analysis techniques: dynamic programming, amortized analysis, splay trees, skew heaps and pairing heaps. The final part of the book covers a number of selected fun topics: graph algorithms, string search, Huffman's algorithm for generating optimal codes and alpha-beta pruning of game trees. The book covers both correctness (does the algorithm do what it is supposed to do?) and running time analysis (does the algorithm terminate within a specified number of steps?). It does so in a unified manner with inductive proofs about functional programs and their running time functions. What sets this book apart from existing books on algorithms is that all proofs have been machine-checked, by the proof assistant Isabelle. That is, in addition to the text in the book, which requires no knowledge of proof assistants!, the Isabelle definitions and proofs are available online. The structured nature of Isabelle proofs permits even novices to follow the high-level arguments. This book is aimed at teachers and students (it has been classroom-tested for a number of years) but is also a reference work for programmers and researchers who are interested in the (verified!) details of some algorithm or proof.
Language: English
Published by Cambridge University Press, 1999
ISBN 10: 0521779200 ISBN 13: 9780521779203
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition.
Seller: Ria Christie Collections, Uxbridge, United Kingdom
£ 50.43
Quantity: Over 20 available
Add to basketCondition: New. In.
£ 50.43
Quantity: Over 20 available
Add to basketCondition: New. In.
Seller: Ria Christie Collections, Uxbridge, United Kingdom
£ 50.43
Quantity: Over 20 available
Add to basketCondition: New. In.
Seller: Ria Christie Collections, Uxbridge, United Kingdom
£ 50.43
Quantity: Over 20 available
Add to basketCondition: New. In.
Seller: Ria Christie Collections, Uxbridge, United Kingdom
£ 50.43
Quantity: Over 20 available
Add to basketCondition: New. In.
Seller: Chiron Media, Wallingford, United Kingdom
PF. Condition: New.
Language: English
Published by Berlin, Heidelberg: Springer-Verlag, 2001
ISBN 10: 3540422544 ISBN 13: 9783540422549
Seller: Antiquariat Bernhardt, Kassel, Germany
Broschiert Broschiert. Condition: Sehr gut. XV, 708 Seiten, Lecture Notes in Artificial Intelligence, Band 2083. Zust: Gutes Exemplar. Mit Vorbesitzereintrag. Schneller Versand und persönlicher Service - jedes Buch händisch geprüft und beschrieben - aus unserem Familienbetrieb seit über 25 Jahren. Eine Rechnung mit ausgewiesener Mehrwertsteuer liegt jeder unserer Lieferungen bei. Wir versenden mit der deutschen Post. Sprache: Englisch Gewicht in Gramm: 1030.
Seller: Chiron Media, Wallingford, United Kingdom
PF. Condition: New.
Condition: New.
Condition: New.
Language: English
Published by Cambridge University Press, 1999
ISBN 10: 0521779200 ISBN 13: 9780521779203
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New.
Language: English
Published by Cambridge University Press, 1999
ISBN 10: 0521779200 ISBN 13: 9780521779203
Seller: California Books, Miami, FL, U.S.A.
Condition: New.
Condition: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.
Condition: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
Language: English
Published by Cambridge University Press, GB, 1999
ISBN 10: 0521779200 ISBN 13: 9780521779203
Seller: Rarewaves.com USA, London, LONDO, United Kingdom
Paperback. Condition: New. This textbook offers a unified and self-contained introduction to the field of term rewriting. It covers all the basic material (abstract reduction systems, termination, confluence, completion, and combination problems), but also some important and closely connected subjects: universal algebra, unification theory, Gröbner bases and Buchberger's algorithm. The main algorithms are presented both informally and as programs in the functional language Standard ML (an appendix contains a quick and easy introduction to ML). Certain crucial algorithms like unification and congruence closure are covered in more depth and Pascal programs are developed. The book contains many examples and over 170 exercises. This text is also an ideal reference book for professional researchers: results that have been spread over many conference and journal articles are collected together in a unified notation, proofs of almost all theorems are provided, and each chapter closes with a guide to the literature.
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: New.