++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ SECOND CALL FOR PAPERS RTA 2001 12th International Conference on Rewriting Techniques and Applications Utrecht, The Netherlands May 22-24, 2001 http://www.score.is.tsukuba.ac.jp/rta2001 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ TOPICS: RTA is the major forum for the presentation of research on all aspects of rewriting. The 12th International Conference on Rewriting Techniques and Applications solicits original papers on all aspects of rewriting, including (but not limited to): * Applications: case studies; rule-based programming; symbolic and algebraic computation; theorem proving; functional and logic programming; proof checking. * Foundations: matching and unification; completion techniques; strategies; constraint solving; explicit substitutions; tree automata. * Frameworks: string, term, and graph rewriting; lambda-calculus and higher-order rewriting; conditional rewriting; proof nets; categorical and infinitary rewriting. * Implementation: compilation techniques; parallel execution; rewriting tools. * Semantics: equational logic; rewriting logic. BEST PAPER AWARD: A prize of 500 EUR will be given to the best paper as judged by the program committee. The program committee may decline to make the award or may split it among several papers. SUBMISSIONS: Submissions must be original and not submitted for publication elsewhere. Submissions should fall into one of the following categories: 1. Regular research papers describing new results; they will be judged on correctness and significance. 2. Papers describing the experience of applying rewriting techniques in other areas; they will be judged on relevance and comparison with other approaches. 3. Problem sets that provide realistic and interesting challenges in the field of rewriting. 4. System descriptions; they should contain a link to a working system and will be judged on usefulness and design. All submissions will be judged on originality. Submissions in the first three categories can be up to 15 proceedings pages long, system descriptions 4 proceedings pages. Authors are strongly encouraged to use LaTeX2e and the Springer llncs class file, available at http://www.springer.de/comp/lncs/authors.html. The title page should include the submission category. Submission is by email: Send a message consisting of a self-contained postscript file along with an ASCII version of the paper's cover page (title, authors, submission category, abstract, contact information) to rta2001@score.is.tsukuba.ac.jp Papers that are late, too long or require substantial revision will not be considered. 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). If email submission is not possible, four hard copies may be sent to Aart Middeldorp Institute of Information Sciences and Electronics University of Tsukuba Tsukuba 305-8573, Japan Submissions must arrive no later than December 4, 2000. Authors will be notified of acceptance or rejection by February 2, 2001. Final versions of accepted papers must be received by March 1, 2001. The proceedings will be published by Springer-Verlag in the LNCS series. CONFERENCE CHAIR: Vincent van Oostrom Utrecht University Vincent.vanOostrom@phil.uu.nl PROGRAM CHAIR: Aart Middeldorp University of Tsukuba rta2001@score.is.tsukuba.ac.jp PROGRAM COMMITTEE: Zena Ariola (Eugene) David Basin (Freiburg) Mariangiola Dezani (Torino) Philippe de Groote (Nancy) Ian Mackie (Palaiseau) Jose Meseguer (Menlo Park) Aart Middeldorp (Tsukuba) Robert Nieuwenhuis (Barcelona) Enno Ohlebusch (Bielefeld) Friedrich Otto (Kassel) Christine Paulin (Orsay) Sandor Vagvolgyi (Szeged) Joe Wells (Edinburgh) INVITED SPEAKERS: Arvind (MIT, Boston) "Rewriting the Rules for Chip Design" Henk Barendregt (University of Nijmegen) "Computing and Proving" IMPORTANT DATES: Submission: December 4, 2000 Notification: February 2, 2001 Final Version: March 1, 2001 RTA 2001 WEB SITE: http://www.score.is.tsukuba.ac.jp/rta2001 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++