Learning from Examples with Typed Equational Programming
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.
Cite
Text
Ishino and Yamamoto. "Learning from Examples with Typed Equational Programming." International Conference on Algorithmic Learning Theory, 1994. doi:10.1007/3-540-58520-6_73Markdown
[Ishino and Yamamoto. "Learning from Examples with Typed Equational Programming." International Conference on Algorithmic Learning Theory, 1994.](https://mlanthology.org/alt/1994/ishino1994alt-learning/) doi:10.1007/3-540-58520-6_73BibTeX
@inproceedings{ishino1994alt-learning,
title = {{Learning from Examples with Typed Equational Programming}},
author = {Ishino, Akira and Yamamoto, Akihiro},
booktitle = {International Conference on Algorithmic Learning Theory},
year = {1994},
pages = {301-316},
doi = {10.1007/3-540-58520-6_73},
url = {https://mlanthology.org/alt/1994/ishino1994alt-learning/}
}