Higher Order Generalization

Authors:
Jianguo Lu;Masateru Harao;Masami Hagiya
Affiliations:
-;-;-
Venue:
JELIA '98 Proceedings of the European Workshop on Logics in Artificial Intelligence
Year:
1998

Citing 6
Cited 0

The calculus of constructions

Information and Computation - Semantics of Data Types
Generalization from partial parametrization in higher-order type theory

Theoretical Computer Science
Inductive logic programming

New Generation Computing - Selected papers from the international workshop on algorithmic learning theory,1990
Towards inductive generalisation in higher order logic

ML92 Proceedings of the ninth international workshop on Machine learning
Analogical program derivation based on type theory

Theoretical Computer Science
The replay of program derivations

The replay of program derivations

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.