Papers & awards
Submissions (closed)
Submissions must be original and not submitted for publication
elsewhere. Submissions should fall into one of the following
categories:
- Regular research papers describing new results; they will be judged on correctness and significance.
- Papers describing the experience of applying rewriting techniques in other areas; they will be judged on relevance and comparison with other approaches.
- Problem sets that provide realistic and interesting challenges in the field of rewriting.
- 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.
The latter can be obtained from http://www.springer.de/comp/lncs/authors.html.
The title page should include the submission category number.
Submission is by email: Send a self-contained postscript file 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 the program chair.
Submissions must reach the program chair no later than December 18, 2000.
In addition, an ASCII version of the paper's cover page (title, authors, abstract, contact information) must reach the program chair by December 11, 2000.
Publication
Final versions of accepted papers must be received by March 2, 2001. The proceedings of RTA 2001 will be published by Springer-Verlag in the LNCS series.
One author of each accepted paper will be expected to present it at the conference.
The following papers have been accepted by the RTA Committee:
-
Normal Form for Church-Rosser Language Systems (Best paper award)
Jens R. Woinowski
-
Verifying Ground Orientability of Rewrite Rules by the Knuth-Bendix Ordering
Konstantin Korovin, Andrei Voronkov
-
A Formalised First-Order Confluence Proof for the Lambda-Calculus using One-Sorted Variable Names
(Barendregt was right after all ... almost)
RenÈ Vestergaard, James Brotherston
-
Matching with Free Function Symbols - A Simple Extension of Matching?
Christophe Ringeissen
-
Universal Interaction Systems with Only Two Agents
Denis Bechet
-
Termination Proofs by Context-Dependent Interpretations
Dieter Hofbauer
-
Context Unification and Traversal Equations
Jordi Levy, Mateu Villaret
-
Parallel Evaluation of Interaction Nets with MPINE (system description)
Jorge Sousa Pinto
-
Dependency Pairs for Equational Rewriting
J¸rgen Giesl, Deepak Kapur
-
On the Parallel Complexity of Tree Automata
Markus Lohrey
-
Deriving Focuses Calculi for Transitive Relations
Georg Struth
-
From Higher-Order Rewriting to First-Order Rewriting
Eduardo Bonelli, Delia Kesner, Alejandro RÌos
-
Combining Pattern E-Unification Algorithms
Alexandre Boudet, Evelyne Contejean
-
Weakly Regular Relations and Applications
SÈbastien Limet, Pierre RÈty, Helmut Seidl
-
Relating Accumulative and Non-Accumulative Functional Programs
Armin K¸hnemann, Robert Gl¸ck, Kazuhiko Kakehi
-
Beta Reduction Constraints
Manuel Bodirsky, Katrin Erk, Alexander Koller, Joachim Niehren
-
Uniform Normalisation beyond Orthogonality
Zurab Khasidashvili, Mizuhito Ogawa, Vincent van Oostrom
-
Stratego: A Language for Program Transformation based on Rewriting Strategies (system description)
Eelco Visser
-
General Recursion on Higher-Order Term Algebras
Alessandro Berarducci, Corrado B–hm
-
The Unification Problem for Confluent Right-Ground Term Rewriting Systems
Michio Oyamaguchi, Yoshikatsu Ohta
-
Matching Power
Horatiu Cirstea, Claude Kirchner, Luigi Liquori
-
On Termination of Higher-Order Rewriting
Femke van Raamsdonk
-
Confluence and Termination of Simply Typed Term Rewriting Systems
Toshiyuki Yamada
-
Goal-Directed E-Unification
Christopher Lynch, Barbara Morawska
-
Transfinite Rewriting Semantics for Term Rewriting Systems
Salvador Lucas