On Representation of Sequential and Parallel Functions
暂无分享,去创建一个
The class of monotonic (in the sense of Scott [3]) functions is divided into subclasses of sequential and parallel ones and the problem of comparative power of different sequential and parallel functions with respect to composition (theorems 1–5) and recursion (theorem 6) is then investigated. In particular, theorem 6 answers the question of D.Scott [4] concerning the power of his Logic for Computable Functions.
[1] Dana S. Scott,et al. Outline of a Mathematical Theory of Computation , 1970 .
[2] J. Vuillemin. Proof techniques for recursive programs , 1973 .
[3] Zohar Manna,et al. Inductive methods for proving properties of programs , 1973, Commun. ACM.