Rewriting Techniques and Applications

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Rewriting Logic and Maude: Concepts and Applications
3. Altmetric Badge
   Chapter 2 Tree Automata and Term Rewrite Systems
4. Altmetric Badge
   Chapter 3 Absolute Explicit Unification
5. Altmetric Badge
   Chapter 4 Termination and Confluence of Higher-Order Rewrite Systems
6. Altmetric Badge
   Chapter 5 A de Bruijn Notation for Higher-Order Rewriting
7. Altmetric Badge
   Chapter 6 Rewriting Techniques in Theoretical Physics
8. Altmetric Badge
   Chapter 7 Normal Forms and Reduction for Theories of Binary Relations
9. Altmetric Badge
   Chapter 8 Parallelism Constraints
10. Altmetric Badge
    Chapter 9 Linear Higher-Order Matching Is NP-Complete
11. Altmetric Badge
    Chapter 10 Standardization and Confluence for a Lambda Calculus with Generalized Applications
12. Altmetric Badge
    Chapter 11 Linear Second-Order Unification and Context Unification with Tree-Regular Constraints
13. Altmetric Badge
    Chapter 12 Word Problems and Confluence Problems for Restricted Semi-Thue Systems
14. Altmetric Badge
    Chapter 13 The Explicit Representability of Implicit Generalizations
15. Altmetric Badge
    Chapter 14 On the Word Problem for Combinators
16. Altmetric Badge
    Chapter 15 Rewriting Techniques and Applications
17. Altmetric Badge
    Chapter 16 Deriving Theory Superposition Calculi from Convergent Term Rewriting Systems
18. Altmetric Badge
    Chapter 17 Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability
19. Altmetric Badge
    Chapter 18 System Description: The Dependency Pair Method
20. Altmetric Badge
    Chapter 19 REM (Reduce Elan Machine): Core of the New ELAN Compiler
21. Altmetric Badge
    Chapter 20 TALP: A Tool for the Termination Analysis of Logic Programs