Contents of the Proceedings of the
4th International Conference on Rewriting Techniques and Applications.
Como, Italy, April 10-12, 1991.
Lecture Notes in Computer Science, Vol. 488, Springer Verlag.
Editor: Ronald V. Book.
- R. Kennaway, J. W. Klop, M. R. Sleep and F.-J. de Vries,
Transfinite Reductions in Orthogonal Term Rewriting Systems
(Extended Abstract)
(pages 1-12).
- W. M. Farmer and R. J. Watro,
Redex Capturing in Term Graph Rewriting (Concise Version)
(pages 13-24).
- D. A. Wolfram,
Rewriting, and Equational Unification: the Higher-Order Cases
(pages 25-36).
- D. J. Dougherty,
Adding Algebraic Rewriting to the Untyped Lambda Calculus (Extended
Abstract)
(pages 37-48).
- F. Drewes and C. Lautemann,
Incremental Termination Proofs and the Length of Derivations
(pages 49-61).
- D. Hofbauer,
Time Bounded Rewrite Systems and Termination Proofs by Generalized
Embedding
(pages 62-73).
- S. Krischer and A. Bockmayr,
Detecting Redundant Narrowing Derivations by the LSE-SL Reducability
Test
(pages 74-85).
- F. Baader,
Unification, Weak Unification, Upper Bound, Lower Bound, and
Generalization Problems
(pages 86-97).
- E. Domenjoud,
AC Unification Through Order-Sorted AC1 Unification
(pages 98-111).
- J. Chabin and P. Réty,
Narrowing Directed by a Graph of Terms
(pages 112-123).
- F. Baader and W. Nutt,
Adding Homomorphisms to Commutative/Monoidal Theories or How Algebra
Can Help in Equational Unification
(pages 124-135).
- F. Klay,
Undecidable Properties of Syntactic Theories
(pages 136-149).
- W. Snyder and C. Lynch,
Goal Directed Strategies for Paramodulation
(pages 150-161).
- L. Pottier,
Minimal Solutions of Linear Diophantine Systems: Bounds and
Algorithms
(pages 162-173).
- H. Kirchner,
Proofs in Parameterized Specification
(pages 174-187).
- A. Middeldorp and Y. Toyama,
Completeness of Combinations of Constructor Systems
(pages 188-199).
- T. Nipkow and Z. Qian,
Modular Higher-Order E-Unification
(pages 200-214).
- P.-L. Curien and G. Ghelli,
On Confluence for Weakly Normalizing Systems
(pages 215-225).
- F. Bellegarde,
Program Transformation and Rewriting
(pages 226-239).
- D. Cohen and P. Watson,
An Efficient Representation of Arithmetic for Term Rewriting
(pages 240-251).
- S. van Denneheuvel, K. L. Kwast, G. R. Renardel de Lavalette and
E. Spaan,
Query Optimization Using Rewrite Rules
(pages 252-263).
- R. Socher-Ambrosius,
Boolean Algebra Admits No Convergent Term Rewriting System
(pages 264-274).
- K. Salomaa,
Decidability of Confluence and Termination of Monadic Term Rewriting
Systems
(pages 275-286).
- J.-L. Coquidé, M. Dauchet, R. Gilleron and S. Vágvölgyi,
Bottom-Up Tree Pushdown Automata and Rewrite Systems
(pages 287-298).
- G. A. Kucherov,
On Relationship Between Term Rewriting Systems and Regular Tree
Languages
(pages 299-311).
- F.-J. Brandenburg,
The Equivalence of Boundary and Confluent Graph Grammars on Graph
Languages of Bounded Degree
(pages 312-322).
- A. Gräf,
Left-to-Right Tree Pattern Matching
(pages 323-334).
- R. Ramesh and I. V. Ramakrishnan,
Incremental Techniques for Efficient Normalization of Nonlinear
Rewrite Systems
(pages 335-347).
- M. P. Bonacina and J. Hsiang,
On Fairness of Completion-Based Theorem Proving Strategies
(pages 348-360).
- J. Avenhaus,
Proving Equational and Inductive Theorems by Completion and
Embedding Techniques
(pages 361-373).
- A. Sattler-Klein,
Divergence Phenomena during Completion
(pages 374-385).
- R. Bündgen,
Simulation Buchberger's Algorithm by Knuth-Bendix Completion
(pages 386-397).
- M. Hermann,
On Proving Properties of Completion Strategies
(pages 398-410).
- C. Marché,
On Ground AC-Completion
(pages 411-422).
- P. Narendran and M. Rusinowitch,
Any Gound Associative-Commutative Theory Has a Finite Canonical
System
(pages 423-434).
- U. Fraus,
A Narrowing-Based Theorem Prover
(pages 435-436).
- M. Billaud,
ANIGRAF: An Interactive System for the Animation of Graph Rewriting
Systems with Priorities
(pages 437-438).
- A. Deruyver,
EMMY: A Refutational Theorem Prover for First-Order Logic with
Equation
(pages 439-441).
- R. Agarwal, D. R. Musser, D. Kapur and X. Nie,
The Tecton Proof System
(pages 442-444).
- N. Dershowitz, J.-P. Jouannaud and J. W. Klop,
Open Problems in Rewriting
(pages 445-456).