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 BibTeX

@proceedings{DBLP:conf/rta/87,
  editor    = {Pierre Lescanne},
  title     = {Rewriting Techniques and Applications, 2nd International Conference,
               RTA-87, Bordeaux, France, May 25-27, 1987, Proceedings},
  booktitle = {RTA},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {256},
  year      = {1987},
  isbn      = {3-540-17220-3},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Invited Lecture

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

Implementation

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

Termination

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

Theoretical Aspects 1

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

Families of Rewriting Systems

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

Code Generation

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

Theoretical Aspects 2

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

Confluence

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

Completion

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

Unification

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

Unification by Narrowing

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

Efficiency of Rewriting

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