Abstract
This paper describes a knowledge-based system to synthesize functional programs of Backus' FP system [1,2] from input / output instances. Based on a theory of orthogonal expansion of programs [3,4], the task of program synthesis is expressed in program equations, and fulfilled by solving them according to the knowledge about the equivalence between programs. Examples are given in the paper.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J. Backus, Can programming be Liberated from von Neumann Style? A Functional Style and Its Algebra of Programs, CACM. 21:8 (1978) 631–641.
J. Backus, The Algebra of Functional Programs, in Formalization of Programming Concepts, J.Diaz, & I.Ramos, eds., LNCS 107, Springer-Verlag, 1981, 1–43.
Zhu Hong, A Theory of Program Expansion and Its Application to Programming, Ph.D Thesis, Nanjing University, Aug. 1987.
Zhu Hong, A Theory of Program Expansion, Scientia Sinica (Series A), 8(1988), 887–896.
U.S. Reddy,& B. Jayaraman, Theory of Linear Equations Applied to Program Transformation, Proc.8'th IJCAI, 1983, Vol.1, pp10∼16.
Zhu Hong & Jin Lingzi, A Knowledge_Based Approach to Program Synthesis from Examples, Journal of Computer Science and Technology, (in press).
Jin Lingzi, Researches on Metalanguage for Transformational Programming, Ph.D. Thesis, Nanjing University, December, 1987.
Jin Lingzi, Zhu Hong & Xu Jiafu, NDTPS — An Experimental Metalanguage Transformational Programming System, Proceedings of the International Conference on New Generation Computer Systems, April, 1989, Beijing.
Jin Lingzi & Zhu Hong, Metaprogramming — Applications to Program Synthesis from Examples, Beijing International Symposium for Young Computer Professionals, Aug. 1989. (in press).
P.D. Summers, A Methodology for LISP Program Construction from Examples, J.ACM, 24:1 (1977), 161–175.
D.R.Smith, The Synthesis of LISP Programs from Examples:A Survey, in Automatic Program Construction Techniques, A.W.Biermann, G.Guiho, & Y.Kodratoff,(eds.) Maclillan Publishing, 1984, 307–324.
Y.Kodratoff,& J-P.Jouannaud, Synthesizing LISP Programs Working On the List Level of Embedding, in Automatic Program Construction Techniques, 325–374.
A.W.Biermann, Dealing With Search, in Automatic Program Construction Techniques, 375–392.
A.W. Biermann, The inference of Regular LISP Programs from Examples, IEEE Transactions on Systems, Man, and Cybernetics, SMC-8:8(1978), 585–600.
J-P.Jouannaud, & G.Guiho, Inference of Functions with an Interactive System, in Machine Intelligence 9, D.Michie, (Ed.) Ellis Horwood, 1979, 227–250.
D. Banerjee, A Methodology for Synthesis of Recursive Functional Programs, ACM TOPLAS 9:3 (1987), 441–462.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hong, Z., Lingzi, J. (1989). A knowledge-based system to synthesize FP programs from examples. In: Martins, J.P., Morgado, E.M. (eds) EPIA 89. EPIA 1989. Lecture Notes in Computer Science, vol 390. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51665-4_89
Download citation
DOI: https://doi.org/10.1007/3-540-51665-4_89
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51665-1
Online ISBN: 978-3-540-46743-4
eBook Packages: Springer Book Archive