RTA'05

---

The International Conference on Rewriting Techniques and Applications (RTA) is the major conference on rewriting. Its creation was decided after the Workshop on the Rewrite Rule Laboratory, held in Schenectady (NY) in September 1983. From 1985 to 1993, RTA was a bi-annual conference. In 1995, RTA was merged with the Workshop on Conditional (and Typed) Term Rewriting Systems (CTRS) and became an annual conference.

Previous RTA meetings were held in Dijon (1985), Bordeaux (1987), Chapel Hill (1989), Como (1991), Montreal (1993), Kaiserslautern (1995), Rutgers (1996), Sitges (1997), Tsukuba (1998), Trento (1999), Norwich (2000), Utrecht (2001), Copenhagen (2002), Valencia (2003), Aachen (2004).

In 2005, RTA is organized as part of the Federated Conference on Rewriting, Deduction, and Programming (RDP), collocated with TLCA (International Conference on Typed Lambda Calculi and Applications) and several affiliated workshops.

PROGRAM OF RTA

IMPORTANT DATES

November 12, 2004	Deadline for electronic submission of title and abstract
November 19, 2004	Deadline for electronic submission of papers
January 14, 2005	Notification of acceptance of papers
February 4, 2005	Deadline for final versions of accepted papers
April 19 - 21, 2005	Conference

These deadlines are strict.

TOPICS

RTA is the major forum for the presentation of research on all aspects of rewriting. Typical areas of interest include (but are not limited to):

• Applications: case studies; rule-based (functional and logic) programming; symbolic and algebraic computation; theorem proving; system synthesis and verification; proof checking.
• Foundations: matching and unification; narrowing; completion techniques; strategies; constraint solving; explicit substitutions; tree automata.
  
• Frameworks: string, term, and graph rewriting; lambda-calculus and higher-order rewriting; proof nets; constrained rewriting/deduction; categorical and infinitary rewriting.
• Implementation: compilation techniques; parallel execution; rewriting tools.
• Semantics: equational logic; rewriting logic.

SUBMISSIONS and CALL FOR PAPERS

• An ASCII version of the title and of the abstract must reach the program chair by November 12, 2004.
• The deadline for the submissions of the full papers is November 19, 2004.
• Papers should be submitted electronically via the web-based submission form.
• If electronic submission is not possible, four hard copies may be sent to the program chair.

Submissions must be original and not submitted for publication elsewhere. Submission categories include regular research papers and system descriptions. Also problem sets and submissions describing interesting applications of rewriting techniques will be very welcome.

Authors are encouraged to use LaTeX and the Springer llncs class files available from http://www.springer.de/comp/lncs/authors.html. If you use this class, turn on page numbers using \pagestyle{plain}. Proofs of theorems should be provided in the paper, or, if space does not permit, should be made accessible otherwise (e.g. as an appendix). The page limit is 15 pages (10 pages for system descriptions). Papers that are late, too long or require substantial revision will not be considered.

The call for papers can be found here.

PROCEEDINGS

The proceedings of RTA 2005 were published by Springer-Verlag as LNCS 3467 in their Lecture Notes in Computer Science series. The online-version of the proceedings is available here.

INVITED SPEAKERS

Amy Felty (Ottawa)	A Tutorial Example of the Semantic Approach to Foundational Proof-Carrying Code
Yoshihito Toyama (Sendai)	Confluent Term Rewriting Systems
Philip Wadler (Edinburgh)	Call-by-Value is Dual to Call-by-Name --- Reloaded

ANNIVERSARY SESSION: 20 YEARS OF RTA

Since RTA 2005 marks the 20th anniversary of RTA, this anniversary will be celebrated with a special session consisting of three invited talks on the history and future of RTA and rewriting.

Nachum Dershowitz (Tel Aviv)	Open. Closed. Open.
Gerard Huet (Rocquencourt)	Before RTA: Early Days in Rewriting Research
Jean-Pierre Jouannaud (Palaiseau)	Twenty Years Later

BEST PAPER AWARD and STUDENT TRAVEL GRANTS

The PC decided to give the best paper award of 100,000 Yen to the paper Extending the Explicit Substitution Paradigm by Delia Kesner and Stephane Lengrand.

To encourage the submission of papers (co-)authored by students, two student travel grants were available. The PC decided to give these grants to Jérôme Rocheteau (author of Lambda-Mu-Calculus and Duality: Call-by-Name and Call-by-Value) and to Wojciech Moczydlowski (co-author of Termination of Single-Threaded One-Rule Semi-Thue Systems).

LOCATION, TRAVEL, ACCOMMODATION, and REGISTRATION

The conference takes place in Nara park, which is one of the most important cultural sights of Japan with some of the oldest and most impressive temples and shrines. Airfares from Europe or the US to Japan are not expensive in mid-April and the conference will offer reasonably priced accommodation and low registration fees. 

PROGRAM COMMITTEE

Franz Baader	Dresden
Mariangiola Dezani	Torino
Jürgen Giesl	Aachen	(Chair)
Bernhard Gramlich	Vienna
Florent Jacquemard	Cachan
Claude Kirchner	Nancy
Pierre Lescanne	Lyon
Aart Middeldorp	Innsbruck
Hitoshi Ohsaki	Amagasaki
Vincent van Oostrom	Utrecht
Christine Paulin-Mohring	Orsay
Frank Pfenning	Pittsburgh
Femke van Raamsdonk	Amsterdam
Mark-Oliver Stehr	Urbana
Rakesh Verma	Houston
Andrei Voronkov	Manchester

PROGRAM CHAIR

Jürgen Giesl
LuFG Informatik II
RWTH Aachen
Ahornstr. 55
52074 Aachen
Germany
E-mail:

CONFERENCE CHAIR

Hitoshi Ohsaki
National Institute of Advanced Industrial Science and Technology (AIST)
Nakoji 3-11-46
Amagasaki
Hyogo 661-0974
Japan
E-mail:

---