Contents of the Proceedings of the
10th International Conference on Rewriting Techniques and Applications.
Trento, Italy, July 2-4, 1999.
Lecture Notes in Computer Science, Vol. 1631, Springer Verlag.
Editors: Paliath Narendran and Michaël Rusinowitch.
Regular Papers
- R. Nieuwenhuis and J. M. Rivero,
Solved Forms for Path Ordering Constraints
(pages 1-15).
- N. Dershowitz and S. Mitra,
Jeopardy
(pages 16-29).
- E. Visser,
Strategic Pattern Matching
(pages 30-44).
- P. de Groote,
On the Strong Normalisation of Natural Deduction with
Permutation-Conversions
(pages 45-59).
- V. van Oostrom,
Normalisation in Weakly Orthogonal Rewriting
(pages 60-74).
- R. Di Cosmo and S. Guerrini,
Strong Normalization of Proof Nets Modulo Structural
Congruences
(pages 75-89).
Invited Talk
- B. Courcelle,
Hierarchical Graph Decompositions Defined by Grammars and Logical
Formulas
(pages 90-91).
Regular Papers
- J. Marcinkowski,
Undecidability of the exists*forall* Part of the Theory of Ground
Term Algebra Modulo an AC Symbol
(pages 92-102).
- A.-C. Caron, F. Seynhaeve, S. Tison and M. Tommasi,
Deciding the Satisfiability of Quantifier free Formulae on One-Step
Rewriting
(pages 103-117).
- S. Limet and P. Réty,
A New Result about the Decidability of the Existential One-Step
Rewriting Theory
(pages 118-132).
- A. Rubio,
A Fully Syntactic AC-RPO
(pages 133-147).
- J. Stuber,
Theory Path Orderings
(pages 148-162).
- H. Touzet,
A Characterisation of Multiply Recursive Functions with Higman's
Lemma
(pages 163-174).
- F. Baader and C. Tinelli,
Deciding the Word Problem in the Union of Equational Theories
Sharing Constructors
(pages 175-189).
- L. Bachmair, C. R. Ramakrishnan, I. V. Ramakrishnan and A. Tiwari,
Normalization via Rewrite Closures
(pages 190-204).
- D. Hofbauer and M. Huber,
Test Sets for the Universal and Existential Closure of Regular Tree
Languages
(pages 205-219).
Invited Tutorial
- F. van Raamsdonk,
Higher-Order Rewriting
(pages 220-239).
System Description
- M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-Oliet, J. Meseguer
and J. F. Quesada,
The Maude System
(pages 240-243).
- F. J. López-Fraguas and J. Sánchez-Hernández,
TOY: A Multiparadigm Declarative System
(pages 244-247).
- S. Kepser and J. Richts,
UniMoK: A System for Combining Equational Unification Algorithm
(pages 248-251).
- R. M. Verma and S. Senanayake,
LR2: A Laboratory for Rapid Term Graph Rewriting
(pages 252-255).
Regular Papers
- T. Nagaya and Y. Toyama,
Decidability for Left-Linaer Growing Term Rewriting Systems
(pages 256-270).
- J. Giesl and A. Middeldorp,
Transforming Context-Sensitive Rewrite Systems
(pages 271-287).
- M. C. F. Ferreira and A. L. Ribeiro,
Context-Sensitive AC-Rewriting
(pages 286-300).
- F. Blanqui, J.-P. Jouannaud and M. Okada,
The Calculus of algebraic Constructions
(pages 301-316).
- G. Dowek, T. Hardin and C. Kirchner,
HOL-lambdasigma: An Intentional First-Order Expression of
Higher-Order Logic
(pages 317-331).
Invited Talk
- F. Otto,
On the Connections between Rewriting and Formal Language Theory
(pages 332-355).
Regular Papers
- C. Frougny and J. Sakarovitch,
A Rewrite System Associated with Quadratic Pisot Units
(pages 356-370).
- M. Göbel,
Fast Rewriting of Symmetric Polynomials
(pages 371-381).
- F. Saubion and I. Stéphan,
On Implementation of Tree Synchronized Languages
(pages 382-396).