Rewriting Techniques and Applications [electronic resource] : 15th International Conference, RTA 2004, Aachen, Germany, June 3-5, 2004. Proceedings / edited by Vincent Oostrom.

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.