Rewriting Techniques and Applications

This volume contains the proceedings of the 15th International Conference on Rewriting Techniques and Applications (RTA 2004), which was held June 2 5, 2004, at the RWTH Aachen in Germany. RTA is the major forum for the presentation of research on all aspects of rewriting. Previous RTA conferences took place in Dijon (1985), Bordeaux (1987), Chapel Hill (1989), Como (1991), Montreal (1993), Kaiserslautern (1995), Rutgers (1996), Sitges (1997), Tsukuba (1998), Trento (1999), Norwich (2000), Utrecht (2001), Copenhagen (2002), and Valencia (2003). The program committee selected 19 papers for presentation, including ?ve system descriptions, from a total of 43 submissions. In addition, there were invited talks by Neil Jones, Aart Middeldorp, and Robin Milner. Many people helped to make RTA 2004 a success. I am grateful to the m- bers of the program committee and the external referees for reviewing the s- missionsandmaintainingthehighstandardsoftheRTAconferences. Itisagreat pleasure to thank the conference chair Jurgen Giesl and the other members of the local organizing committee. They were in charge of the local organization of all events partaking in the Federated Conference on Rewriting, Deduction, and Programming (RDP). Apart from RTA 2004, these events were: 2nd International Workshop on Higher-Order Rewriting (Delia Kesner, Femke van Raamsdonk, and Joe Wells), 5th International Workshop on Rule-Based Programming (Slim Abdennadher and Christophe Ringeissen), 13thInternationalWorkshoponFunctionaland(Constraint)LogicProgr- ming (Herbert Kuchen), IFIP Working Group 1.

Includes supplementary material: sn.pub/extras

Inhalt
Termination Analysis of the Untyped ?-Calculus.- A Type-Based Termination Criterion for Dependently-Typed Higher-Order Rewrite Systems.- Termination of S-Expression Rewriting Systems: Lexicographic Path Ordering for Higher-Order Terms.- Monadic Second-Order Unification Is NP-Complete.- A Certified AC Matching Algorithm.- Matchbox: A Tool for Match-Bounded String Rewriting.- TORPA: Termination of Rewriting Proved Automatically.- Querying Unranked Trees with Stepwise Tree Automata.- A Verification Technique Using Term Rewriting Systems and Abstract Interpretation.- Rewriting for Fitch Style Natural Deductions.- Efficient ?-Evaluation with Interaction Nets.- Proving Properties of Term Rewrite Systems via Logic Programs.- On the Modularity of Confluence in Infinitary Term Rewriting.- mu-term: A Tool for Proving Termination of Context-Sensitive Rewriting.- Automated Termination Proofs with AProVE.- An Approximation Based Approach to Infinitary Lambda Calculi.- Böhm-Like Trees for Term Rewriting Systems.- Dependency Pairs Revisited.- Inductive Theorems for Higher-Order Rewriting.- The Joinability and Unification Problems for Confluent Semi-constructor TRSs.- A Visual Environment for Developing Context-Sensitive Term Rewriting Systems.