3. RTA 1989: Chapel Hill, North Carolina, USA
: Term Rewriting and Universal Algebra in Historical Perspective (Abstract of Invited Lecture).
: Characterization of Unification Type Zero.
: Proof Normalization for Resolution and Paramodulation.
: Inductive Proofs by Specification Transformation.
, Yike Guo
: Narrowing and Unification in Functional Programming - An Evaluation Mechanism for Absolute Set Abstraction.
: Simulation of Turning Machines by a Left-Linear Rewrite Rule.
: Higher-order Unification with Dependent Function Types.
: Graph Grammars, A New Paradigma for Implementing Visual Languages.
: On How To Move Mountains 'Associatively and Commutatively'.
: Generalized Gröbner Bases: Theory and Applications. A Condensation.
: Modular Aspects of Properties of Term Rewriting Systems Related to Normal Forms.
: Optimization by Non-Deterministic, Lazy Rewriting.
: Combining Matching Algorithms: The Rectangular Case.
: Restrictions of Congruence Generated by Finite Canonical String-Rewriting Systems.
: Embedding with Patterns and Associated Recursive Path Ordering.
Uday S. Reddy
: Rewriting Techniques for Program Synthesis.
: Efficient Ground Completion: An O(n log n) Algorithm for Generating Reduced Sets of Ground Rewrite Rules Equivalent to a Set of Ground Equations E.
: Classes of Equational Programs that Compile into Efficient Machine Code.
: Fair Termination is Decidable for Ground Systems.
Sergei G. Vorobyov
: Conditional Rewrite Rule Systems with Built-In Arithmetic and Induction.
: Morphocompletion for One-Relation Monoids.