Overview

The rule-based programming paradigm is characterised by the repeated, localised transformation of a data object such as a term, graph, proof, constraint store, etc. The transformations are described by rules which separate the description of the 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. Rules are used implicitly or explicitly to perform computations, e.g., in Mathematica, OBJ, ELAN, Maude or to perform deductions, e.g., by using inference rules to describe or implement a logic, theorem prover or constraint solver. Mail clients and mail servers use complex rules to help users organising their email and sorting out spam. Language implementations use bottom-up rewrite systems for code generation (as in the BURG family of tools.) Constraint-handling rules (CHRs) are used to specify and implement constraint-based algorithms and applications. Rule-based programming idioms also give rise to multi-paradigm languages like Claire.

See http://www.dcs.kcl.ac.uk/events/RULE06/ for more details.

Program

• RULE program
• RULE accepted papers
• RULE pre-proceedings

Invited Talks

• Friday, August 11th, 09:00‑10:00
  Claude Kirchner (INRIA & LORIA, Nancy, France)
  Rewriting (your) Calculus [pdf]
• Friday, August 11th, 14:00‑15:00
  Dick Kieburtz (OGI School of Science and Engineering, OHSU, Portland, Oregon)
  Programmed Strategies for Program Verification [ppt]

Further Information