Skip to content
Open global navigation

Cambridge University Press

AcademicLocation selectorSearch toggleMain navigation toggle
Cart
Register Sign in Wishlist
Term Rewriting and All That

Term Rewriting and All That

$54.00

  • Authors:
  • Franz Baader, Rheinisch-Westfälische Technische Hochschule, Aachen, Germany
  • Tobias Nipkow, Technische Universität München
  • Date Published: August 1999
  • availability: Available
  • format: Paperback
  • isbn: 9780521779203

$54.00
Paperback

Add to cart Add to wishlist

Other available formats:
Hardback


Looking for an examination copy?

If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact collegesales@cambridge.org providing details of the course you are teaching.

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • 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, Gröbner 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.

    • Covers a spectrum of topics from term rewriting to unification theory and Gröbner bases
    • Includes many examples and exercises and working ML and Pascal programs for many of the algorithms
    • Gives detailed and readable proofs for most of the important results in the area
    Read more

    Reviews & endorsements

    "...it fills a gap by being the first textbook in English on this topic...The book is well written, clearly structured and contains proofs of all the theorems, including those of the undecidability of termination and of Kruskal's theorem." Mathematical Reviews

    "...I am thoroughly impressed by this book." Computing Reviews

    See more reviews

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity

    ×

    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?

    ×

    Product details

    • Date Published: August 1999
    • format: Paperback
    • isbn: 9780521779203
    • length: 316 pages
    • dimensions: 244 x 170 x 17 mm
    • weight: 0.51kg
    • contains: 170 exercises
    • availability: Available
  • Table of Contents

    Preface
    1. Motivating examples
    2. Abstract reduction systems
    3. Universal algebra
    4. Equational problems
    5. Termination
    6. Confluence
    7. Completion
    8. Gröbner bases and Buchberger's algorithm
    9. Combination problems
    10. Equational unification
    11. Extensions
    Appendix 1. Ordered sets
    Appendix 2. A bluffer's guide to ML
    Bibliography
    Index.

  • Resources for

    Term Rewriting and All That

    Franz Baader, Tobias Nipkow

    General Resources

    Welcome to the resources site

    Here you will find a range of free-of-charge teaching and learning materials for students and instructors using this textbook. These resources form an integral part of the teaching package, and provided tailored materials that save instructors' time and enhance student learning.

    Find resources associated with this title

    Type Name Unlocked * Format Size

    Showing of

    Back to top

    *This title has one or more locked files and access is given only to instructors adopting the textbook for their class. We need to enforce this strictly so that solutions are not made available to students. To gain access to locked resources you either need first to sign in or register for an account.


    These resources are provided free of charge by Cambridge University Press with permission of the author of the corresponding work, but are subject to copyright. You are permitted to view, print and download these resources for your own personal use only, provided any copyright lines on the resources are not removed or altered in any way. Any other use, including but not limited to distribution of the resources in modified form, or via electronic or other media, is strictly prohibited unless you have permission from the author of the corresponding work and provided you give appropriate acknowledgement of the source.

    If you are having problems accessing these resources please email cflack@cambridge.org

  • Authors

    Franz Baader, Rheinisch-Westfälische Technische Hochschule, Aachen, Germany

    Tobias Nipkow, Technische Universität München

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email cflack@cambridge.org

Register Sign in
Please note that an additional password is required to open the solutions file once you have downloaded it. Contact collegesales@cambridge.org for this password.

» Proceed

You are now leaving the Cambridge University Press website, your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Find content that relates to you

© Cambridge University Press 2014

Back to top

Are you sure you want to delete your account?

This cannot be undone.

Cancel Delete

Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

×
Please fill in the required fields in your feedback submission.
×