论Folding/Unfolding程序转换的能力

ON THE ABILITY OF FOLDING/UNFOLDING TRANSFORMATION

本文讨论Burstall与Darlington提出的folding/unfolding系统的程序转换能力,即讨论从一个给定的程序可以推导出什么样的程序。因此,这是正确性与完备性问题的推广。本文证明了可推导性的一个必要条件,并由此得到了该系统提高程序效率的一个界限。该系统的部分正确性和不完备性也均是该条件的推论。

This paper discusses the transformation ability of Burstall and Darlington's folding/unfolding system, i.e. what kind of programs can be derived from a given one. It is a generalization of the problems of correctness and completeness. Tn the paper, we proved a necessary condition of transformability, and got a bound of efficiency improvable by transformation. The partial correctness and incompleteness of the system are corollaries of the condition.