 |
2002 ACM SIGPLANWorkshop on Rule-Based ProgrammingWorkshop ProgramSatellite event of PLI'02
Saturday, October 5, 2002 http://www.program-transformation.org/Transform/WorkshopOnRuleBasedProgramming
|
|
Program of the 2002 ACM SIGPLAN Workshop on Rule Based Programming (RULE'02)
October 5, 2002, Pittsburgh, Pensylvania, USA.
| Time | Title | Authors |
|---|---|---|
| 10:30 | Design Patterns for Functional Strategic Programming | Ralf Laemmel (Vrije Universiteit) and Joost Visser (CWI) |
| 11:00 | Towards Generic Refactoring | Ralf Laemmel (CWI &Vrije Universiteit) |
| 11:30 | Simple Termination of Context-Sensitive Rewriting | Bernhard Gramlich (Technische Universitaet Wien) and Salvador Lucas (Universidad Politecnica de Valencia) |
| 12:00 | On Implementing Behavioral Rewriting | Grigore Rosu (University of Illinois at Urbana-Champaign) |
| 12:30 | lunch | |
| 14:00 | BURG, IBURG, WBURG, GBURG: So Many Trees to Rewrite, So Little Time (Invited Talk) | Todd Proebsting (Microsoft Research) |
| 15:00 | Pattern-matching and Rewriting Rules for Group Indexed Data-Structure | Jean-Louis Giavitto and Olivier Michel (Universited Evry) |
| 15:30 | Tea break | |
| 16:00 | A Rule-Based Language for Programming Software Updates | Martin Erwig and Deling Ren (Oregon State University) |
| 16:30 | Some Prolog Macros for Rule-Based Programming: Why? How? | Tim Menzies (University of West Virgina) and Lindsay Mason (University of British Columbia) |
| 17:00 | An Asynchronous Rule-Based Approach for Business Process Automation Using Obligations | Alan Abrahams, David Eyers and Jean Bacon (University of Cambridge) |
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 such as ASM, ASF+SDF, BURG, Claire, ELAN, Maude, and Stratego, new systems such as LRR and commercial products such as Ilog Rules and Eclipse 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 rules-based languages. Here, a particular focus is the use and specific ation of strategies as a high-level control flow concept for the application of the rules.
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.
We solicit original papers on all topics of rule-based programming, including but not restricted to
Papers should not exceed 12 pages in length, including figures, references, and appendices; authors should use at least a 10pt style. Accepted papers will be published by ACM and will become part of the ACM Digital Library.
For submission, a single self-contained .ps-file or .pdf-file should be emailed to the program co-chairs
no later than June 10, 2002. Please send a short email with title and abstract to the program co-chairs no later than June 3, 2002, the original deadline. Please make sure the files print on standard printers - garbled submissions will not be reviewed!
RULE 2002 is part of a federation of colloquia known as Principles, Logics and Implementations of high-level programming languages (PLI 2002) which includes the ACM SIGPLAN International Conference on Functional Programming (ICFP 2002) and the first ACM SIGPLAN Conference on Generators and Components (GCSE/SAIG'02) . The colloquia and affiliated workshops will run from October 4 to October 8, 2002 and will be held in Pittsburgh, USA. Details about the affiliated conferences and workshops will appear at the URL http://pli2002.cs.brown.edu/.
The call for papers is also available in PostScript and PDF.