Abstract is missing.
- Basic Features and Development of the Critical-Pair/Completion ProcedureBruno Buchberger. 1-45
- Contextual RewritingHantao Zhang, Jean-Luc Remy. 46-62
- Thue Systems as Rewriting SystemsRonald V. Book. 63-94
- Deciding Algebraic Properties of Monoids Presented by Finite Church-Rosser Thue SystemsFriedrich Otto. 95-106
- Two Applications of Equational Theories to Database TheoryStavros S. Cosmadakis, Paris C. Kanellakis. 107-123
- An Experiment in Partial Evaluation: The Generation of a Compiler GeneratorNeil D. Jones, Peter Sestoft, Harald Søndergaard. 124-140 [doi]
- NARROWER: A New Algorithm for Unification and Its Application to Logic ProgrammingPierre Réty, Claude Kirchner, Hélène Kirchner, Pierre Lescanne. 141-157
- Solving Type Equations by Graph RewritingHassan Aït-Kaci. 158-179
- TerminationNachum Dershowitz. 180-224
- Path of Subterms Ordering and Recursive Decomposition Ordering RevisitedMichaël Rusinowitch. 225-240
- Associative Path OrderingsLeo Bachmair, David A. Plaisted. 241-254
- A Procedure for Automatically Proving the Termination of a Set of Rewrite RulesDavid Detlefs, Randy Forgaard. 255-270
- PETRIREVE: Proving Petri Net Properties with Rewriting SystemsChristine Choppy, Colette Johnen. 271-286
- Fairness in Term Rewriting SystemsSara Porat, Nissim Francez. 287-300
- Two Results in Term Rewriting Theorem ProvingJieh Hsiang. 301-324
- Handling Function Definitions through Innermost Superposition and RewritingLaurent Fribourg. 325-344
- An Ideal-Theoretic Approach to Work Problems and Unification Problems over Finitely Presented Commutative AlgebrasAbdelilah Kandri-Rody, Deepak Kapur, Paliath Narendran. 345-364
- Combining Unification Algorithms for Confined Regular Equational TheoriesKatherine A. Yelick. 365-380
- An Algebraic Approch to Unification Under Assoiativity and CommutativityAlbrecht Fortenbach. 381-397
- Unification Problems with One-Sided DistributivityStefan Arnborg, Erik Tidén. 398-406
- Fast Many-to-One Matching AlgorithmsPaul Walton Purdom Jr., Cynthia A. Brown. 407-416
- Complexity of Matching ProblemsDan Benanav, Deepak Kapur, Paliath Narendran. 417-429
- The Set of Unifiers in Typed Lambda-Calculus as Regular ExpressionMarek Zaionc. 430-440