General iteration and unary functions
The paper provides a programming-oriented characterization of the class of partial recursive functions. Basically, it is shown that all p.r. functions can be obtained starting with the successor and excess-over-a- square functions by using addition, composition and a while-do iteration operator. Variants of this result, obtained by changing the arity types of functions or by substituting some of the basic operators are also proved. As a by-product, Kleene's normal form theorem is derived in a more precise and programming-oriented setting.
scientific article; zbMATH DE number 31338