Generalization is a fundamental operation of inductive inference. While first order syntactic generalization (anti-unification) is well understood, its various extensions are needed in applications. This paper discusses syntactic higher order generalization in a higher order language λ2[1]. Based on the application ordering, we proved the least general generalization exists and is unique up to renaming. An algorithm to compute the least general generalization is presented.
CITATION STYLE
Lu, J., Harao, M., & Hagiya, M. (1998). Higher order generalization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1489, pp. 368–381). Springer Verlag. https://doi.org/10.1007/3-540-49545-2_25
Mendeley helps you to discover research relevant for your work.