Reduction strategies in rewriting and programming have attracted an increasing attention within the last years. New types of reduction strategies have been invented and investigated, and new results on rewriting / computation under particular strategies have been obtained. Research in this field ranges from primarily theoretical questions about reduction strategies to very practical application and implementation issues. The need for a deeper understanding of reduction strategies in rewriting and programming, both in theory and practice, is obvious, since they bridge the gap between unrestricted general rewriting (computation) and (more deterministic) rewriting with particular strategies (programming). Moreover, reduction strategies provide a natural way to go from operational principles (e.g., graph and term rewriting, narrowing, lambda-calculus) and semantics (e.g., normalization, computation of values, infinitary normalization, head-normalization) to implementations of programming languages.
Therefore any progress in this area is likely to be of interest not only to the rewriting community, but also to neighbouring fields like functional programming, functional-logic programming, and termination proofs of algorithms.
The workshop wants to provide a forum for the presentation and discussion of new ideas and results, recent developments, new research directions, as well as of surveys on existing knowledge in this area. Furthermore we aim at fostering interaction and exchange between researchers and students actively working on such topics.
Topics of interest include, but are not restricted to:
We solicit papers on all aspects of reduction strategies in rewriting and programming. Submissions should describe unpublished work, except for survey papers which are explicitly welcome, too. Submissions should not exceed 10 pages (however, survey papers may be longer). Please, send a message containing the title, authors, and abstract of your submission before March 30, 2003 to the PC co-chairs at
The full version of your submission should be sent in postscript
or PDF format before April 3, 2003. Submissions should include
the title, authors' names, affiliations, addresses, and e-mail.
Selection of papers by the PC will be based on originality,
significance, and correctness. Final versions will be due by
May 11, 2003.
Accepted papers will be included in the preliminary workshop proceedings that will be available at the workshop. The final proceedings will be published in the Electronic Notes in Theoretical Computer Science (ENTCS) series of Elsevier.
Invited talks will be given at WRS'03 by:
Technische Universität Wien, Austria
Universidad Politécnica de Valencia, Spain
Last update: April, 16th email@example.com