1. RTA 1985: Dijon, France

Jean-Pierre Jouannaud (Ed.): Rewriting Techniques and Applications, First International Conference, RTA-85, Dijon, France, May 20-22, 1985, Proceedings. Lecture Notes in Computer Science 202 Springer 1985, ISBN 3-540-15976-2 BibTeX

@proceedings{DBLP:conf/rta/1985,
  editor    = {Jean-Pierre Jouannaud},
  title     = {Rewriting Techniques and Applications, First International Conference,
               RTA-85, Dijon, France, May 20-22, 1985, Proceedings},
  booktitle = {RTA},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {202},
  year      = {1985},
  isbn      = {3-540-15976-2},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Bruno Buchberger: Basic Features and Development of the Critical-Pair/Completion Procedure. 1-45 BibTeX
Hantao Zhang, Jean-Luc Remy: Contextual Rewriting. 46-62 BibTeX
Ronald V. Book: Thue Systems as Rewriting Systems. 63-94 BibTeX
Friedrich Otto: Deciding Algebraic Properties of Monoids Presented by Finite Church-Rosser Thue Systems. 95-106 BibTeX
Stavros S. Cosmadakis, Paris C. Kanellakis: Two Applications of Equational Theories to Database Theory. 107-123 BibTeX
Neil D. Jones, Peter Sestoft, Harald Søndergaard: An Experiment in Partial Evaluation: The Generation of a Compiler Generator. 124-140 BibTeX
Pierre Réty, Claude Kirchner, Hélène Kirchner, Pierre Lescanne: NARROWER: A New Algorithm for Unification and Its Application to Logic Programming. 141-157 BibTeX
Hassan Aït-Kaci: Solving Type Equations by Graph Rewriting. 158-179 BibTeX
Nachum Dershowitz: Termination. 180-224 BibTeX
Michaël Rusinowitch: Path of Subterms Ordering and Recursive Decomposition Ordering Revisited. 225-240 BibTeX
Leo Bachmair, David A. Plaisted: Associative Path Orderings. 241-254 BibTeX
David Detlefs, Randy Forgaard: A Procedure for Automatically Proving the Termination of a Set of Rewrite Rules. 255-270 BibTeX
Christine Choppy, Colette Johnen: PETRIREVE: Proving Petri Net Properties with Rewriting Systems. 271-286 BibTeX
Sara Porat, Nissim Francez: Fairness in Term Rewriting Systems. 287-300 BibTeX
Jieh Hsiang: Two Results in Term Rewriting Theorem Proving. 301-324 BibTeX
Laurent Fribourg: Handling Function Definitions through Innermost Superposition and Rewriting. 325-344 BibTeX
Abdelilah Kandri-Rody, Deepak Kapur, Paliath Narendran: An Ideal-Theoretic Approach to Work Problems and Unification Problems over Finitely Presented Commutative Algebras. 345-364 BibTeX
Katherine A. Yelick: Combining Unification Algorithms for Confined Regular Equational Theories. 365-380 BibTeX
Albrecht Fortenbach: An Algebraic Approch to Unification Under Assoiativity and Commutativity. 381-397 BibTeX
Stefan Arnborg, Erik Tidén: Unification Problems with One-Sided Distributivity. 398-406 BibTeX
Paul Walton Purdom Jr., Cynthia A. Brown: Fast Many-to-One Matching Algorithms. 407-416 BibTeX
Dan Benanav, Deepak Kapur, Paliath Narendran: Complexity of Matching Problems. 417-429 BibTeX
Marek Zaionc: The Set of Unifiers in Typed Lambda-Calculus as Regular Expression. 430-440 BibTeX