Unified and self-contained introduction to term-rewriting; suited for students or professionals.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
'... a welcome and important addition to the library of any researcher interested in theoretical computer science. It provides a thorough grounding in the subject in a clear style, and gives plenty of indications of further directions, including an extensive bibliography'. The Computer Journal
'... a well-balanced textbook ... presenting the subject in a unified and systematic manner.' H. Herre, Zentralblatt MATH
'... a highly welcome addition to the literature on term rewriting ... It is very readable, well written and likeable book. it should be of great value to students and researchers alike.' Jan Willem Klop, Journal of Functioning Programming
This is a unified and self-contained introduction to term rewriting that can be used for advanced undergraduate courses or as a professional reference. The main algorithms are presented both informally and as ML programs. Many examples and over 170 exercises are provided.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
EUR 12,29 per la spedizione da Regno Unito a U.S.A.
Destinazione, tempi e costiEUR 7,65 per la spedizione in U.S.A.
Destinazione, tempi e costiDa: Phatpocket Limited, Waltham Abbey, HERTS, Regno Unito
Condizione: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions. Codice articolo Z1-B-017-02144
Quantità: 1 disponibili
Da: Best Price, Torrance, CA, U.S.A.
Condizione: New. SUPER FAST SHIPPING. Codice articolo 9780521779203
Quantità: 1 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: New. Codice articolo 701643-n
Quantità: Più di 20 disponibili
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Condizione: New. Codice articolo ABLIING23Feb2416190014673
Quantità: Più di 20 disponibili
Da: MostlyAcademic, Berrima, NSW, Australia
Soft cover. Condizione: As New. Codice articolo ABE-1669102990890
Quantità: 1 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: As New. Unread book in perfect condition. Codice articolo 701643
Quantità: Più di 20 disponibili
Da: MostlyAcademic, Berrima, NSW, Australia
Soft cover. Condizione: As New. Codice articolo ABE-1679991119292
Quantità: 1 disponibili
Da: California Books, Miami, FL, U.S.A.
Condizione: New. Codice articolo I-9780521779203
Quantità: Più di 20 disponibili
Da: Grand Eagle Retail, Mason, OH, U.S.A.
Paperback. Condizione: new. Paperback. 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, Grobner 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 (solutions available from ). 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. This textbook offers a unified, self-contained introduction to the field of term rewriting. Baader and Nipkow cover 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, Grobner bases, and Buchberger's algorithm. They present the main algorithms both informally and as programs in the functional language Standard ML (An appendix contains a quick and easy introduction to ML). Key chapters cover crucial algorithms such as unification and congruence closure in more depth and develop efficient Pascal programs. The book contains many examples and over 170 exercises. This is also an ideal reference book for professional researchers: results spread over many conference and journal articles are collected here in a unified notation, detailed proofs of almost all theorems are provided, and each chapter closes with a guide to the literature. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Codice articolo 9780521779203
Quantità: 1 disponibili
Da: Ria Christie Collections, Uxbridge, Regno Unito
Condizione: New. In. Codice articolo ria9780521779203_new
Quantità: Più di 20 disponibili