Table of contents : Term-rewriting implementation of equational logic programming....Pages 1-12 Optimizing equational programs....Pages 13-24 A compiler for conditional term rewriting systems....Pages 25-41 How to choose the weights in the Knuth Bendix ordering....Pages 42-53 Detecting looping simplifications....Pages 54-61 Combinatorial hypermap rewriting....Pages 62-73 The word problem for finitely presented monoids and finite canonical rewriting systems....Pages 74-82 Term rewriting systems with priorities....Pages 83-94 A gap between linear and non linear term-rewriting systems....Pages 95-104 Code generator generation based on template-driven target term rewriting....Pages 105-120 Descendants of regular language in a class of rewriting systems: Algorithm and complexity of an automata construction....Pages 121-132 Groups presented by certain classes of finite length-reducing string-rewriting systems....Pages 133-144 Some results about confluence on a given congruence class....Pages 145-155 Ground confluence....Pages 156-167 Structured contextual rewriting....Pages 168-179 Schematization of infinite sets of rewrite rules. Application to the divergence of completion processes....Pages 180-191 Completion for rewriting modulo a congruence....Pages 192-203 On equational theories, unification and decidability....Pages 204-215 A general complete E -unification procedure....Pages 216-227 Improving basic narrowing techniques....Pages 228-241 Strategy-controlled reduction and narrowing....Pages 242-255 Algorithmic complexity of term rewriting systems....Pages 256-273 Optimal speedups for parallel pattern matching in trees....Pages 274-285