Rewriting Techniques and Applications

- Invited Lecture: M.J. O'Donnell: Term-Rewriting Implementation of Equational Logic Programming

- Implementation: R. Strandh: Optimizing Equational Programs

- S. Kaplan: A Compiler for Conditional Term Rewriting Systems

- Termination: U. Martin: How to choose the weights in the Knuth Bendix ordering. P. Purdom: Detecting Looping Simplifications

- Theoretical Aspects 1: E. Sopena: Combinatorial Hypermap Rewriting. F. Otto, C. Squier: The Word Problem for finitely presented Monoids and Finite Canonical Rewriting Systems

- Families of Rewriting Systems: J.C.M. Baeten, J.A. Bergstra, J.W. Klop: Term Rewriting Systems with Priorities. M. Dauchet, F. De Comite: A gap between Linear and Non-Linear Term-Rewriting Systems

- Code Generation: M. Mazaud, R. Rakotozafy, A. Szumachowski-Despland: Code Generator Generation based on template-driven target term rewriting

- Theoretical Aspects 2: M. Benois: Descendants of Regular Language in a class of Rewriting Systems: Algorithm and Complexity of an Automata Construction. K. Madlener, F. Otto: Groups presented by certain Classes of Finite Length-Reducing string Rewriting Systems. F. Otto: Some Results about Confluence on a given Congruence Class

- Confluence: R. Göbel: Ground Confluence

- Qian Zhenyu: Structured Contextual Rewriting

- Completion: H. Kirchner: Schematization of infinite sets of rewrite rules. Application to the divergence of completion processes

- L. Bachmair, N. Dershowitz: Completion for rewriting modulo a congruence

- Unification: H.J. Bürckert, A. Herold, M. Schmidt-Schauß: On Equational Theories, Unification and Decidability

- J.H. Gallier, W. Snyder: A General complete E-unification procedure

- Unification by Narrowing: P. Réty: Improving basic narrowing techniques. P. Padawitz: Strategy-Controlled Reduction and Narrowing

- Efficiency of Rewriting: C. Choppy, S. Kaplan, M. Soria: Algorithmic complexity of term rewriting systems. R. Ramesh, I.V. Ramakrishnan: