[three Haskell papers!] CALL FOR PARTICIPATION: RULE'02: The 2002 ACM SIGPLAN WORKSHOP ON RULE-BASED PROGRAMMING October 5, 2002 Pittsburgh, Pensylvania Co-located with PLI REGISTRATION SITE: http://www.regmaster.com/pli2002.html WORKSHOP SITE: http://www.program-transformation.org/rule02 WORKSHOP OVERVIEW: 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. INVITED TALK: * BURG, IBURG, WBURG, GBURG: So Many Trees to Rewrite, So Little Time by Todd Proebstring (Microsoft Research) CONTRIBUTED TALKS: * Design Patterns for Functional Strategic Programming by Ralf Laemmel (Vrije Universiteit) and Joost Visser (CWI) * Towards Generic Refactoring by Ralf Laemmel (CWI &Vrije Universiteit) * Simple Termination of Context-Sensitive Rewriting by Bernhard Gramlich (Technische Universitaet Wien) and Salvador Lucas (Universidad Politecnica de Valencia) * On Implementing Behavioral Rewriting Grigore Rosu by (University of Illinois at Urbana-Champaign) * Pattern-matching and Rewriting Rules for Group Indexed Data-Structure by Jean-Louis Giavitto and Olivier Michel (Universited Evry) * A Rule-Based Language for Programming Software Updates by Martin Erwig and Deling Ren (Oregon State University) * Some Prolog Macros for Rule-Based Programming: Why? How? by Tim Menzies (University of West Virgina) and Lindsay Mason (University of British Columbia) * An Asynchronous Rule-Based Approach for Business Process Automation Using Obligations by Alan Abrahams, David Eyers and Jean Bacon (University of Cambridge) PROGRAM COMMITTEE: Bernd Fischer (RIACS/NASA Ames Research Center, USA) [co-chair] Eelco Visser (Universiteit Utrecht, The Netherlands) [co-chair] Mark van den Brand (CWI & Vrije Universiteit, The Netherlands) James Cordy (Queens University at Kingston, Canada) Francois Fages (INRIA Rocquencourt, France) Thom Fruehwirth (Universitaet Ulm, Germany) Claude Kirchner (LORIA & INRIA Nancy, France) Herbert Kuchen (Universitaet Muenster, Germany) Mark Minas (Universitaet Erlangen-Nuernberg, Germany) Oege de Moor (Oxford University, UK)