|Background and aims|
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.
The workshop will be held in conjunction with RTA 2002 in Copenhagen (Denmark)
on July 21, 2002. The workshop is (co-)organized by TU Valencia and TU Wien.
Previous WRS editions: WRS'2001 (Utrecht, The Netherlands).
Topics of interest include (but are not limited 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) and be sent in postscript format to the PC co-chairs
The final workshop proceedings are available as the volume 70, Issue 6 of the Electronic Notes in Theoretical Computer Science (ENTCS) series of Elsevier. Preliminary hardcopy proceedings were available at the workshop. A special issue of the Journal of Symbolic Computation on
will be designated for revised and extended versions of selected contributions from both WRS'2001 (Utrecht, May 2001) and WRS'2002.
WRS 2002 is a one-day event that provides a forum for
individual presentations of accepted and invited contributions
as well as for discussions. The technical
program includes lectures of the
following invited speakers:
Approximations for Strategies and Termination
Vincent van Oostrom
(Utrecht, The Netherlands)
Optimal Strategies in Higher-Order Rewriting
The second edition of WRS was part of the third Federated Logic Conference (FLoC'02) held in Copenhagen, Denmark, in July 2002.
|Last modified: December 17, 2002|