Primitive recursive program transformation

R. S. Boyer, J. S. Moore, R. E. Shostak
1976 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages - POPL '76  
We describe how to transform certain flowchart programs into equivalent explicit primitive recursive proerams. The input/outl~Ut correctness conditions for the trar~sformed proerams are more amenable to proof thai the verification cow~ditions for the corresponding flowchart programs. In particular, the transformed correctness conditions can often be verified automatically by the theorem prover developed by Boyer and Moore [I].
doi:10.1145/800168.811550 dblp:conf/popl/BoyerMS76 fatcat:27cgkyc73vfptdwp5hqkthhxyu