Abstract
Practical methods for linear, branching and recursive program synthesis are used for synthesizing parts of programs in a programming system. The methods are based on procedural representation of relations in problem descriptions.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Manna Z., Waldinger H.J., Towards automatic program synthesis, Comm. ACM, vol.14, No.3, 1971.
Kahro M., Mannisalu M., Saan Z., Tyugu E., A programming system-PRIZ, Programming, vol.2, No.1, 1976.
Tyugu E.H., Solving problems on calculating models, J.Computational Mathematics and Mathematical Physics, No.5, 1970.
Männisalu M.A., Tyugu E.H., A problem description language UTCPIST, Control systems and computers, No.1, 1974.
Grigorenko V.P., Männisalu M.A., Rebane L.A., Application program package in mathematical statistics, Tallinn, 1975.
Tyugu E.H., Program package and source language for cutting conditions problems, Computer Languages for Numerical Control, North-Holland Publishing Company, Amsterdam, 1973.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Tyugu, E.H. (1977). A programming system with automatic program synthesis. In: Ershov, A., Koster, C.H.A. (eds) Methods of Algorithmic Language Implementation. Lecture Notes in Computer Science, vol 47. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08065-1_16
Download citation
DOI: https://doi.org/10.1007/3-540-08065-1_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08065-7
Online ISBN: 978-3-540-37510-4
eBook Packages: Springer Book Archive