2. RTA 1987: Bordeaux, France

Pierre Lescanne (Ed.): Rewriting Techniques and Applications, 2nd International Conference, RTA-87, Bordeaux, France, May 25-27, 1987, Proceedings. Lecture Notes in Computer Science 256 Springer 1987, ISBN 3-540-17220-3

Invited Lecture

Michael J. O'Donnell:
Term-Rewriting Implementation of Equational Logic Programming. 1-12

Implementation

Robert Strandh:
Optimizing Equational Programs. 13-24
Stéphane Kaplan:
A Compiler for Conditional Term Rewriting Systems. 25-41

Termination

Ursula Martin:
How to Choose Weights in the Knuth Bendix Ordering. 42-53
Paul Walton Purdom Jr.:
Detecting Looping Simplifications. 54-61

Theoretical Aspects 1

Eric Sopena:
Combinatorial Hypermap Rewriting. 62-73
Craig C. Squier, Friedrich Otto:
Th Word Problem for Finitely Presented Monoids and Finite Canonical Rewriting Systems. 74-82

Families of Rewriting Systems

Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop:
Term Rewriting Systems with Priorities. 83-94
Max Dauchet, Francesco De Comité:
A Gap Between Linear and Non Linear Term-Rewriting Systems (1). 95-104

Code Generation

Annie Despland, Monique Mazaud, Raymond Rakotozafy:
Code Generator Generation Based on Template-Driven Target Term Rewriting. 105-120

Theoretical Aspects 2

M. Benois:
Descendants of Regular Language in a Class of Rewriting Systems: Algorithm and Complexity of an Automata Construction. 121-132
Klaus Madlener, Friedrich Otto:
Groups Presented by Certain Classes of Finite Length-Reducing String-Rewriting Systems. 133-144
Friedrich Otto:
Some Results about Confluence on a Given Congruence Class. 145-155

Confluence

Richard Göbel:
Ground Confluence. 156-167
Zhenyu Qian:
Structured Contextual Rewriting. 168-179

Completion

Hélène Kirchner:
Schematization of Infinite Sets of Rewrite Rules. Application to the Divergence of Completion Processes. 180-191
Leo Bachmair, Nachum Dershowitz:
Completion for Rewriting Modulo a Congruence. 192-203

Unification

Hans-Jürgen Bürckert, Alexander Herold, Manfred Schmidt-Schauß:
On Equational Theories, Unification and Decidability. 204-215
Jean H. Gallier, Wayne Snyder:
A General Complete E-Unification Procedure. 216-227

Unification by Narrowing

Pierre Réty:
Improving Basic Narrowing Techniques. 228-241
Peter Padawitz:
Strategy-Controlled Reduction and Narrowing. 242-255

Efficiency of Rewriting

Christine Choppy, Stéphane Kaplan, Michèle Soria:
Algorithmic Complexity of Term Rewriting Systems. 256-273
R. Ramesh, I. V. Ramakrishnan:
Optimal Speedups for Parallel Pattern Matching in Trees. 274-285

Last update Tue Feb 14 04:09:56 2012 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page