A Control Structure between Iteration and Recursion

概要

論文の詳細を見る
A "loop n P" statement generates a chain of the iteration module P with length n. The "loop" statement is extended and a new control structure "substitution", implemented by "call" statement, is introduced. A "call n P" statement generates a k-ary tree (k≧1 is a constant) with depth n of the substitution module P. The statement generates Σ^^<n-1>__<i=0> k^i occurrences of the substitution module without any dynamic change of the control variables during the execution. Time complexity of the static programs, in which the control variables are not changed during the execution, is extended to exponential function, while the time complexity of the static programs only with the loop statement is bounded by polynomial function.
東海大学の論文
1983-03-31