Skip to main content Accessibility help
×
  1. Home
  2. Books
  3. Term Rewriting and All That
  • Cited by 1061
      • Franz Baader, Rheinisch-Westfälische Technische Hochschule, Aachen, Germany, Tobias Nipkow, Technische Universität München
      Show more authors
      • You may already have access via personal or institutional login
    • Select format
    • Publisher:
      Cambridge University Press
      Publication date:
      June 2012
      March 1998
      ISBN:
      9781139172752
      9780521779203
      DOI:
      https://doi.org/10.1017/CBO9781139172752
      Dimensions:
      Weight & Pages:
      Dimensions:
      (247 x 174 mm)
      Weight & Pages:
      0.51kg, 316 Pages
      • Subjects:
      Computer Science, Programming Languages and Applied Logic
    You may already have access via personal or institutional login
    • Selected: Digital
    Add to cart View cart Buy from Cambridge.org
    Subjects:
    Computer Science, Programming Languages and Applied Logic
    Information

    Book description

    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.

    Reviews

    ‘… 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’.

    Source: The Computer Journal

    ‘… a well-balanced textbook … presenting the subject in a unified and systematic manner.’

    H. Herre Source: 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 Source: Journal of Functioning Programming

    Refine List

    Actions for selected content:

    Select all | Deselect all
    • View selected items
    • Export citations
    • Download PDF (zip)
    • Save to Kindle
    • Save to Dropbox
    • Save to Google Drive

    Save Search

    You can save your searches here and later view and run them again in "My saved searches".

    Please provide a title, maximum of 40 characters.
    Cancel
    ×

    Contents

    Contents

    Metrics

    Full text views

    Total number of HTML views: 0
    Total number of PDF views: 0 *
    Loading metrics...

    Book summary page views

    Total views: 0 *
    Loading metrics...

    * Views captured on Cambridge Core between #date#. This data will be updated every 24 hours.

    Usage data cannot currently be displayed.

    Accessibility standard: Unknown

    Why this information is here

    This section outlines the accessibility features of this content - including support for screen readers, full keyboard navigation and high-contrast display options. This may not be relevant for you.

    Accessibility Information

    Accessibility compliance for the PDF of this book is currently unknown and may be updated in the future.