Graph Representation and Computation Rules for Typeless Recursive Languages
暂无分享，去创建一个
Computations are carried out in recursive languages by the iterative application of two kinds of transformation rules (substitution and simplification rules) to an initial term.
[1] J. M. Cadiou,et al. Recursive definitions of partial functions and their computations , 1972, Proving Assertions About Programs.
[2] Zohar Manna,et al. Inductive methods for proving properties of programs , 1973, Commun. ACM.
[3] Dana S. Scott,et al. Outline of a Mathematical Theory of Computation , 1970 .
[4] Jean Vuillemin,et al. Correct and optimal implementations of recursion in a simple programming language , 1973, J. Comput. Syst. Sci..