Computability of Recursive Functions
Journal of the ACM (JACM)
Another recursion induction principle
Communications of the ACM
Towards a theory of semantics and compilers for programming languages
Journal of Computer and System Sciences
Some definitional suggestions for automata theory
Journal of Computer and System Sciences
Hi-index | 0.00 |
A treatment is given of a class of program transformations @S with the property that for each program P, both P and @S(P) compute the same function. Many transformations encountered in the theory of computation can be shown to be in the class and, hence, formally proved to preserve equivalence. As an example, the theory is applied to the proof of a speed up theorem in computational complexity.