Contents of the Proceedings of the
12th International Conference on Rewriting Techniques and Applications.
Utrecht, The Netherlands, May 22-24, 2001.
Lecture Notes in Computer Science, Vol. 2051, Springer.
Editor: Aart Middeldorp.
Invited Talks
- Henk Barendregt,
Computing and Proving
(page 1).
- Michaël Rusinowitch,
Rewriting for Deduction and Verification
(page 2).
Regular Papers
- Denis Bechet,
Universal Interaction Systems with Only Two Agents
(pages 3-14).
- Alessandro Berarducci and Corrado Böhm,
General Recursion on Second Order Term Algebras
(pages 15-30).
- Manuel Bodirsky, Katrin Erk, Alexander Koller and Joachim Niehren,
Beta Reduction Constraints
(pages 31-46).
- Eduardo Bonelli, Delia Kesner and Alejandro Ríos,
From Higher-Order to First-Order Rewriting
(pages 47-62).
- Alexandre Boudet and Evelyne Contejean,
Combining Pattern E-Unification Algorithms
(pages 63-76).
- Horatiu Cirstea, Claude Kirchner and Luigi Liquori,
Matching Power
(pages 77-92).
- Jürgen Giesl and Deepak Kapur,
Dependency Pairs for Equational Rewriting
(pages 93-108).
- Dieter Hofbauer,
Termination Proofs by Context-Dependent Interpretations
(pages 108-121).
- Zurab Khasidashvili, Mizuhito Ogawa and Vincent van Oostrom,
Uniform Normalisation beyond Orthogonality
(pages 122-136).
- Konstantin Korovin and Andrei Voronkov,
Verifying Orientability of Rewrite Rules Using the Knuth-Bendix Order
(pages 137-153).
- Armin Kühnemann, Robert Glück and Kazuhiko Kakehi,
Relating Accumulative and Non-accumulative Functional Programs
(pages 154-168).
- Jordi Levy and Mateu Villaret,
Context Unification and Traversal Equations
(pages 169-184).
- Sébastien Limet, Pierre Réty and Helmut Seidl,
Weakly Regular Relations and Applications
(pages 185-200).
- Markus Lohrey,
On the Parallel Complexity of Tree Automata
(pages 201-215).
- Salvador Lucas,
Transfinite Rewriting Semantics for Term Rewriting Systems
(pages 216-230).
- Christopher Lynch and Barbara Morawska,
Goal-Directed E-Unification
(pages 231-245).
- Michio Oyamaguchi and Yoshikatsu Ohta,
The Unification Problem for Confluent Right-Ground Term Rewriting Systems
(pages 246-260).
- Femke van Raamsdonk,
On Termination of Higher-Order Rewriting
(pages 261-275).
- Christophe Ringeissen,
Matching with Free Function Symbols - A Simple Extension of Matching?
(pages 276-290).
- Georg Struth,
Deriving Focused Calculi for Transitive Relations
(pages 291-305).
- René Vestergaard and James Brotherston,
A Formalised First-Order Confluence Proof for the lambda-Calculus Using One-Sorted Variable Names
(pages 306-321).
- Jens R. Woinowski,
A Normal Form for Church-Rosser Language Systems
(pages 322-337).
- Toshiyuki Yamada,
Confluence and Termination of Simply Typed Term Rewriting Systems
(pages 338-352).
System Descriptions
- Jorge Sousa Pinto,
Parallel Evaluation of Interaction Nets with MPINE
(pages 353-356).
- Eelco Visser,
Stratego: A Language for Program Transformation Based on Rewriting Strategies
(pages 357-362).