@InProceedings{Birkhoff-RTA89,
author={Birkhoff, G.},
title={{Term Rewriting and Universal Algebra in Historical Perspective (invited lecture)}},
pages={1},
crossref={RTA89}
}

@InProceedings{Baader-RTA89,
author={Baader, F.},
title={{Characterization of Unification Type Zero}},
pages={2--14},
crossref={RTA89}
}

@InProceedings{Bachmair-RTA89,
author={Bachmair, L.},
title={{Proof Normalization for Resolution and Paramodulation}},
pages={15--28},
crossref={RTA89}
}

@InProceedings{BairdPW-RTA89,
author={Baird, T. B. and Peterson, G. E. and Wilkerson, R. W.},
title={{Complete Sets of Reductions Modulo Associativity, Commutativity and Identity}},
pages={29--44},
crossref={RTA89}
}

@InProceedings{BertlingG-RTA89,
author={Bertling, H. and Ganzinger, H.},
title={{Completion-Time Optimization of Rewrite-Time Goal Solving}},
pages={45--58},
crossref={RTA89}
}

@InProceedings{BuendgenK-RTA89,
author={B{\"u}ndgen, R. and K{\"u}chlin, W.},
title={{Computing Ground Reducability and Inductively Complete Positions}},
pages={59--75},
crossref={RTA89}
}

@InProceedings{Comon-RTA89,
author={Comon, H.},
title={{Inductive Proofs by Specification Transformation}},
pages={76--91},
crossref={RTA89}
}

@InProceedings{DarlingtonG-RTA89,
author={Darlington, J. and Guo, Y.},
title={{Narrowing and Unification in Functional Programming - An Evaluation Mechanism for Absolute Set Abstraction}},
pages={92--108},
crossref={RTA89}
}

@InProceedings{Dauchet-RTA89,
author={Dauchet, M.},
title={{Simulation of Turning Machines by a Left-Linear Rewrite Rule}},
pages={109--120},
crossref={RTA89}
}

@InProceedings{Elliott-RTA89,
author={Elliott, C.},
title={{Higher-order Unification with Dependent Function Types}},
pages={121--136},
crossref={RTA89}
}

@InProceedings{GarlandG-RTA89,
author={Garland, S. J. and Guttag, J. V.},
title={{An Overview of LP, The Larch Power}},
pages={137--151},
crossref={RTA89}
}

@InProceedings{Goettler-RTA89,
author={G\"ottler, H.},
title={{Graph Grammars, A New Paradigma for Implementing Visual Languages}},
pages={152--166},
crossref={RTA89}
}

@InProceedings{HofbauerL-RTA89,
author={Hofbauer, D. and Lautemann, C.},
title={{Termination Proofs and the Length of Derivations (Preliminary Version)}},
pages={167--177},
crossref={RTA89}
}

@InProceedings{KaplanC-RTA89,
author={Kaplan, S. and Choppy, C.},
title={{Abstract Rewriting with Concrete Operations}},
pages={178--186},
crossref={RTA89}
}

@InProceedings{Lai-RTA89,
author={Lai, M.},
title={{On How To Move Mountains 'Associatively and Commutatively'}},
pages={187--202},
crossref={RTA89}
}

@InProceedings{Lankford-RTA89,
author={Lankford, D.},
title={{Generalized Gröbner Bases: Theory and Applications. A Condensation}},
pages={203--221},
crossref={RTA89}
}

@InProceedings{LatchS-RTA89,
author={Latch, D. M. and Sigal, R.},
title={{A Local Termination Property for Term Rewriting Systems}},
pages={222--233},
crossref={RTA89}
}

@InProceedings{McNulty-RTA89,
author={McNulty, G. F.},
title={{An Equational Logic Sampler}},
pages={234--262},
crossref={RTA89}
}

@InProceedings{Middeldorp-RTA89,
author={Middeldorp, A.},
title={{Modular Aspects of Properties of Term Rewriting Systems Related to Normal Forms}},
pages={263--277},
crossref={RTA89}
}

@InProceedings{Mohan-RTA89,
author={Mohan, C. K.},
title={{Priority Rewriting: Semantics, Confluence, and Conditional}},
pages={278--291},
crossref={RTA89}
}

@InProceedings{MohanS-RTA89,
author={Mohan, C. K. and Srivas, M. K.},
title={{Negation with Logical Variables in Conditional Rewriting}},
pages={292--310},
crossref={RTA89}
}

@InProceedings{NaoiI-RTA89,
author={Naoi, T. and Inagaki, Y.},
title={{Algebraic Semantics and Complexity of Term Rewriting Systems}},
pages={311--325},
crossref={RTA89}
}

@InProceedings{Narain-RTA89,
author={Narain, S.},
title={{Optimization by Non-Deterministic, Lazy Rewriting}},
pages={326--342},
crossref={RTA89}
}

@InProceedings{Nipkow-RTA89,
author={Nipkow, T.},
title={{Combining Matching Algorithms: The Rectangular Case}},
pages={343--358},
crossref={RTA89}
}

@InProceedings{Otto-RTA89,
author={Otto, F.},
title={{Restrictions of Congruence Generated by Finite Canonical String-Rewriting Systems}},
pages={359--370},
crossref={RTA89}
}

@InProceedings{Puel-RTA89,
author={Puel, L.},
title={{Embedding with Patterns and Associated Recursive Path Ordering}},
pages={371--387},
crossref={RTA89}
}

@InProceedings{Reddy-RTA89,
author={Reddy, U. S.},
title={{Rewriting Techniques for Program Synthesis}},
pages={388--403},
crossref={RTA89}
}

@InProceedings{SekarPR-RTA89,
author={Sekar, R. C. and Pawagi, S. and Ramakrishnan, I. V.},
title={{Transforming Strongly Sequential Rewrite Systems with Constructors
 	  for Efficient parallel Execution}},
pages={404--418},
crossref={RTA89}
}

@InProceedings{Snyder-RTA89,
author={Snyder, W.},
title={{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}},
pages={419--433},
crossref={RTA89}
}

@InProceedings{Steinbach-RTA89,
author={Steinbach, J.},
title={{Extensions and Comparison of Simplification Orderings}},
pages={434--448},
crossref={RTA89}
}

@InProceedings{Strandh-RTA89,
author={Strandh, R.},
title={{Classes of Equational Programs that Compile into Efficient Machine Code}},
pages={449--461},
crossref={RTA89}
}

@InProceedings{Tison-RTA89,
author={Tison, S.},
title={{Fair Termination is Decidable for Ground Systems}},
pages={462--476},
crossref={RTA89}
}

@InProceedings{ToyamaKB-RTA89,
author={Toyama, Y. and Klop, J. W. and Barendregt, H. P.},
title={{Termination for the Direct Sum of left-Linear Term Rewriting Systems -Preliminary Draft-}},
pages={477--491},
crossref={RTA89}
}

@InProceedings{Vorobyov-RTA89,
author={Vorobyov, S. G.},
title={{Conditional Rewrite Rule Systems with Built-In Arithmetic and Induction}},
pages={492--512},
crossref={RTA89}
}

@InProceedings{ZhangK-RTA89,
author={Zhang, H. and Kapur, D.},
title={{Consider Only General Superpositions in Completion Procedures}},
pages={513--527},
crossref={RTA89}
}

@InProceedings{AbdulrabP-RTA89,
author={Abdulrab, H. and P\'ecuchet, J.-P.},
title={{Solving Systems of Linear Diophantine Equations and Word Equations (system description)}},
pages={530--532},
crossref={RTA89}
}

@InProceedings{AnantharamanHM-RTA89,
author={Anantharaman, S. and Hsiang, J. and Mzali, J.},
title={{SbReve2: A Term Rewriting Laboratory with (AC-) Unfailing Completion (system description)}},
pages={533--537},
crossref={RTA89}
}

@InProceedings{AvenhausDM-RTA89,
author={Avenhaus, J. and Denzinger, J. and M\"uller, J.},
title={{THEOPOGLES - An efficient Theorem Prover based on Rewrite-Techniques (system description)}},
pages={538--541},
crossref={RTA89}
}

@InProceedings{AvenhausMS-RTA89,
author={Avenhaus, J. and Madlener, K. and Steinbach, J.},
title={{COMTES - An Experimental Environment for the Completion of Term Rewriting Systems (system description)}},
pages={542--546},
crossref={RTA89}
}

@InProceedings{BidoitCC-RTA89,
author={Bidoit, M. and Capy, F. and Choppy, C.},
title={{ASSPEGIQUE: An Integrated Specification Environment (system description)}},
pages={547},
crossref={RTA89}
}

@InProceedings{BonacinaS-RTA89,
author={Bonacina, M. P. and Sanna, G.},
title={{KBlab: An Equational Theorem Prover for the Macintosh (system description)}},
pages={548--550},
crossref={RTA89}
}

@InProceedings{Christian-RTA89,
author={Christian, J.},
title={{Fast Knuth-Bendix Completion: Summary (system description)}},
pages={551--555},
crossref={RTA89}
}

@InProceedings{DauchetD-RTA89,
author={Dauchet, M. and Deruyver, A.},
title={{Compilation of Ground Term Rewriting Systems and Applications (system description)}},
pages={556--558},
crossref={RTA89}
}

@InProceedings{KapurZ-RTA89,
author={Kapur, D. and Zhang, H.},
title={{An Overview of Rewrite Rule Laboratory (RRL) (system description)}},
pages={559--563},
crossref={RTA89}
}

@InProceedings{KhoshnevisanS-RTA89,
author={Khoshnevisan, H. and Sephton, K. M.},
title={{InvX: An Automatic Function Inverter (system description)}},
pages={564--568},
crossref={RTA89}
}

@InProceedings{Lindenstrauss-RTA89,
author={Lindenstrauss, N.},
title={{A Parallel Implementation of Rewriting and Narrowing (system description)}},
pages={569--573},
crossref={RTA89}
}

@InProceedings{Pedersen-RTA89,
author={Pedersen, J.},
title={{Morphocompletion for One-Relation Monoids (system description)}},
pages={574--578},
crossref={RTA89}
}



% CROSSREFERENCES
% These must remain at the end of this file.

@Proceedings{RTA89,
year={1989},
month=apr # {~3--5,},
editor={Dershowitz, Nachum},
title={{Rewriting Techniques and Applications, 3rd International Conference, RTA-89}},
booktitle={{Rewriting Techniques and Applications, 3rd International Conference, RTA-89}},
address={Chapel Hill, NC, USA},
series={LNCS 355},
publisher={Springer-Verlag}
}