2003 · 18 citations · 0 references
ComputingComputer ScienceCompilersFormal MethodsProgramming LanguagesCompositional SemanticsModel TransformationRule-based RepresentationSource RulesSource TransformationsExpressive TransformationRewriting SystemsRule-based TransformationSource-to-source TranslationTransformational Semantics
We argue that adding Source-to-Source transformation (STS) to Constraint Handling Rules (CHR) is easy, desirable and elegant. The central ideas are to represent CHR programs in relational form, and the utilization of CHR proper to perform the transformations, acting upon this representation. We illustrate the power and practicality of STS for CHR on three non-trivial examples. The rst example shows the application of STS in a bootstrapping compiler for CHR. Then we extend the CHR language by probabilistic rule choice and Prolog-style clauses, respectively.