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