Contents of the Proceedings of the
5th International Conference on Rewriting Techniques and Applications.
Montreal, Canada, June 16-18, 1993.
Lecture Notes in Computer Science, Vol. 690, Springer Verlag.
Editor: Claude Kirchner.
Regular Papers
- L. Bachmair,
Rewrite Techniques in Theorem Proving (Abstract)
(page 1).
- C. Lynch and W. Snyder,
Redundancy Criteria for Constrained Completion
(pages 2-16).
- J. Levy and J. Agustí,
Bi-rewriting, a Term Rewriting Technique for Monotonic Order
Relations
(pages 17-31).
- H. Zhang,
A Case Study of Completion Modulo Distributivity and Abelian
Groups
(pages 32-46).
- A. Werner,
A Semantic Approach to Order-Sorted Rewriting
(pages 47-61).
- J. Avenhaus and J. Denzinger,
Distributing Equational Theorem Proving
(pages 62-76).
- S. Chakrabarti and K. A. Yelick,
On the Correctness of a Distributed Memory Gröbner basis
Algorithm
(pages 77-91).
- M. Moser,
Improving Transformation Systems for General E-Unification
(pages 92-105).
- J. Niehren, A. Podelski and R. Treinen,
Equational and Membership Constraints for Finite Trees
(pages 106-120).
- R. Backofen,
Regular Path Expression in Feature Logic
(pages 121-135).
- J. H. Gallier,
Proving Properties of Typed Lambda Terms: Realizability, Covers, and
Sheaves (Abstract)
(page 136).
- D. J. Dougherty,
Some Lambda Calculi with Categorial Sums and Products
(pages 137-151).
- A. Asperti and C. Laneve,
Paths, Computations and Labels in the Lambda-Calculus
(pages 152-167).
- F. van Raamsdonk,
Confluence and Superdevelopments
(pages 168-182).
- Z. M. Ariola,
Relating Graph and Term Rewriting via Böhm Models
(pages 183-197).
- N. Dershowitz and C. Hoot,
Topics in Termination
(pages 198-212).
- M. C. F. Ferreira and H. Zantema,
Total Termination of Term Rewriting
(pages 213-227).
- A. Middeldorp and B. Gramlich,
Simple Termination is Difficult
(pages 228-242).
- Z. Khasidashvili,
Optimal Normalization in Orthogonal Term Rewriting Systems
(pages 243-258).
- J. Field,
A Graph Reduction Approach to Incremental Term Rewriting
(Preliminary Report)
(pages 259-273).
- E. Lippe,
Generating Tables for Bottom-Up Matching
(pages 274-288).
- S. I. Adian,
On some Algorithmic Problems for Groups and Monoids
(pages 289-300).
- F. Baader and K. U. Schulz,
Combination Techniques and Decision Problems for Disunification
(pages 301-315).
- M. Tajine,
The Negation Elimination from Syntactic Equational Formula is
Decidable
(pages 316-327).
- A.-C. Caron, J.-L. Coquidé and M. Dauchet,
Encompassment Properties and Automata with Constraints
(pages 328-342).
- J.-C. Raoult,
Recursively Defined Tree Transductions
(pages 343-357).
- M. Fernández,
AC Complement Problems: Satisfiability and Negation Elimination
(pages 358-373).
- A. Rubio and R. Nieuwenhuis,
A Precedence-Based Total AC-Compatible Ordering
(pages 374-388).
- C. Delor and L. Puel,
Extension of the Associative Path Ordering to a Chain of Associative
Commutative Symbols
(pages 389-404).
- D. A. Plaisted,
Polynomial Time Termination and Constraint Satisfaction Tests
(pages 405-420).
- U. Martin,
Linear Interpretations by Counting Patterns
(pages 421-433).
- G. Sénizergues,
Some Undecidable Termination Problems for Semi-Thue Systems
(Abstract)
(page 434).
System Description
- P. Nivela and R. Nieuwenhuis,
Saturation of First-Order (Constrained) Clauses with the Saturate
System
(pages 436-440).
- B. Matthews,
MERILL: An Equational Reasoning System in Standard ML
(pages 441-445).
- R. Bündgen,
Reduce the Redex -> ReDuX
(pages 446-450).
- M. Löwe and M. Beyer,
AGG - An Implementation of Algebraic Graph Rewriting
(pages 451-456).
- R. M. Verma,
Smaran: A Congruence-Closure Based System for Equational
Computations
(pages 457-461).
- Y. Gui and M. Okada,
LAMBDALG: Higher Order Algebraic Specification Language
(pages 462-466).
Open Problems
- N. Dershowitz, J.-P. Jouannaud and J. W. Klop,
More Problems in Rewriting
(pages 468-487).