A Termination Condition of Unfolding Loop for Generalized Partial Computation
Zhao Dong · 中国邮电高校学报：英文版 · 2001
The unfolding problem of loop has always been a difficult problem on the partial computation and Generalized Partial Computation( GPC ) of imperative language. This paper makes use of Data Flow Analysis( DFA ) technique to present an efficient termination condition of unfolding loop for partial evaluation or generalized partial evaluation, and this termination condition can solve the problem very well.