Abstract
In this paper we investigate generalization methods in typed equational programming and apply them to inductive inference of functions. We are interested in inducing programs from given examples which are input-output pairs. Our main contribution is a new generalization algorithm which uses type polymorphism. With the algorithm we introduce, for the first time, a generalization phase to Summers’ method. Moreover, we present a new bottom-up inference method which combines elements of the generalization algorithm, a minimal multiple generalization algorithm, and Summers’ method. This integration is enabled with the adaptation of equational programming.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Arimura, H., Ishizaka, H., Shinohara, T., and Otsuki, S., “A Generalization of the Least Generalization,” inMachine Intelligence, 13, Oxford University Press, pp. 59–85, 1992.
Biermann, A. W., “The Inference of Regular Lisp Programs from Examples,”IEEE Transactions on Systems, Man and Cybernetics 8, 8, pp. 585–600, 1978.
Biermann, A. W., “A Production Rule Mechanism for Generating Lisp Code,”IEEE Transactions on Systems, Man and Cybernetics, 5 9, pp. 260–276, 1979.
Hölldobler, S.,“Foundations of Equational Logic Programming,” Lecture Notes in Artificial Intelligence, 353, Springer-Verlag, 1989.
Hudak, P., Jones, S. P., Wadler, P. et al., “Report on the Programming Language Haskell, A Non-strict Purely Functional Language (Version 1.2),”ACM SIGPLAN Notices, 21, pp 37–79, 1986.
Ishino, A. and Yamamoto, A., “Learning from Examples with Typed Equational Programming,” inAlgorithmic Learning Theory: Proceedings of the 4th International Workshop on Analogical and Inductive Inference and 5th International Workshop on Algorithmic Learning Theory (Arikawa, S. and Jantke, K. P., ed.),Lecture Notes in Artificial Intelligence, 872, pp. 301–316, 1994.
Lakshman, T. K. and Reddy, U. S., “Typed Prolog: A Semantic Reconstruction of the Mycroft-O’Keefe Type System,” inLogic Programming: Proceedings of the 1991 International Symposium (Sarawat, V. and Ueda, K., ed.), MIT Press, pp. 202–217, 1991.
Lassez, J.-L., Maher, M., and Marriott, K., “Unification Revisited,”Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann Publishers, pp. 587–625, 1987.
Ling, C. X., “Learning and Invention of Horn Clause Theories,” inMethodologies for Intelligent Systems, 4 (Zbigniew W. Ras, ed.), Elsevier Science Publishing, North-Holland, pp. 323–331, 1989.
Ling, C. X. and Ungar, L., “Inventing Theoretical Terms in Inductive Learning of Functions,” inMethodologies for Intelligent Systems, 4 (Zbigniew W. Ras, ed.), Elsevier Science Publishing, North-Holland, pp. 332–341, 1989.
Milner, R., “A Theory of Type Polymorphism in Programming,”Journal of Computer and System Sciences, 17, pp. 348–375, 1978.
Milner, R., Tofte, M., and Harper, R.,The Definition of Standard ML, MIT Press, 1990.
Milner, R. and Tofte, M.,Commentary Standard ML MIT Press, 1991.
Muggleton, S., ed.,Inductive Logic Programming, Academic Press, 1992.
O’Donnell, M. J., “Computing in Systems Described by Equations,”Lecture Notes in Computer Science, 58, Springer-Verlag, 1977.
Page Jr., C. D. and Frisch, A. M., “Generalization and Learnability: A Study of Constrained Atoms,” inInductive Logic Programming, Academic Press, pp. 29–61, 1992.
Plotkin, G. D., “A Note on Inductive Generalization,”Machine Intelligence, 5, pp. 153–163, 1969.
Shapiro, E. Y.,Algorithmic Program Debugging, MIT Press, 1983.
Shapiro, E. Y., “Inductive Inference of Theories from Facts,”Research Report 192, Department of Computer Science, Yale University, 1981. Reprinted inCompuational Logic (Lassez, J.-L. and Plotkin, G., ed.), MIT Press, pp. 199–254, 1991.
Summers, P. D., “Program Construction from Examples,”Technical Report, RC-5637, IBM Res., 1975.
Summers, P. D., “A Methodology for Lisp Program Construction from Examples,”JACM, 24, pp. 161–175, 1977.
Togashi, A. and Noguchi, S., “Inductive Inference of Term Rewriting Systems Realizing Algebras,” inProceedings of the First International Workshop on Algorithmic Learning Theory (Arikawa, S., Goto, S., Ohsuga, S., and Yokomori, T., ed.), Japanese Society for Artificial Intelligence, pp. 411–424, 1990.
Author information
Authors and Affiliations
Additional information
Akira Ishino: He received the B. E. and M. E. degrees from Hokkaido University in 1993 and 1995, respectively. He is now a student in the doctor course of the same university. His research interest in machine learning include automatic programming for recursive programs founded on equational programming and type systems.
Akihiro Yamamoto: He is an Associate Professor of Division of Electronics and Information Engineering at Hokkaido University. He received the B. S. degree from Kyoto University in 1985, and the M. S. and Dr. Sci. degrees from Kyusyu University in 1987 and 1990, respectively. His present interests include unification theory, types in logic programming, and their application to inductive inference. He is now a guest researcher of Computer Science Department at Technical University Darmstadt, Germany.
About this article
Cite this article
Ishino, A., Yamamoto, A. Generalizations in type equational programming and their application to learning functions. New Gener Comput 15, 85–103 (1997). https://doi.org/10.1007/BF03037561
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF03037561