Rewriting Techniques and Applications [electronic resource] : Dijon, France, May 20–22, 1985 / edited by Jean-Pierre Jouannaud.

Basic features and development of the critical-pair/completion procedure -- Contextual rewriting -- Thue systems as rewriting systems -- Deciding algebraic properties of monoids presented by finite church-rosser Thue systems -- Two applications of equational theories to database theory -- An experiment in partial evaluation: The generation of a compiler generator -- NARROWER: a new algorithm for unification and its application to Logic Programming -- Solving type equations by graph rewriting -- Termination -- Path of subterms ordering and recursive decomposition ordering revisited -- Associative path orderings -- A procedure for automatically proving the termination of a set of rewrite rules -- Petrireve: Proving Petri net properties with rewriting systems -- Fairness in term rewriting systems -- Two results in term rewriting theorem proving -- Handling function definitions through innermost superposition and rewriting -- An ideal-theoretic approach to word problems and unification problems over finitely presented commutative algebras -- Combining unification algorithms for confined regular equational theories -- An algebraic approach to unification under associativity and commutativity -- Unification problems with one-sided distributivity -- Fast many-to-one matching algorithms -- Complexity of matching problems -- The set of unifiers in typed ?-calculus as regular expression -- Equational systems for category theory and intuitionistic logic.