This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
5. References
Barron, D.W.; Recursive Techniques in Programming, Macdonald, London (1975)
Darlington, J.; Burstall, R.M.; A System Which Automatically Improves Programs, Acta Informatica 6, 41–60 (1976)
Burstall, R.M.; Darlington, J.; A Transformation System For Developing Recursive Programs, JACM 24, 44–67 (1977)
Irlik, J.; Translating Some Recursive Procedures Into Iterative Schemes, Proc. 2nd Symposium on Programming, Paris 1976
Irlik, J.; Constructing Iterative Version of a System of Recursive Procedures, MFCS'76, Gdansk, Lecture Notes in Comp.Sci. Springer V. No.45 (1976)
Hoare, C.A.R.; An Axiomatic Basis For Computer Programming, CACM 12, No.10, (1969).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1978 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Irlik, J. (1978). Transforming recursion equations to algorithms. In: Winkowski, J. (eds) Mathematical Foundations of Computer Science 1978. MFCS 1978. Lecture Notes in Computer Science, vol 64. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08921-7_75
Download citation
DOI: https://doi.org/10.1007/3-540-08921-7_75
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08921-6
Online ISBN: 978-3-540-35757-5
eBook Packages: Springer Book Archive