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
export record as
dblp key:
Bruno Buchberger :
Basic Features and Development of the Critical-Pair/Completion Procedure.
1-45
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
Friedrich Otto :
Deciding Algebraic Properties of Monoids Presented by Finite Church-Rosser Thue Systems.
95-106
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
Michaël Rusinowitch :
Path of Subterms Ordering and Recursive Decomposition Ordering Revisited.
225-240
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
Jieh Hsiang :
Two Results in Term Rewriting Theorem Proving.
301-324
export record as
dblp key:
Laurent Fribourg :
Handling Function Definitions through Innermost Superposition and Rewriting.
325-344
export record as
dblp key:
export record as
dblp key:
Katherine A. Yelick :
Combining Unification Algorithms for Confined Regular Equational Theories.
365-380
export record as
dblp key:
Albrecht Fortenbach :
An Algebraic Approch to Unification Under Assoiativity and Commutativity.
381-397
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
Marek Zaionc :
The Set of Unifiers in Typed Lambda-Calculus as Regular Expression.
430-440
data released under the ODC-BY 1.0 license
