Term rewriting and all that

@inproceedings{Baader1998TermRA,
  title={Term rewriting and all that},
  author={F. Baader and T. Nipkow},
  year={1998}
}
  • F. Baader, T. Nipkow
  • Published 1998
  • Computer Science, Mathematics
    • Preface 1. Motivating examples 2. Abstract reduction systems 3. Universal algebra 4. Equational problems 5. Termination 6. Confluence 7. Completion 8. Grobner 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. 
    View via Publisher
    doi.org
    1,777 Citations
    Highly Influencial Citations
    137
    Background Citations
    697
    Methods Citations
    345
    Results Citations
    10

    Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    1,777 Citations
    Citation Type

    Citation Type

    Maximal Completion
    • 14
    • PDF
    A Functional Approach to String Rewriting and Gröbner bases
    Categorification, term rewriting and the Knuth–Bendix procedure
    • 2
    • PDF
    Confluence and Normalization in Reduction Systems Lecture Notes
    • 6
    • PDF
    Some Algebraic Structures in Lambda-Calculus with Inductive Types
    • 11
    Introduction to Term Rewriting Systems
    Term Rewriting
    • 26
    • PDF
    Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems
    • 20
    Kleene Algebra with Equations
    • 16
    • PDF
    Semantic Matching for Left-Linear Convergent Rewrite Systems
    • 1
    • PDF