Abstract
Here we propose a program synthetising method. The method starts from a specially formed output condition written in predicate calculus, and it builds a correct program by simple rules. We think the idea might be developed to practical procedures.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Gergely,T., Ury,L.: Mathematical theories of programming (in preparation)
Schoenfiled,J.R.: Mathematical logic Reading, Addison — Wesley, 1967
Manna,Z.: Mathematical theory of computation McGraw-Hill, 1974
Gergely,T., Szőts,M.: Logical foundation of problem solving Proc. II. IMAI, Plenum P.O. (in preparation)
Manna,Z., Waldinger,R.,J.: Towards Automatic Program Synthesis C.ACM Vol: 14, No.3 1971
Gergely T., Vershinin,K.P.: Concept sensitive formal language for task specification. Mathematical Logic in Computer Science North Holland 1981
Kowalsky,R.: Algorithm = Logic + Control C.ACM Vol.22, no 7, 1979
Kowalsky,R.: Predicate Logic as a Programming Language Proc. IFIP Congress' 74 North Holland, 1974
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1982 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Szőts, M., Csizmazia, S. (1982). A method for program synthesis. In: Dezani-Ciancaglini, M., Montanari, U. (eds) International Symposium on Programming. Programming 1982. Lecture Notes in Computer Science, vol 137. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-11494-7_24
Download citation
DOI: https://doi.org/10.1007/3-540-11494-7_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11494-9
Online ISBN: 978-3-540-39184-5
eBook Packages: Springer Book Archive