摘要
RR变换能够把一类二重递归化为尾递归.本文给出RR变换的正确性证明,并拓广RR变换,给出一种新的递归算法等价变换模式——R^n变换.R^n变换能够把一类多分支的n重递归化为尾递归,从而直接对应于迭代结构.
Equivalent transformation RR can handle a knid of two—nested recursive algorithms.In this paper, we prove this transformation schema is correct and extend it to prresent a new equivalent transformation schema R^n, which can transform some more general multiple-branch and n-nested recursive programs to tail—recusive ones, the latter correspond directly to iterative structures.
出处
《郑州大学学报（理学版）》
CAS
1989年第2期40-44,共5页
Journal of Zhengzhou University:Natural Science Edition
关键词
等价变换
卷叠
递归算法
模式
尾递归
展开
equivalent transformation
fold
recursive algorithm
schema
tail-recursive
unfold
