Proceedings available here
The rule-based programming paradigm is characterized by the repeated, localized transformation of a shared data object such as a term, graph, proof, or constraint store. The transformations are described by rules which separate the description of the sub-object to be replaced (the pattern) from the calculation of the replacement. Optionally, rules can have further conditions that restrict their applicability. The transformations are controlled by explicit or implicit strategies.
The basic concepts of rule-based programming appear throughout computer science, from theoretical foundations to practical implementations. Term rewriting is used in semantics in order to describe the meaning of programming languages, as well as in the implementation of program transformation systems. It is used implicitly or explicitly to perform computations, e.g., in Mathematica, OBJ, or ELAN, or to perform deductions, e.g., by using inference rules to describe or implement a logic, theorem prover or constraint solver. Extreme examples of rule-based programming include the mail system in Unix which uses rules in order to rewrite mail addresses to canonical forms, or the transition rules used in model checkers.
Rule-based programming is currently experiencing a renewed period of growth with the emergence of new concepts and systems that allow a better understanding and better usability. On the theoretical side, after the in-depth study of rewriting concepts during the eighties, the nineties saw the emergence of the general concepts of rewriting logic and of the rewriting calculus. On the practical side, new languages and systems such as ASF+SDF, BURG, CHRS, Claire, ELAN, Maude, and Stratego have shown that rules are a useful programming tool.
The practical application of rule-based programming prompts research into the algorithmic complexity and optimization of rule-based programs as well as into the expressivity, semantics and implementation of rule-based languages.
The purpose of this workshop is to bring together researchers from the various communities working on rule-based programming to foster fertilisation between theory and practice, as well as to favour the growth of this programming paradigm.
The previous editions of the RULE workshop were held at Valencia (2003) during the RDP conference "Rewriting, Deduction and Programming", and Pittsburg (2002), Firenze (2001), Montreal (2000) during the PLI Conferences "Principles, Logics, and Implementations of high-level programming languages".
We solicit original papers on all topics of rule-based programming, including but not restricted to
Papers (of at most 15 pages) should be submitted electronically as
PostScript or PDF files to: rule04@loria.fr
The message should also contain a text-only abstract and author
information.
Papers should be received by March 17, 2004.
The proceedings will appear as technical report of the department of computer science of the RWTH Aachen University. The use of the style file available from the RDP workshop style page is strongly encouraged. Publication of the final proceedings in ENTCS series is anticipated.
RULE is part of the Federated
Conference on Rewriting, Deduction, and Programming (RDP)
consisting of several co-located meetings on May 31 (Monday) - June 5 (Saturday),
2004.
Slim Abdennadher, PC co-chair (German U. in Cairo, Egypt)
Mark van den Brand (CWI, The Netherlands)
Steven Eker (SRI, USA)
Tom Fruehwirth (U. Ulm, Germany)
Michael Hanus (U. Kiel, Germany)
Jan Maluszynski (U. Linkoping, Sweden)
Narciso Marti-Oliet (UCM, Spain)
Olivier Michel (U. Evry, France)
Christophe Ringeissen, PC co-chair (LORIA-INRIA, France)
Slim Abdennadher
Christophe Ringeissen
Email: rule04@loria.fr