Unity和Gamma之间的程序变换:一个实例研究

PROGRAM TRANSFORMATION BETWEEN GAMMA AND UNITY: A CASE STUDY

Ｇａｍｍａ和Ｕｎｉｔｙ都是面向问题描述的编程模型。本文中我们提出了一种从Ｕｎｉｔｙ到Ｇａｍｍａ的语义等价的程序变换方法，进而我们证明，Ｇａｍｍａ比相应的Ｕｎｉｔｙ有更强的表达能力。同时，也提出了逆转换方法。把这些方法运用到排序问题中的实验结果表明，用转换机制以及把Ｕｎｉｔｙ作为Ｇａｍｍａ的实现层来编写有效的程序是一种可行的方法。

Both Gamma and Unity are programming models catering to problem description. In this paper, a method of semantically equivalent program transformation from Unity to Gamma is proposed, thus we proves that the expressivity of Gamma is more powerful than that of Unity. The reverse transformation method is also proposed. These methods are applied to a sorting problem and the experimental results suggests that it is a feasible way to form an efficient program by using the transformational approach and regarding Unity as an implementation level of Gamma.