Primitive recursive program transformation


arbitrary flowchart programs by introducing a new recursive function for each tag point. In the above example, one obtains: int = int1, p..... 1 h ), w...., y2r )_.



    Upload a copy of this work     Papers currently archived: 93,098

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

Similar books and articles

Inhomogeneity of the p-s-Degrees of Recursive Functions.Asae Mochizuki & Juichi Shinoda - 2000 - Mathematical Logic Quarterly 46 (3):385-392.
Possible degrees in recursive copies II.C. J. Ash & J. F. Knight - 1997 - Annals of Pure and Applied Logic 87 (2):151-165.
Inseparability in recursive copies.Kevin J. Davey - 1994 - Annals of Pure and Applied Logic 68 (1):1-52.


Added to PP

170 (#117,992)

6 months
6 (#587,658)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references