Workshop on Reduction Strategies in Rewriting and Programming
April 22, 2005 Nara, Japan
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.
Information on the previous, and forthcoming, WRS editions is available from the WRS permanent homepage.
|February 14, 2005||Deadline for electronic submission of papers|
|March 7, 2005||Notification of acceptance of papers|
|March 28, 2005||Deadline for final versions of accepted papers|
|April 22, 2005||Conference|
TOPICSTopics of interest include, but are not restricted 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
SUBMISSIONS and CALL FOR PAPERS
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 your submission in postscript or PDF format before February 14, 2005 to the PC co-chairs at
PROCEEDINGSAccepted papers will be included in the preliminary workshop proceedings that will be available at the workshop. A selection of the submitted papers may appear in the Electronic Notes in Theoretical Computer Science (ENTCS) series of Elsevier.
Kokichi Futatsugi JAIST Japan Hongwei Xi Boston USA
- Sergio Antoy (Portland)
- Eduardo Bonelli (Stevens)
- Roberto Di Cosmo (Paris 7, Co-Chair)
- Bernhard Gramlich (Wien)
- Stefano Guerrini (Roma)
- Salvador Lucas (Valencia)
- Aart Middeldorp (Innsbruck)
Toyama (Tohoku, Co-Chair)
Roberto Di Cosmo
Laboratoire PPS - Universite Paris 7, France
Tohoku University, Japan
- Call for papers in Text, PostScript and PDF format
- WRS permanent website: http://www.dsic.upv.es/~wrs
- WRS 2005 e-mail address: email@example.com
- RDP 2005 website: http://www.kurims.kyoto-u.ac.jp/rdp05/