%A Bruno Buchberger
%T Basic features and development of the critical-pair/completion procedure
%J Proceedings of the First International Conference
on Rewriting Techniques and Applications
%C Dijon, France
%D May 1985
%E Jean-Pierre Jouannaud
%O published as Lecture Notes in Computer Science 202
by Springer-Verlag
%K rta rta1 rta85
%P 1-45
%O (Invited lecture)

%A Hantao Zhang
%A Jean-Luc Remy
%T Contextual rewriting
%J Proceedings of the First International Conference
on Rewriting Techniques and Applications
%C Dijon, France
%D May 1985
%E Jean-Pierre Jouannaud
%O published as Lecture Notes in Computer Science 202
by Springer-Verlag
%K rta rta1 rta85
%P 46-62
%O (Invited lecture)

%A Ronald V. Book
%T Thue systems as rewriting systems
%J Proceedings of the First International Conference
on Rewriting Techniques and Applications
%C Dijon, France
%D May 1985
%E Jean-Pierre Jouannaud
%O published as Lecture Notes in Computer Science 202
by Springer-Verlag
%K rta rta1 rta85
%P 63-94
%O (Invited lecture)

%A Friedrich Otto
%T Deciding algebraic properties of monoids
presented by finite Church-Rosser Thue systems
%J Proceedings of the First International Conference
on Rewriting Techniques and Applications
%C Dijon, France
%D May 1985
%E Jean-Pierre Jouannaud
%O published as Lecture Notes in Computer Science 202
by Springer-Verlag
%K rta rta1 rta85
%P 95-106

%A Stavros S. Cosmadakis
%A Paris C. Kanellakis
%T Two applications of equational theories to database theory
%J Proceedings of the First International Conference
on Rewriting Techniques and Applications
%C Dijon, France
%D May 1985
%E Jean-Pierre Jouannaud
%O published as Lecture Notes in Computer Science 202
by Springer-Verlag
%K rta rta1 rta85
%P 107-123
%K functional dependencies

%A Neil D. Jones
%A Peter Sestoft
%A Harald Sondergaard
%T An experiment in partial evaluation: the generation of a compiler generator
%J Proceedings of the First International Conference
on Rewriting Techniques and Applications
%C Dijon, France
%D May 1985
%E Jean-Pierre Jouannaud
%O published as Lecture Notes in Computer Science 202
by Springer-Verlag
%K rta rta1 rta85
%P 124-140

%A Pierre Rety
%A Claude Kirchner
%A Helen Kirchner
%A Pierre Lescanne
%T Narrower: a new algorithm for unification
and its application to logic programming
%J Proceedings of the First International Conference
on Rewriting Techniques and Applications
%C Dijon, France
%D May 1985
%E Jean-Pierre Jouannaud
%O published as Lecture Notes in Computer Science 202
by Springer-Verlag
%K rta rta1 rta85
%P 141-157

%A Hassan Ait-Kaci
%T Solving equations by graph rewriting
%J Proceedings of the First International Conference
on Rewriting Techniques and Applications
%C Dijon, France
%D May 1985
%E Jean-Pierre Jouannaud
%O published as Lecture Notes in Computer Science 202
by Springer-Verlag
%K rta rta1 rta85
%P 158-179

%A Nachum Dershowitz
%T Termination
%J Proceedings of the First International Conference
on Rewriting Techniques and Applications
%C Dijon, France
%D May 1985
%E Jean-Pierre Jouannaud
%O published as Lecture Notes in Computer Science 202
by Springer-Verlag
%K rta rta1 rta85
%P 180-224

%A Michael Rusinowitch
%T Path of subterms ordering and recursive decomposition ordering revisited
%J Proceedings of the First International Conference
on Rewriting Techniques and Applications
%C Dijon, France
%D May 1985
%E Jean-Pierre Jouannaud
%O published as Lecture Notes in Computer Science 202
by Springer-Verlag
%K rta rta1 rta85
%P 225-240

%A Leo Bachmair
%A David A. Plaisted
%T Associative path orderings
%J Proceedings of the First International Conference
on Rewriting Techniques and Applications
%C Dijon, France
%D May 1985
%E Jean-Pierre Jouannaud
%O published as Lecture Notes in Computer Science 202
by Springer-Verlag
%K rta rta1 rta85
%P 241-254

%A David Detlefs
%A Randy Forgaard
%T A procedure for automatically proving
the termination of a set of rewrite rules
%J Proceedings of the First International Conference
on Rewriting Techniques and Applications
%C Dijon, France
%D May 1985
%E Jean-Pierre Jouannaud
%O published as Lecture Notes in Computer Science 202
by Springer-Verlag
%K rta rta1 rta85
%P 255-270

%A C. Choppy
%A C. Johnen
%T PETRIREVE: proving Petri net properties with rewriting systems
%J Proceedings of the First International Conference
on Rewriting Techniques and Applications
%C Dijon, France
%D May 1985
%E Jean-Pierre Jouannaud
%O published as Lecture Notes in Computer Science 202
by Springer-Verlag
%K rta rta1 rta85
%P 271-286
%K REVE

%A Sara Porat
%A Nissim Francez
%T Fairness in term rewriting systems
%J Proceedings of the First International Conference
on Rewriting Techniques and Applications
%C Dijon, France
%D May 1985
%E Jean-Pierre Jouannaud
%O published as Lecture Notes in Computer Science 202
by Springer-Verlag
%K rta rta1 rta85
%P 287-300

%A Jieh Hsiang
%T Two results in term rewriting theorem proving
%J Proceedings of the First International Conference
on Rewriting Techniques and Applications
%C Dijon, France
%D May 1985
%E Jean-Pierre Jouannaud
%O published as Lecture Notes in Computer Science 202
by Springer-Verlag
%K rta rta1 rta85
%P 301-324

%A Laurent Fribourg
%T Handling function definitions through innermost superposition and rewriting
%J Proceedings of the First International Conference
on Rewriting Techniques and Applications
%C Dijon, France
%D May 1985
%E Jean-Pierre Jouannaud
%O published as Lecture Notes in Computer Science 202
by Springer-Verlag
%K rta rta1 rta85
%P 325-344
%K SLOG, equational clauses, logic programming with equality

%A Abdelilah Kandri-Rody
%A Deepak Kapur
%A Paliath Narendran
%T An ideal-theoretic approach
to word problems over finitely presented commutative algebras
%J Proceedings of the First International Conference
on Rewriting Techniques and Applications
%C Dijon, France
%D May 1985
%E Jean-Pierre Jouannaud
%O published as Lecture Notes in Computer Science 202
by Springer-Verlag
%K rta rta1 rta85
%P 345-364
%K word problem, unification problem, finitely presented algebras,
commutative algebras, Grobner basis, polynomial ideals, term rewriting,
Knuth-Bendix completion procedure

%A Kathy Yelick
%T Combining unification algorithms for confined regular equational theories
%J Proceedings of the First International Conference
on Rewriting Techniques and Applications
%C Dijon, France
%D May 1985
%E Jean-Pierre Jouannaud
%O published as Lecture Notes in Computer Science 202
by Springer-Verlag
%K rta rta1 rta85
%P 365-380

%A Albrecht Fortenbacher
%T An algebraic approach to unification under associativity and commutativity
%J Proceedings of the First International Conference
on Rewriting Techniques and Applications
%C Dijon, France
%D May 1985
%E Jean-Pierre Jouannaud
%O published as Lecture Notes in Computer Science 202
by Springer-Verlag
%K rta rta1 rta85
%P 381-397

%A Stefan Arnborg
%T Unification problems with one-sided distributivity
%J Proceedings of the First International Conference
on Rewriting Techniques and Applications
%C Dijon, France
%D May 1985
%E Jean-Pierre Jouannaud
%O published as Lecture Notes in Computer Science 202
by Springer-Verlag
%K rta rta1 rta85
%P 398-406

%A Paul Walton Purdom,\ Jr.
%A Cynthia A. Brown
%T Fast many-to-one matching algorithms
%J Proceedings of the First International Conference
on Rewriting Techniques and Applications
%C Dijon, France
%D May 1985
%E Jean-Pierre Jouannaud
%O published as Lecture Notes in Computer Science 202
by Springer-Verlag
%K rta rta1 rta85
%P 407-416

%A Dan Benanav
%A Deepak Kapur
%A Paliath Narendran
%T Complexity of matching problems
%J Proceedings of the First International Conference
on Rewriting Techniques and Applications
%C Dijon, France
%D May 1985
%E Jean-Pierre Jouannaud
%O published as Lecture Notes in Computer Science 202
by Springer-Verlag
%K rta rta1 rta85
%P 417-429
%K matching, associative, commutative, NP-completeness

%A Marek Zaionc
%T The set of unifiers in typed lambda-calculus as regular expressions
%J Proceedings of the First International Conference
on Rewriting Techniques and Applications
%C Dijon, France
%D May 1985
%E Jean-Pierre Jouannaud
%O published as Lecture Notes in Computer Science 202
by Springer-Verlag
%K rta rta1 rta85
%P 430-440

%A M. O'Donnell
%T Term-rewriting implementation of equational logic
%J Proceedings of the Second International Conference
on Rewriting Techniques and Applications
%C Bordeaux, France
%D May 1987
%K rta rta2 rta87

%A R. Strandh
%T Optimizing equational programs
%J Proceedings of the Second International Conference
on Rewriting Techniques and Applications
%C Bordeaux, France
%D May 1987
%K rta rta2 rta87

%A S. Kaplan
%T A compiler for conditional term rewriting systems
%J Proceedings of the Second International Conference
on Rewriting Techniques and Applications
%C Bordeaux, France
%D May 1987
%K rta rta2 rta87

%A U. Martin
%T How to choose the weights in the Knuth Bendix ordering
%J Proceedings of the Second International Conference
on Rewriting Techniques and Applications
%C Bordeaux, France
%D May 1987
%K rta rta2 rta87

%A P. Purdom
%T Detecting looping simplifications
%J Proceedings of the Second International Conference
on Rewriting Techniques and Applications
%C Bordeaux, France
%D May 1987
%K rta rta2 rta87

%A E. Sopena
%T Combinatorial hypermap rewriting
%J Proceedings of the Second International Conference
on Rewriting Techniques and Applications
%C Bordeaux, France
%D May 1987
%K rta rta2 rta87

%A F. Otto
%A C. Squier
%T The word problem for finitely presented monoids
and finite canonical rewriting systems
%J Proceedings of the Second International Conference
on Rewriting Techniques and Applications
%C Bordeaux, France
%D May 1987
%K rta rta2 rta87

%A J.C.M. Baeten
%A J.A. Bergstra
%A J.W. Klop
%T Term rewriting systems with priorities
%J Proceedings of the Second International Conference
on Rewriting Techniques and Applications
%C Bordeaux, France
%D May 1987
%K rta rta2 rta87

%A M. Dauchet
%A F. De Comite
%T A gap between linear and non-linear systems
%J Proceedings of the Second International Conference
on Rewriting Techniques and Applications
%C Bordeaux, France
%D May 1987
%K rta rta2 rta87

%A D. Musser
%T Inductionless induction: progress and problems
%J Proceedings of the Second International Conference
on Rewriting Techniques and Applications
%C Bordeaux, France
%D May 1987
%K rta rta2 rta87

%A M. Mazaud
%A R. Rakotozafy
%A A. Szumachowski-Despland
%T Code generator generation based on template-driven target term rewriting
%J Proceedings of the Second International Conference
on Rewriting Techniques and Applications
%C Bordeaux, France
%D May 1987
%K rta rta2 rta87

%A M. Benois
%T Algorithm and complexity of the construction of automata
that recognize images of regular languages by some rewriting systems
%J Proceedings of the Second International Conference
on Rewriting Techniques and Applications
%C Bordeaux, France
%D May 1987
%K rta rta2 rta87

%A K. Madlener
%A F. Otto
%T Groups presented by certain classes
of finite length-reducing string rewriting systems
%J Proceedings of the Second International Conference
on Rewriting Techniques and Applications
%C Bordeaux, France
%D May 1987
%K rta rta2 rta87

%A F. Otto
%T Confluence on a given congruence class is undecidable
%J Proceedings of the Second International Conference
on Rewriting Techniques and Applications
%C Bordeaux, France
%D May 1987
%K rta rta2 rta87

%A J.P. Jouannaud
%T Proof methods for completion procedures
%J Proceedings of the Second International Conference
on Rewriting Techniques and Applications
%C Bordeaux, France
%D May 1987
%K rta rta2 rta87

%A R. Gobel
%T Ground confluence
%J Proceedings of the Second International Conference
on Rewriting Techniques and Applications
%C Bordeaux, France
%D May 1987
%K rta rta2 rta87

%A Qian Zhenyu
%T A generalized sufficient condition for confluence and termination
and its extension to recursively presented term rewriting
%J Proceedings of the Second International Conference
on Rewriting Techniques and Applications
%C Bordeaux, France
%D May 1987
%K rta rta2 rta87

%A H. Kirchner
%T Schematization of infinite sets of rewrite rules
application to the divergence of completion processes
%J Proceedings of the Second International Conference
on Rewriting Techniques and Applications
%C Bordeaux, France
%D May 1987
%K rta rta2 rta87

%A L. Bachmair
%A N. Dershowitz
%T Completion for rewriting modulo a congruence
%J Proceedings of the Second International Conference
on Rewriting Techniques and Applications
%C Bordeaux, France
%D May 1987
%K rta rta2 rta87

%A J. Burckert
%A A. Herold
%A M. Schmidt-Schauss
%T On equational theories, unification and decidability
%J Proceedings of the Second International Conference
on Rewriting Techniques and Applications
%C Bordeaux, France
%D May 1987
%K rta rta2 rta87

%A J.H. Gallier
%A W. Snyder
%T A general complete E-unification procedure
%J Proceedings of the Second International Conference
on Rewriting Techniques and Applications
%C Bordeaux, France
%D May 1987
%K rta rta2 rta87

%A P. Rety
%T Improving basic narrowing techniques
%J Proceedings of the Second International Conference
on Rewriting Techniques and Applications
%C Bordeaux, France
%D May 1987
%K rta rta2 rta87

%A P. Padawitz
%T Strategy-controlled reduction and narrowing
%J Proceedings of the Second International Conference
on Rewriting Techniques and Applications
%C Bordeaux, France
%D May 1987
%K rta rta2 rta87

%A C. Chopy
%A S. Kaplan
%A M. Soria
%T Algorithmic complexity of term rewriting systems
%J Proceedings of the Second International Conference
on Rewriting Techniques and Applications
%C Bordeaux, France
%D May 1987
%K rta rta2 rta87

%A R. Ramesh
%A I.V. Ramakrishnan
%T Optimal speedups for parallel pattern matching in trees
%J Proceedings of the Second International Conference
on Rewriting Techniques and Applications
%C Bordeaux, France
%D May 1987
%K rta rta2 rta87