| Invited Talks |
| Computing and Proving / Henk Barendregt |
| Rewriting for Deduction / Verification ; Michael Rusinowitch |
| Regular Papers |
| Universal Interaction Systems with Only Two Agents / Denis Bechet |
| General Recursion on Second Order Term Algebras / Alessandro Berarducci ; Corrado Bohm |
| Beta Reduction Constraints / Manuel Bodirsky ; Katrin Erk ; Alexander Koller ; Joachim Niehren |
| From Higher-Order to First-Order Rewriting / Eduardo Bonelli ; Delia Kesner ; Alejandro RÃos |
| Combining Pattern E-Unification Algorithms / Alexandre Boudet ; Evelyne Contejean |
| Matching Power / Horatiu Cirstea ; Claude Kirchner ; Luigi Liquori |
| Dependency Pairs for Equational Rewriting / Jurgen Giesl ; Deepak Kapur |
| Termination Proofs by Context-Dependent Interpretations / Dieter Hofbauer |
| Uniform Normalisation beyond Orthogonality / Zurab Khasidashvili ; Mizuhito Ogawa ; Vincent van Oostrom |
| Verifying Orientability of Rewrite Rules Using the Knuth-Bendix Order / Konstantin Korovin ; Andrei Voronkov |
| Relating Accumulative and Non-accumulative Functional Programs / Armin Kuhnemann ; Robert Gluck ; Kazuhiko Kakehi |
| Context Unification and Traversal Equations / Jordi Levy ; Mateu Villaret |
| Weakly Regular Relations and Applications / Sebastien Limet ; Pierre Rety ; Helmut Seidl |
| On the Parallel Complexity of Tree Automata / Markus Lohrey |
| Transfinite Rewriting Semantics for Term Rewriting Systems / Salvador Lucas |
| Goal-Directed E-Unification / Christopher Lynch ; Barbara Morawska |
| The Unification Problem for Confluent Right-Ground Term Rewriting |
| Systems / Michio Oyamaguchi ; Yoshikatsu Ohta |
| On Termination of Higher-Order Rewriting / Femke van Raamsdonk |
| Matching with Free Function Symbols - A Simple Extension of Matching? / Christophe Ringeissen |
| Deriving Focused Calculi for Transitive Relations / Georg Struth |
| A Formalised First-Order Confluence Proof for the ?-Calculus Using One-Sorted Variable Names (Barendregt Was Right after all ... almost) / Rene Vestergaard ; James Brotherston |
| A Normal Form for Church-Rosser Language Systems / Jens R. Woinowski |
| Confluence and Termination of Simply Typed Term Rewriting Systems / Toshiyuki Yamada |
| System Descriptions |
| Parallel Evaluation of Interaction Nets with MPINE / Jorge Sousa Pinto |
| Stratego: A Language for Program Transformation Based on Rewriting Strategies (System Description of Stratego 0.5) / Eelco Visser |
| Author Index |
| Invited Talks |
| Computing and Proving / Henk Barendregt |
| Rewriting for Deduction / Verification ; Michael Rusinowitch |
図書
