WRS 2002

Second International Workshop on Reduction Strategies in Rewriting and Programming
Copenhagen, Denmark, July 21st, 2002
Affiliated with RTA 2002

Future link: WRS'03 is at http://www.dsic.upv.es/~rdp03/wrs/.
WRS 2002 has its own website at http://www.dsic.upv.es/users/elp/WRS2002, where the call for papers and updates to the information summarized below can be found.

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.

Previous WRS editions: WRS'2001 (Utrecht, The Netherlands).

Topics of Interest

Topics of interest include (but are not limited to):
  • theoretical foundations for the definition and semantic description of reduction strategies
  • strategies in different frameworks (term rewriting, graph rewriting, infinitary rewriting, lambda calculi, higher order rewriting and explicit substitutions, conditional rewriting, rewriting with built-ins, narrowing, constraint solving, etc.) and their application in (equational, functional, functional-logic) programming (languages)
  • properties of reduction strategies / computations under strategies (e.g., completeness, computability, decidability, complexity, optimality, (hyper-)normalization, cofinality, fairness, perpetuality, context-freeness, neededness, laziness, eagerness, strictness)
  • interrelations, combinations and applications of reduction under different strategies (e.g., equivalence conditions for fundamental properties like termination and confluence, applications in modularity analysis, connections between strategies of different frameworks, etc.)
  • program analysis and other semantics-based optimization techniques dealing with reduction strategies
  • rewrite systems / tools / implementations with flexible / programmable strategies as essential concept / ingredient
  • specification of reduction strategies in (real) languages
  • data structures and implementation techniques for reduction strategies


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

before April 25, 2002. A preliminary submission including the title, abstract, authors' names, affiliations, addresses, and e-mail should be sent (as pure text) before April 21, 2002. Selection of papers by the PC will be based on originality, significance, and correctness. Accepted papers will be included in the workshop proceedings that will be available at the workshop, and electronically on the web. Final versions will be due by June 17, 2002.


The final workshop proceedings will be published in the Electronic Notes in Theoretical Computer Science (ENTCS) series of Elsevier. Preliminary hardcopy proceedings will be available at the workshop. A special issue of the Journal of Symbolic Computation on

Reduction Strategies in Rewriting and Programming

will be designated for revised and extended versions of selected contributions from both WRS'2001 (Utrecht, May 2001) and WRS'2002.

Invited speakers

Program Committee