Termination Preserving Problem in the Transformation of Applicative Programs

Program transformation is a promising area of software methodology.The Folding/Unfolding method proposed by Burstall/Darlington is a simple and powerful transformation method for applicative programs.The only operations used are folding and unfolding of function definitions and substitution using laws.The major drawback of this method is that only partial correctness of functions is preserved and termination may be lost. That is if function f_1 is transformed to f_n,the computation of f_n on an object x wil…