Contents of the Proceedings of the
3rd International Conference on Rewriting Techniques and Applications.
Chapel Hill, North Carolina, USA, April 3-5, 1989.
Lecture Notes in Computer Science, Vol. 355, Springer Verlag.
Editor: Nachum Dershowitz.
Invited Lecture
- G. Birkhoff,
Term Rewriting and Universal Algebra in Historical Perspective
(Abstract of Invited Lecture)
(page 1).
Regular Papers
- F. Baader,
Characterization of Unification Type Zero
(pages 2-14).
- L. Bachmair,
Proof Normalization for Resolution and Paramodulation
(pages 15-28).
- T. B. Baird, G. E. Peterson and R. W. Wilkerson,
Complete Sets of Reductions Modulo Associativity, Commutativity and
Identity
(pages 29-44).
- H. Bertling and H. Ganzinger,
Completion-Time Optimization of Rewrite-Time Goal Solving
(pages 45-58).
- R. Bündgen and W. Küchlin,
Computing Ground Reducability and Inductively Complete
Positions
(pages 59-75).
- H. Comon,
Inductive Proofs by Specification Transformation
(pages 76-91).
- J. Darlington and Y. Guo,
Narrowing and Unification in Functional Programming - An Evaluation
Mechanism for Absolute Set Abstraction
(pages 92-108).
- M. Dauchet,
Simulation of Turning Machines by a Left-Linear Rewrite Rule
(pages 109-120).
- C. Elliott,
Higher-order Unification with Dependent Function Types
(pages 121-136).
- S. J. Garland, J. V. Guttag,
An Overview of LP, The Larch Power
(pages 137-151).
- H. Göttler,
Graph Grammars, A New Paradigma for Implementing Visual
Languages
(pages 152-166).
- D. Hofbauer and C. Lautemann,
Termination Proofs and the Length of Derivations (Preliminary
Version)
(pages 167-177).
- S. Kaplan and C. Choppy,
Abstract Rewriting with Concrete Operations
(pages 178-186).
- M. Lai,
On How To Move Mountains 'Associatively and Commutatively'
(pages 187-202).
- D. Lankford,
Generalized Gröbner Bases: Theory and Applications. A
Condensation
(pages 203-221).
- D. M. Latch and R. Sigal,
A Local Termination Property for Term Rewriting Systems
(pages 222-233).
- G. F. McNulty,
An Equational Logic Sampler
(pages 234-262).
- A. Middeldorp,
Modular Aspects of Properties of Term Rewriting Systems Related to
Normal Forms
(pages 263-277).
- C. K. Mohan,
Priority Rewriting: Semantics, Confluence, and Conditional
(pages 278-291).
- C. K. Mohan and M. K. Srivas,
Negation with Logical Variables in Conditional Rewriting
(pages 292-310).
- T. Naoi and Y. Inagaki,
Algebraic Semantics and Complexity of Term Rewriting Systems
(pages 311-325).
- S. Narain,
Optimization by Non-Deterministic, Lazy Rewriting
(pages 326-342).
- T. Nipkow,
Combining Matching Algorithms: The Rectangular Case
(pages 343-358).
- F. Otto,
Restrictions of Congruence Generated by Finite Canonical
String-Rewriting Systems
(pages 359-370).
- L. Puel,
Embedding with Patterns and Associated Recursive Path Ordering
(pages 371-387).
- U. S. Reddy,
Rewriting Techniques for Program Synthesis
(pages 388-403).
- R. C. Sekar, S. Pawagi and I. V. Ramakrishnan,
Transforming Strongly Sequential Rewrite Systems with Constructors
for Efficient parallel Execution
(pages 404-418).
- W. Snyder,
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).
- J. Steinbach,
Extensions and Comparison of Simplification Orderings
(pages 434-448).
- R. Strandh,
Classes of Equational Programs that Compile into Efficient Machine
Code
(pages 449-461).
- S. Tison,
Fair Termination is Decidable for Ground Systems
(pages 462-476).
- Y. Toyama, J. W. Klop and H. P. Barendregt,
Termination for the Direct Sum of left-Linear Term Rewriting Systems
-Preliminary Draft-
(pages 477-491).
- S. G. Vorobyov,
Conditional Rewrite Rule Systems with Built-In Arithmetic and
Induction
(pages 492-512).
- H. Zhang and D. Kapur,
Consider Only General Superpositions in Completion Procedures
(pages 513-527).
System Descriptions
- H. Abdulrab, J.-P. Pécuchet,
Solving Systems of Linear Diophantine Equations and Word
Equations
(pages 530-532).
- S. Anantharaman, J. Hsiang and J. Mzali,
SbReve2: A Term Rewriting Laboratory with (AC-) Unfailing
Completion
(pages 533-537).
- J. Avenhaus, J. Denzinger and J. Müller,
THEOPOGLES - An efficient Theorem Prover based on
Rewrite-Techniques
(pages 538-541).
- J. Avenhaus, K. Madlener and J. Steinbach,
COMTES - An Experimental Environment for the Completion of Term
Rewriting Systems
(pages 542-546).
- M. Bidoit, F. Capy and C. Choppy,
ASSPEGIQUE: An Integrated Specification Environment
(page 547).
- M. P. Bonacina and G. Sanna,
KBlab: An Equational Theorem Prover for the Macintosh
(pages 548-550).
- J. Christian,
Fast Knuth-Bendix Completion: Summary
(pages 551-555).
- M. Dauchet and A. Deruyver,
Compilation of Ground Term Rewriting Systems and Applications
(pages 556-558).
- D. Kapur and H. Zhang,
An Overview of Rewrite Rule Laboratory (RRL)
(pages 559-563).
- H. Khoshnevisan and K. M. Sephton,
InvX: An Automatic Function Inverter
(pages 564-568).
- N. Lindenstrauss,
A Parallel Implementation of Rewriting and Narrowing
(pages 569-573).
- J. Pedersen,
Morphocompletion for One-Relation Monoids
(pages 574-578).