In this paper, we reexamine the problem of general higher-order unification and develop an approach based on the method of transformations on systems of terms which has its roots in Herbrand's thesis, and which was developed by Martelli and Montanari in the context of first-order unification. This method provides an abstract and mathematically elegant means of analyzing the invariant properties of unification in various settings by providing a clean separation of the logical issues from the specification of procedural information. Our major contribution is three-fold. First, we have extended the Herbrand-Martelli-Montanari method of transformations on systems to higher-order unification and pre-unification; second, we have used this formali...
. In this paper, we present several improvements of an algorithm for a higher-order unification base...
This paper studies unification for order-sorted equational logic. This logic generalizes unsorted eq...
We developed a procedure to enumerate complete sets of higher-order unifiersbased on work by Jensen ...
In this paper, we reexamine the problem of general higher-order unification and develop an approach ...
In this paper, we reexamine the problem of general higher-order unification and develop an approach ...
In this monograph we study two generalizations of standard unification, E-unification and higher-ord...
Unification is a central operation in the construction of a range of computational logic systems bas...
Polymorphic higher-order unification is a method for unifying terms in the poly\-mor\-phi\-cally typ...
International audienceAbstract Unification is a central operation in constructing a range of computa...
AbstractHigher order unification is equational unification for βη-conversion. But it is not first or...
International audienceUnification is a central operation in the construction of a range of computati...
This paper describes a procedure for unification in extensional higher order logics. The procedure i...
AbstractWe compare two different styles of Higher-Order Unification (HOU): the classical HOU algorit...
AbstractLet E be a first-order equational theory. A translation of higher-order E-unification proble...
AbstractWe present an algorithm for unification in the simply typed lambda calculus which enumerates...
. In this paper, we present several improvements of an algorithm for a higher-order unification base...
This paper studies unification for order-sorted equational logic. This logic generalizes unsorted eq...
We developed a procedure to enumerate complete sets of higher-order unifiersbased on work by Jensen ...
In this paper, we reexamine the problem of general higher-order unification and develop an approach ...
In this paper, we reexamine the problem of general higher-order unification and develop an approach ...
In this monograph we study two generalizations of standard unification, E-unification and higher-ord...
Unification is a central operation in the construction of a range of computational logic systems bas...
Polymorphic higher-order unification is a method for unifying terms in the poly\-mor\-phi\-cally typ...
International audienceAbstract Unification is a central operation in constructing a range of computa...
AbstractHigher order unification is equational unification for βη-conversion. But it is not first or...
International audienceUnification is a central operation in the construction of a range of computati...
This paper describes a procedure for unification in extensional higher order logics. The procedure i...
AbstractWe compare two different styles of Higher-Order Unification (HOU): the classical HOU algorit...
AbstractLet E be a first-order equational theory. A translation of higher-order E-unification proble...
AbstractWe present an algorithm for unification in the simply typed lambda calculus which enumerates...
. In this paper, we present several improvements of an algorithm for a higher-order unification base...
This paper studies unification for order-sorted equational logic. This logic generalizes unsorted eq...
We developed a procedure to enumerate complete sets of higher-order unifiersbased on work by Jensen ...