| Transformations of Reduction Systems | |||||||||||||||
Abstract | |||||||||||||||
| We consider transformations of reduction systems in an abstract setting. We study some sets of correctness criteria for such transformations, adapt a notion of simulation proposed by Kamperman and Walters, and show that the resulting !-simulation behaves well w.r.t. the criteria. We apply our results in an investigation of a transformation proposed by Thatte, and prove that this transformation preserves semicompleteness for weakly persistent systems. 1 Introduction With the emergence of the use of Reduction Systems as semantical basis of programming paradigms, the use of transformation methods for Reduction Systems is growing. Some systems are more suitable for execution on a machine than others, for instance because they have a normalizing reduction strategy that is easily decidable, or because they are in a specific format. Transformation methods are then used to translate an arbitrary system into such a suitable system. Evidently, such a transformation should not be applied if it ... | |||||||||||||||
Details der Publikation | |||||||||||||||
| |||||||||||||||