RTA 2002 **** EXTENDED DEADLINE****
In response to multiple requests, the program committee of RTA 2002
has decided to extend the submission deadline until
27th January
Authors are expected to submit a title and abstract by 15th January.
***************************************************************************
RTA 2002 - Call for Papers
The 13th International Conference on Rewriting Techniques and Applications
RTA'02 will take place from July 22, 2002 to July 24, 2002 in Copenhagen,
Denmark, as part of the Federated Logic Conference FLoC'02.
Topics
RTA is the major forum for the presentation of research on all aspects of
rewriting. Typical areas include (but are 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.
* Frameworks: string, term, and graph rewriting; lambda-calculus and
higher-order rewriting; conditional rewriting; proof nets; constrained
rewriting and deduction; 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. 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 to the submission or via the Web). Submission is by email: Send
a self-contained postscript file to
<[EMAIL PROTECTED]>
Proceedings
Accepted papers will be published in the proceedings of the symposium
(Lecture Notes in Computer Science, Springer-Verlag). Simultaneous
submission to other conferences with published proceedings is not allowed.
Important dates
* Sun January 27, 2002 - extended deadline for paper submission
* Fri March 22, 2002 - author notification
* Thu April 25, 2002 - camera-ready papers due
Program Committee
* chair: Sophie Tison <[EMAIL PROTECTED]>
LIFL - Laboratoire d'Informatique Fondamentale de Lille
URA CNRS 369
Universit=E9 de Lille 1
Cité Scientifique --- Bat. M3
59655 Villeneuve d'Ascq cedex, FRANCE
+33 03 20 43 43 09
+33 03 20 43 47 24 (secretary)
+33 03 20 43 45 66 (fax)
* Andrea Corradini <[EMAIL PROTECTED]>, Pisa
* Daniel J. Dougherty <[EMAIL PROTECTED]>, Wesleyan
* Jürgen Giesl <[EMAIL PROTECTED]>, Aachen U of Technology
* Bernhard Gramlich <[EMAIL PROTECTED]>, Vienna U of Technology
* Thérèse Hardin <[EMAIL PROTECTED]>, Paris VI
* Christopher Lynch <[EMAIL PROTECTED]>, Clarkson
* Jerzy Marcinkowski <[EMAIL PROTECTED]>, Wroclaw
* Aart Middeldorp <[EMAIL PROTECTED]>, Tsukuba
* Joachim Niehren <[EMAIL PROTECTED]>, Saarland
* Femke van Raamsdonk <[EMAIL PROTECTED]>, Vrije U of Amsterdam
* Albert Rubio <[EMAIL PROTECTED]>, Technical U of Catalonia
* Ralf Treinen <[EMAIL PROTECTED]>, Paris-Sud
_______________________________________________
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
