A family of rules for recursion removal. (English) Zbl 0345.68011


68N01 General topics in the theory of software
68W99 Algorithms in computer science
68Q25 Analysis of algorithms and problem complexity
Full Text: DOI


[1] Hoare, C. A.R., An Axiomatic Basis for Computer Programming, Comm. ACM, 12, 583 (1969) · Zbl 0179.23105
[2] Cooper, D. C., The Equivalence of Certain Computations, Comp. J., 9, 45-52 (1966) · Zbl 0173.19005
[3] Darlington, J.; Burstall, R. M., A System which Automatically Improves Programs, Stanford. Stanford, Proc. Third Intern. Conf. on Artif. Intell., 479-485 (1973) · Zbl 0395.68017
[4] Paterson, M. S.; Hewitt, E. C., Comparative Schematology, (Record of the Project MAC Conf. on Concurrent Systems and Parallel Computation (1970), ACM: ACM New York), 119-127 · Zbl 0401.68002
[5] Strong, H. R., Translating Recursion Equations into Flow Charts, New York. New York, Proc. 2nd Annual ACM Symp. Theory of Computation. New York. New York, Proc. 2nd Annual ACM Symp. Theory of Computation, J. CSS, 5, 245-285 (1971) · Zbl 0239.68002
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.