Contents of the Proceedings of the
1st International Conference on Rewriting Techniques and Applications.
Dijon, France, May 20-22, 1985.
Lecture Notes in Computer Science, Vol. 202, Springer Verlag.
Editor: Jean-Pierre Jouannaud.
- B. Buchberger,
Basic Features and Development of the Critical-Pair/Completion
Procedure
(pages 1-45).
- H. Zhang and J.-L. Rémy,
Contextual Rewriting
(pages 46-62).
- R. V. Book,
Thue Systems as Rewriting Systems
(pages 63-94).
- F. Otto,
Deciding Algebraic Properties of Monoids Presented by Finite
Church-Rosser Thue Systems
(pages 95-106).
- S. S. Cosmadakis and P. C. Kanellakis,
Two Applications of Equational Theories to Database Theory
(pages 107-123).
- N. D. Jones, P. Sestoft and H. Søndergaard,
An Experiment in Partial Evaluation: The Generation of a Compiler
Generator
(pages 124-140).
- P. Réty, C. Kirchner, H. Kirchner and P. Lescanne,
NARROWER: A New Algorithm for Unification and Its Application to
Logic Programming
(pages 141-157).
- H. Aït-Kaci,
Solving Type Equations by Graph Rewriting
(pages 158-179).
- N. Dershowitz,
Termination
(pages 180-224).
- M. Rusinowitch,
Path of Subterms Ordering and Recursive Decomposition Ordering
Revisited
(pages 225-240).
- L. Bachmair and D. A. Plaisted,
Associative Path Orderings
(pages 241-254).
- D. Detlefs and R. Forgaard,
A Procedure for Automatically Proving the Termination of a Set of
Rewrite Rules
(pages 255-270).
- C. Choppy and C. Johnen,
PETRIREVE: Proving Petri Net Properties with Rewriting Systems
(pages 271-286).
- S. Porat and N. Francez,
Fairness in Term Rewriting Systems
(pages 287-300).
- J. Hsiang,
Two Results in Term Rewriting Theorem Proving
(pages 301-324).
- L. Fribourg,
Handling Function Definitions through Innermost Superposition and
Rewriting
(pages 325-344).
- A. Kandri-Rody, D. Kapur and P. Narendran,
An Ideal-Theoretic Approach to Work Problems and Unification
Problems over Finitely Presented Commutative Algebras
(pages 345-364).
- K. A. Yelick,
Combining Unification Algorithms for Confined Regular Equational
Theories
(pages 365-380).
- A. Fortenbach,
An Algebraic Approch to Unification Under Assoiativity and
Commutativity
(pages 381-397).
- S. Arnborg and E. Tidén,
Unification Problems with One-Sided Distributivity
(pages 398-406).
- P. W. Purdom Jr., C. A. Brown,
Fast Many-to-One Matching Algorithms
(pages 407-416).
- D. Benanav, D. Kapur and P. Narendran,
Complexity of Matching Problems
(pages 417-429).
- M. Zaionc,
The Set of Unifiers in Typed Lambda-Calculus as Regular
Expression
(pages 430-440).
- G. Huet,
Equational Systems for Category Theory and Intuitionistic Logic
(page 441).