Program Schemas with Stacks

Abstract

We have seen so far how the programming language r P ^σ can be augmented with new computational devices by the use of extension. From the viewpoint of computational power, as in Chapter 5, it is sufficient to augment the language r P ^σ with stacks. Therefore, for the theory it is sufficient to use the stack extension of r P ^σ. However, the way the extension has been made does not limit the number of new devi ces usable in the programs. For example, according to Definition (5.1) infinitely many counters or stacks are allowed in the appropriate extension of r P ^σ.