Contents of the Proceedings of the
2nd International Conference on Rewriting Techniques and Applications.
Bordeaux, France, May 25-27, 1987.
Lecture Notes in Computer Science, Vol. 256, Springer Verlag.
Editor: Pierre Lescanne.
Invited Lecture
- M. J. O'Donnell,
Term-Rewriting Implementation of Equational Logic Programming
(pages 1-12).
Implementation
- R. Strandh,
Optimizing Equational Programs
(pages 13-24).
- S. Kaplan,
A Compiler for Conditional Term Rewriting Systems
(pages 25-41).
Termination
- U. Martin,
How to Choose Weights in the Knuth Bendix Ordering
(pages 42-53).
- P. W. Purdom Jr,
Detecting Looping Simplifications
(pages 54-61).
Theoretical Aspects 1
- E. Sopena,
Combinatorial Hypermap Rewriting
(pages 62-73).
- C. C. Squier and F. Otto,
The Word Problem for Finitely Presented Monoids and Finite Canonical
Rewriting Systems
(pages 74-82).
Families of Rewriting Systems
- J. C. M. Baeten, J. A. Bergstra and J. W. Klop,
Term Rewriting Systems with Priorities
(pages 83-94).
- M. Dauchet, F. De Comite,
A Gap Between Linear and Non Linear Term-Rewriting Systems
(pages 95-104).
Code Generation
- A. Despland, M. Mazaud and R. Rakotozafy,
Code Generator Generation Based on Template-Driven Target Term
Rewriting
(pages 105-120).
Theoretical Aspects 2
- M. Benois,
Descendants of Regular Language in a Class of Rewriting Systems:
Algorithm and Complexity of an Automata Construction
(pages 121-132).
- K. Madlener and F. Otto,
Groups Presented by Certain Classes of Finite Length-Reducing
String-Rewriting Systems
(pages 133-144).
- F. Otto,
Some Results about Confluence on a Given Congruence Class
(pages 145-155).
Confluence
- R. Göbel,
Ground Confluence
(pages 156-167).
- Z. Qian,
Structured Contextual Rewriting
(pages 168-179).
Completion
- H. Kirchner,
Schematization of Infinite Sets of Rewrite Rules. Application to the
Divergence of Completion Processes
(pages 180-191).
- L. Bachmair and N. Dershowitz,
Completion for Rewriting Modulo a Congruence
(pages 192-203).
Unification
- H.-J. Bürckert, A. Herold and M. Schmidt-Schauß,
On Equational Theories, Unification and Decidability
(pages 204-215).
- J. H. Gallier and W. Snyder,
A General Complete E-Unification Procedure
(pages 216-227).
Unification by Narrowing
- P. Réty,
Improving Basic Narrowing Techniques
(pages 228-241).
- P. Padawitz,
Strategy-Controlled Reduction and Narrowing
(pages 242-255).
Efficiency of Rewriting
- C. Choppy, S. Kaplan and M. Soria,
Algorithmic Complexity of Term Rewriting Systems
(pages 256-273).
- R. Ramesh and I. V. Ramakrishnan,
Optimal Speedups for Parallel Pattern Matching in Trees
(pages 274-285).