RTA accepted papers

Regular papers

Franz Baader, Dresden U of Techn., Germany and Cesare Tinelli, U Iowa, USA
Combining decision procedures for positive theories sharing constructors

Olivier Bournez and Claude Kirchner, LORIA Nancy, France
Probabilistic rewrite strategies: Applications to ELAN

Witold Charatonik, MPI Saarbrücken, Germany and Jean-Marc Talbot, U Lille, France
Atomic set constraints with projection

David Déharbe, Federal U of Rio Grande do Norte, Brazil; Anamaria Martins Moreira, Federal U of Rio Grande do Norte, Brazil; and Christophe Ringeissen, LORIA Nancy, France
Improving symbolic model checking by rewriting temporal logic formulae

Daniel J. Dougherty, Wesleyan U, USA and Tomasz Wierzbicki, U Wroclaw, Poland
A decidable variant of higher order matching

Germain Faure, ENS Lyon, France and Claude Kirchner, LORIA Nancy, France
Exceptions in the rewriting calculus

Julien Forest, U Paris XI (Paris-Sud), France
A weak calculus with explicit operators for pattern matching and substitution

Alfons Geser, NASA Langley, USA
Loops of superexponential lengths in one-rule string rewriting

Richard Kennaway, U East Anglia, UK; Zurab Khasidashvili, Bar-Ilan U, Israel; and Adolfo Piperno, U Rome I (La Sapienza), Italy
Static analysis of modularity of beta-reduction in the hyperbalanced lambda-calculus

Jordi Levy, U Barcelona, Spain and Mateu Villaret, U Girona, Spain
Currying second-order unification

Salvador Lucas, Polytechnic U of Valencia, Spain
Termination of (canonical) context-sensitive rewriting

Paul-André Melliès, U Paris VII, France
Axiomatic rewriting theory VI: Residual theory revisited

Hitoshi Ohsaki and Toshinori Takai, AIST, Japan
Decidability and closure properties for computation on equational tree languages

Pierre Réty and Julie Vuotto, U Orléans, France
Regular sets of descendants by some rewrite strategies

Hiroyuki Seki, Nara Inst. of Science and Techn., Japan; Toshinori Takai, AIST, Japan; Youhei Fujinaka, Nara Inst. of Science and Techn., Japan; and Yuichi Kaji, Nara Inst. of Science and Techn., Japan
Layered transducing term rewriting system and its recognizability preserving property

Paula Severi, U Turin, Italy and Fer-Jan de Vries, U Leicester, UK
An extensional Böhm model

Georg Struth, U Augsburg, Germany
Deriving focused lattice calculi

Elias Tahhan-Bittar, U Simón Bolívar, Venezuela
Recursive derivational length bounds for confluent term rewrite systems

Janis Voigtländer, Dresden U of Techn., Germany
Conditions for efficiency improvement by tree transducer composition

Johannes Waldmann, U Leipzig, Germany
Rewrite games

Application papers

Martin Bravenboer and Eelco Visser, Utrecht U, The Netherlands
Rewriting strategies for instruction selection

Chuck Liang, Hofstra U, USA and Gopalan Nadathur, U Minnesota, USA
Tradeoffs in the intensional representation of lambda terms

Tool demonstrations

Irène Durand, U Bordeaux I, France

Benoit Lecland and Pierre Réty, U Orléans, France
TTSLI: an implementation of tree-tuple synchronized languages

Sylvain Lippi, IML Marseille, France
in²: A graphical interpreter for interaction nets

Jaco van de Pol, CWI Amsterdam, The Netherlands
JITty: A rewriter with strategy annotations