## Unification and Anti-Unification in the Calculus of Constructions (1991)

Venue: | In Sixth Annual IEEE Symposium on Logic in Computer Science |

Citations: | 61 - 15 self |

### BibTeX

@INPROCEEDINGS{Pfenning91unificationand,

author = {Frank Pfenning},

title = {Unification and Anti-Unification in the Calculus of Constructions},

booktitle = {In Sixth Annual IEEE Symposium on Logic in Computer Science},

year = {1991},

pages = {74--85}

}

### Years of Citing Articles

### OpenURL

### Abstract

We present algorithms for unification and antiunification in the Calculus of Constructions, where occurrences of free variables (the variables subject to instantiation) are restricted to higher-order patterns, a notion investigated for the simply-typed -calculus by Miller. Most general unifiers and least common antiinstances are shown to exist and are unique up to a simple equivalence. The unification algorithm is used for logic program execution and type and term reconstruction in the current implementation of Elf and has shown itself to be practical. The main application of the anti-unification algorithm we have in mind is that of proof generalization. 1 Introduction Higher-order logic with an embedded simply-typed - calculus has been used as the basis for a number of theorem provers (for example [1, 19]) and the programming language Prolog [16]. Central to these systems is an implementation of Huet's pre-unification algorithm for the simply-typed -calculus [12] which has shown it...