Name
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. |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1007/3-540-58520-6_73 | AII/ALT |
Keywords | Field | DocType |
typed equational programming,polymorphism,functional programming,inductive inference,type system | Functional logic programming,Inductive reasoning,Algorithmic learning theory,Programming language,Programming paradigm,Functional programming,Computer science,Inductive programming,Artificial intelligence,Logic programming,Machine learning,Recursion | Conference |
ISBN | Citations | PageRank |
3-540-58520-6 | 1 | 0.39 |
References | Authors | |
5 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Akira Ishino | 1 | 54 | 7.31 |
| Akihiro Yamamoto | 2 | 95 | 11.23 |