Abstract is missing.
- Term Rewriting and Universal Algebra in Historical Perspective (Abstract of Invited Lecture)Garrett Birkhoff. 1
- Characterization of Unification Type ZeroFranz Baader. 2-14
- Proof Normalization for Resolution and ParamodulationLeo Bachmair. 15-28
- Complete Sets of Reductions Modulo Associativity, Commutativity and IdentityTimothy B. Baird, Gerald E. Peterson, Ralph W. Wilkerson. 29-44
- Completion-Time Optimization of Rewrite-Time Goal SolvingHubert Bertling, Harald Ganzinger. 45-58
- Computing Ground Reducability and Inductively Complete PositionsReinhard Bündgen, Wolfgang Küchlin. 59-75
- Inductive Proofs by Specification TransformationHubert Comon. 76-91
- Narrowing and Unification in Functional Programming - An Evaluation Mechanism for Absolute Set AbstractionJohn Darlington, Yike Guo. 92-108
- Simulation of Turning Machines by a Left-Linear Rewrite RuleMax Dauchet. 109-120
- Higher-order Unification with Dependent Function TypesConal Elliott. 121-136
- An Overview of LP, The Larch PowerStephen J. Garland, John V. Guttag. 137-151
- Graph Grammars, A New Paradigma for Implementing Visual LanguagesHerbert Göttler. 152-166
- Termination Proofs and the Length of Derivations (Preliminary Version)Dieter Hofbauer, Clemens Lautemann. 167-177
- Abstract Rewriting with Concrete OperationsStéphane Kaplan, Christine Choppy. 178-186
- On How To Move Mountains Associatively and Commutatively Mike Lai. 187-202
- Generalized Gröbner Bases: Theory and Applications. A CondensationDallas Lankford. 203-221
- A Local Termination Property for Term Rewriting SystemsDana May Latch, Ron Sigal. 222-233
- An Equational Logic SamplerGeorge F. McNulty. 234-262
- Modular Aspects of Properties of Term Rewriting Systems Related to Normal FormsAart Middeldorp. 263-277
- Priority Rewriting: Semantics, Confluence, and ConditionalChilukuri K. Mohan. 278-291
- Negation with Logical Variables in Conditional RewritingChilukuri K. Mohan, Mandayam K. Srivas. 292-310
- Algebraic Semantics and Complexity of Term Rewriting SystemsTohru Naoi, Yasuyoshi Inagaki. 311-325
- Optimization by Non-Deterministic, Lazy RewritingSanjai Narain. 326-342
- Combining Matching Algorithms: The Rectangular CaseTobias Nipkow. 343-358
- Restrictions of Congruence Generated by Finite Canonical String-Rewriting SystemsFriedrich Otto. 359-370
- Embedding with Patterns and Associated Recursive Path OrderingLaurence Puel. 371-387
- Rewriting Techniques for Program SynthesisUday S. Reddy. 388-403
- Transforming Strongly Sequential Rewrite Systems with Constructors for Efficient parallel ExecutionR. C. Sekar, Shaunak Pawagi, I. V. Ramakrishnan. 404-418
- Efficient Ground Completion: An ::::O(n log n):::: Algorithm for Generating Reduced Sets of Ground Rewrite Rules Equivalent to a Set of Ground Equations EWayne Snyder. 419-433
- Extensions and Comparison of Simplification OrderingsJoachim Steinbach. 434-448
- Classes of Equational Programs that Compile into Efficient Machine CodeRobert Strandh. 449-461
- Fair Termination is Decidable for Ground SystemsSophie Tison. 462-476
- Termination for the Direct Sum of left-Linear Term Rewriting Systems -Preliminary Draft-Yoshihito Toyama, Jan Willem Klop, Hendrik Pieter Barendregt. 477-491
- Conditional Rewrite Rule Systems with Built-In Arithmetic and InductionSergei G. Vorobyov. 492-512
- Consider Only General Superpositions in Completion ProceduresHantao Zhang, Deepak Kapur. 513-527
- Solving Systems of Linear Diophantine Equations and Word EquationsHabib Abdulrab, Jean-Pierre Pécuchet. 530-532
- SbReve2: A Term Rewriting Laboratory with (AC-) Unfailing CompletionSiva Anantharaman, Jieh Hsiang, Jalel Mzali. 533-537
- THEOPOGLES - An efficient Theorem Prover based on Rewrite-TechniquesJürgen Avenhaus, Jörg Denzinger, Jürgen Müller. 538-541
- COMTES - An Experimental Environment for the Completion of Term Rewriting SystemsJürgen Avenhaus, Klaus Madlener, Joachim Steinbach. 542-546
- ASSPEGIQUE: An Integrated Specification EnvironmentMichel Bidoit, Francis Capy, Christine Choppy. 547
- KBlab: An Equational Theorem Prover for the MacintoshMaria Paola Bonacina, Giancarlo Sanna. 548-550
- Fast Knuth-Bendix Completion: SummaryJim Christian. 551-555
- Compilation of Ground Term Rewriting Systems and ApplicationsMax Dauchet, Aline Deruyver. 556-558
- An Overview of Rewrite Rule Laboratory (RRL)Deepak Kapur, Hantao Zhang. 559-563
- InvX: An Automatic Function InverterHessam Khoshnevisan, K. M. Sephton. 564-568
- A Parallel Implementation of Rewriting and NarrowingNaomi Lindenstrauss. 569-573
- Morphocompletion for One-Relation MonoidsJohn Pedersen. 574-578