Rewriting Techniques and Applications

This volume contains the proceedings of the 13th International Conference on Rewriting Techniques and Applications (RTA 2002),which was held July 22- 24,2002 in Copenhagen as part of the 3rd Federated Logic Conference (FLoC 2002). RTA is the ma jor international 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),Kaise- lautern (1995),Rutgers (1996),Sitges (1997),Tsukuba (1998),Trento (1999), Norwich (2000),and Utrecht (2001). A total of 20 regular papers,2 application papers and 4 system descriptions were selected for presentation from 49 submissions from Argentina (1),Brazil 2 1 5 ( ),Czech Republic (1),France (13),Germany (8),Israel ( ),Italy (1 ),Japan 3 3 6 1 (6),The Netherlands (2),Poland (1),Portugal (1 ),Rumania (1),Spain (4),UK 3 5 1 1 ( ),Uruguay ( ),USA (5 ),Venezuela (1). The program committee awarded 6 2 2 the best paper prize to Paul-Andr e Melli` es for his paper Residual Theory Re- sited. This paper presents an elegant and subtle generalization of Jean-Jacques L evy s residual theory. I am especially grateful to the invited speakers Franz Baader,John Mitchell, and Natara jan Shankar for accepting our invitation to present us their insights into their research areas.

Includes supplementary material: sn.pub/extras

Inhalt
Invited Talks.- Combining Shostak Theories.- Multiset Rewriting and Security Protocol Analysis.- Engineering of Logics for the Content-Based Representation of Information.- Regular Papers, Application Papers.- Axiomatic Rewriting Theory VI: Residual Theory Revisited.- Static Analysis of Modularity of ?-Reduction in the Hyperbalanced ?-Calculus.- Exceptions in the Rewriting Calculus.- Deriving Focused Lattice Calculi.- Layered Transducing Term Rewriting System and Its Recognizability Preserving Property.- Decidability and Closure Properties of Equational Tree Languages.- Regular Sets of Descendants by Some Rewrite Strategies.- Rewrite Games.- An Extensional Böhm Model.- A Weak Calculus with Explicit Operators for Pattern Matching and Substitution.- Tradeoffs in the Intensional Representation of Lambda Terms.- Improving Symbolic Model Checking by Rewriting Temporal Logic Formulae.- Conditions for Efficiency Improvement by Tree Transducer Composition.- Rewriting Strategies for Instruction Selection.- Probabilistic Rewrite Strategies. Applications to ELAN.- Loops of Superexponential Lengths in One-Rule String Rewriting.- Recursive Derivational Length Bounds for Confluent Term Rewrite Systems Research Paper.- Termination of (Canonical) Context-Sensitive Rewriting.- Atomic Set Constraints with Projection.- Currying Second-Order Unification Problems.- A Decidable Variant of Higher Order Matching.- Combining Decision Procedures for Positive Theories Sharing Constructors.- System Descriptions.- JITty: A Rewriter with Strategy Annotations.- Autowrite: A Tool for Checking Properties of Term Rewriting Systems.- TTSLI: An Implementation of Tree-Tuple Synchronized Languages.- in2: A Graphical Interpreter for Interaction Nets.