| Masami Hagiya. Generalization from partial parameterization in higher-order type theory. Theoretical Computer Science, 63:113--139, 1989. |
....operations on proofs is that of generalization: we abstract away from the particulars of a proof to obtain a more general one. Generalization from one proof (or explanation based generalization, in the terminology of the Artificial Intelligence literature) has been investigated by Hagiya [9] in the setting of type theory, and by Dietzen and the author in setting of Prolog [4] Our extension to the Calculus of Constructions yields an algorithm for finding the least general generalization (or anti unifier) of two proofs, which may be a more general proof schema. The restriction to ....
Masami Hagiya. Generalization from partial parameterization in higher-order type theory. Theoretical Computer Science, 63:113--139, 1989.
No context found.
Masami Hagiya. Generalization from partial parameterization in higher-order type theory. Theoretical Computer Science, 63:113--139, 1989.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC