Rewriting Techniques and Applications

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 81 Transfinite reductions in orthogonal term rewriting systems
3. Altmetric Badge
   Chapter 82 Redex capturing in term graph rewriting (concise version)
4. Altmetric Badge
   Chapter 83 Rewriting, and equational unification: the higher-order cases
5. Altmetric Badge
   Chapter 84 Adding algebraic rewriting to the untyped lambda calculus (extended abstract)
6. Altmetric Badge
   Chapter 85 Incremental termination proofs and the length of derivations
7. Altmetric Badge
   Chapter 86 Time bounded rewrite systems and termination proofs by generalized embedding
8. Altmetric Badge
   Chapter 87 Detecting redundant narrowing derivations by the LSE-SL reducibility test
9. Altmetric Badge
   Chapter 88 Unification, weak unification, upper bound, lower bound, and generalization problems
10. Altmetric Badge
    Chapter 89 AC unification through order-sorted AC1 unification
11. Altmetric Badge
    Chapter 90 Narrowing directed by a graph of terms
12. Altmetric Badge
    Chapter 91 Adding homomorphisms to commutative/monoidal theories or how algebra can help in equational unification
13. Altmetric Badge
    Chapter 92 Undecidable properties of syntactic theories
14. Altmetric Badge
    Chapter 93 Goal directed strategies for paramodulation
15. Altmetric Badge
    Chapter 94 Minimal solutions of linear diophantine systems : bounds and algorithms
16. Altmetric Badge
    Chapter 95 Proofs in parameterized specifications
17. Altmetric Badge
    Chapter 96 Completeness of combinations of constructor systems
18. Altmetric Badge
    Chapter 97 Modular higher-order E -unification
19. Altmetric Badge
    Chapter 98 On confluence for weakly normalizing systems
20. Altmetric Badge
    Chapter 99 Program transformation and rewriting
21. Altmetric Badge
    Chapter 100 An efficient representation of arithmetic for term rewriting
22. Altmetric Badge
    Chapter 101 Query optimization using rewrite rules
23. Altmetric Badge
    Chapter 102 Boolean algebra admits no convergent term rewriting system
24. Altmetric Badge
    Chapter 103 Decidability of confluence and termination of monadic term rewriting systems
25. Altmetric Badge
    Chapter 104 Bottom-up tree pushdown automata and rewrite systems
26. Altmetric Badge
    Chapter 105 On relationship between term rewriting systems and regular tree languages
27. Altmetric Badge
    Chapter 106 The equivalence of boundary and confluent graph grammars on graph languages of bounded degree
28. Altmetric Badge
    Chapter 107 Left-to-right tree pattern matching
29. Altmetric Badge
    Chapter 108 Incremental techniques for efficient normalization of nonlinear rewrite systems
30. Altmetric Badge
    Chapter 109 On fairness of completion-based theorem proving strategies
31. Altmetric Badge
    Chapter 110 Proving equational and inductive theorems by completion and embedding techniques
32. Altmetric Badge
    Chapter 111 Divergence phenomena during completion
33. Altmetric Badge
    Chapter 112 Simulating Buchberger's algorithm by Knuth-Bendix completion
34. Altmetric Badge
    Chapter 113 On proving properties of completion strategies
35. Altmetric Badge
    Chapter 114 On ground AC-completion
36. Altmetric Badge
    Chapter 115 Any ground associative-commutative theory has a finite canonical system
37. Altmetric Badge
    Chapter 116 A narrowing-based theorem prover
38. Altmetric Badge
    Chapter 117 ANIGRAF: An interactive system for the animation of graph rewriting systems with priorities
39. Altmetric Badge
    Chapter 118 Emmy: A refutational theorem prover for first-order logic with equations
40. Altmetric Badge
    Chapter 119 The tecton proof system
41. Altmetric Badge
    Chapter 120 Open problems in rewriting