Contents of the Proceedings of the
13th International Conference on Rewriting Techniques and Applications.
Copenhagen, Denmark, July 22-24, 2002.
Lecture Notes in Computer Science, Vol. 2378, Springer.
Editor: Sophie Tison.
Invited Talks
- Natarajan Shankar, Harald Rueß,
Combining Shostak Theories
(pages 1-18).
- John C. Mitchell,
Multiset Rewriting and Security Protocol Analysis
(pages 19-22).
- Franz Baader,
Engineering of Logics for the Content-Based Representation of
Information
(page 23).
Regular Papers
- Paul-André Melliès,
Axiomatic Rewriting Theory VI Residual Theory Revisited
(pages 24-50).
- Richard Kennaway, Zurab Khasidashvili and Adolfo Piperno,
Static Analysis of Modularity of beta-Reduction in the Hyperbalanced
lambda-Calculus
(pages 51-65).
- Germain Faure and Claude Kirchner,
Exceptions in the Rewriting Calculus
(pages 66-82).
- Georg Struth,
Deriving Focused Lattice Calculi
(pages 83-97).
- Hiroyuki Seki, Toshinori Takai, Youhei Fujinaka and Yuichi Kaji,
Layered Transducing Term Rewriting System and Its Recognizability
Preserving Property
(pages 98-113).
- Hitoshi Ohsaki and Toshinori Takai,
Decidability and Closure Properties of Equational Tree Languages
(pages 114-128).
- Pierre Réty and Julie Vuotto,
Regular Sets of Descendants by Some Rewrite Strategies
(pages 129-143).
- Johannes Waldmann,
Rewrite Games
(pages 144-158).
- Paula Severi and Fer-Jan de Vries,
An Extensional Böhm Model
(pages 159-173).
- Julien Forest,
A Weak Calculus with Explicit Operators for Pattern Matching and
Substitution
(pages 174-191).
- Chuck Liang and Gopalan Nadathur,
Tradeoffs in the Intensional Representation of Lambda Terms
(pages 192-206).
- David Déharbe, Anamaria Martins Moreira and Christophe
Ringeissen,
Improving Symbolic Model Checking by Rewriting Temporal Logic
Formulae
(pages 207-221).
- Janis Voigtländer,
Conditions for Efficiency Improvement by Tree Transducer Composition
(pages 222-236).
- Martin Bravenboer and Eelco Visser,
Rewriting Strategies for Instruction Selection
(pages 237-251).
- Olivier Bournez and Claude Kirchner,
Probabilistic Rewrite Strategies. Applications to ELAN
(pages 252-266).
- Alfons Geser,
Loops of Superexponential Lengths in One-Rule String Rewriting
(pages 267-280).
- Elias Tahhan-Bittar,
Recursive Derivational Length Bounds for Confluent Term Rewrite Systems
(pages 281-295).
- Salvador Lucas,
Termination of (Canonical) Context-Sensitive Rewriting
(pages 296-310).
- Witold Charatonik and Jean-Marc Talbot,
Atomic Set Constraints with Projection
(pages 311-325).
- Jordi Levy and Mateu Villaret,
Currying Second-Order Unification Problems
(pages 326-339).
- Dan Dougherty and ToMasz Wierzbicki,
A Decidable Variant of Higher Order Matching
(pages 340-351).
- Franz Baader and Cesare Tinelli,
Combining Decision Procedures for Positive Theories Sharing Constructors
(pages 352-366).
System Descriptions
- Jaco van de Pol,
JITty: A Rewriter with Strategy Annotations
(pages 367-370).
- Irène Durand,
Autowrite: A Tool for Checking Properties of Term Rewriting Systems
(pages 371-375).
- Benoit Lecland and Pierre Réty,
TTSLI: An Implementation of Tree-Tuple Synchronized Languages
(pages 376-379).
- Sylvain Lippi,
in2: A Graphical Interpreter for Interaction Nets
(pages 380-384).