Abstract
In this paper we present a constructive method of learning from examples using typed equational programming. The main contribution is a concept of type maintenance which appears to be theoretically and practically useful. Type maintenance is based on polymorphic types and is not applicable to a type system without polymorphism. Because equational programming possesses good properties of both functional programming and logic programming, we will refine results in inductive inference of logic programs and that of functions. Our learning method is based on the type maintenance, the generalization given by Plotkin and Arimura et al. and the technique finding recursion given by Summers.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
H. Arimura, H. Ishizaka, T. Shinohara, and S. Otsuki. A Generalization of the Least Generalization. Machine Intelligence 13. December 1992.
A. W. Biermann. The inference of regular lisp programs from examples. IEEE Transaction on System, Man and Cybernetics, 8(8):585–600, 1978.
A. W. Biermann. A production rule mechanism for generating lisp code. IEEE Transaction on System, Man and Cybernetics, 5(9):260–276, 1979.
S. Hölldobler. Foundations of Equational Logic Programming. Lecture Notes in Artifical Intelligence 353. Springer-Verlag, 1989.
P. Hudak, S. P. Jones, and P. Wadler (editors). Report on the programming language haskell, a non-strict purely functional language (version 1.2). ACM SIG-PLAN Notices, 21 (12):37–79, December 1986.
C. D. Page Jr. and A. M. Frisch. Generalization and Learnability: A Study of Constrained Atoms, chapter 2, pages 29–61. Inductive Logic Programming. Academic Press Inc., 1992.
J-L. Lassez, M.J. Maher, and K. Marriott. Unification Revisited, chapter 15, pages 587–625. Foundations of Deductive Databases and Logic Programming. Morgan Kaufmann Publishers, 1987.
C. X. Ling. Learning and invention of horn clause theories. Methodologies for Intelligent Systems, 4:323–331, 1989.
C. X. Ling and L. Ungar. Inventing theoretical terms in inductive learning of functions. Methodologies for Intelligent Systems, 4:332–341, 1989.
R. Milner. A theory of type polymorphism in programming. Journal of Computer and System Sciences, 17:348–375, 1978.
R. Milner and M. Tofte. Commentary on Standard ML. The MIT Press, 1991.
R. Milner, M. Tofte, and R. Harper. The Definition of Standard ML. The MIT Press, 1990.
S. Muggleton, editor. Inductive Logic Programming. Academic Press Inc., 1992.
M. J. O'Donnell. Computing in Systems Described by Equations. Lecture Notes in Computer Science 58. Springer-Verlag, 1977.
G. D. Plotkin. A Note on Inductive Generalization, chapter 8, pages 153–163. Machine Intelligence 5. December 1969.
E. Y. Shapiro. Algorithmic Program Debugging. MIT Press, 1983.
P. D. Summers. Program construction from examples. Technical Report RC-5637, IBM Res., 1975.
P. D. Summers. A methodology for lisp program construction from examples. JACM, 24:161–175, 1977.
A. Togashi. Inductive inference of term rewriting systems realizing algebras. In In Proc. ALT '90, pages 411–424. JSAI, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ishino, A., Yamamoto, A. (1994). Learning from examples with typed equational programming. In: Arikawa, S., Jantke, K.P. (eds) Algorithmic Learning Theory. AII ALT 1994 1994. Lecture Notes in Computer Science, vol 872. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58520-6_73
Download citation
DOI: https://doi.org/10.1007/3-540-58520-6_73
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58520-6
Online ISBN: 978-3-540-49030-2
eBook Packages: Springer Book Archive