This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
M.S. Paterson, C.E. Hewitt, Comparative schematology. Record of Project MAC, ACM, N.Y., pp. 119–128.
S.J. Garland, D.C. Luckham, Program schemes, recursion schemes, and formal languages. UCLA-ENG-7154, University of California, Los Angeles, June 1971.
H.R. Strong, Translating recursion equations into flow-charts. Jour. Comp. Syst. Sci., v. 5 (1971), pp. 254–285.
R.L. Constable, D. Gries, On classes of program schemata. TR71-105, Computer Science Dept., Cornell University, August 1971.
A.K. Chandra, Z. Manna, Program schemas with equality. Stanford Artificial Intelligence Project MEMO AIM-158, Stanford, December, 1971.
Б.А. Трахтенброт. Табличное нредставление рекурсивных операторов. ДАН, 101(1955), стр. 417–420.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1974 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Trachtenbrot, B.A. (1974). On universal classes of program schemas. In: Ershov, A., Nepomniaschy, V. (eds) International Symposium on Theoretical Programming. Lecture Notes in Computer Science, vol 5. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-06720-5_12
Download citation
DOI: https://doi.org/10.1007/3-540-06720-5_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-06720-7
Online ISBN: 978-3-540-38012-2
eBook Packages: Springer Book Archive