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\u27s 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 for...
We developed a procedure to enumerate complete sets of higher-order unifiersbased on work by Jensen ...
AbstractLet E be a first-order equational theory. A translation of higher-order E-unification proble...
The higher order unification procedure as formulated by Huet [Hu 75] unifies terms in the simple the...
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...
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...
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...
. In this paper, we present several improvements of an algorithm for a higher-order unification base...
We present an algorithm for unification of higher-order patterns modulo simple syntactic equational ...
Unification is a central operation in the construction of a range of computational logic systems bas...
AbstractHigher order unification is equational unification for βη-conversion. But it is not first or...
In current implementations of higher-order logics higher-order unification is used to lift the resol...
Nominal logic is an extension of first-order logic with equality, name-binding, renaming via name-sw...
We developed a procedure to enumerate complete sets of higher-order unifiersbased on work by Jensen ...
AbstractLet E be a first-order equational theory. A translation of higher-order E-unification proble...
The higher order unification procedure as formulated by Huet [Hu 75] unifies terms in the simple the...
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...
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...
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...
. In this paper, we present several improvements of an algorithm for a higher-order unification base...
We present an algorithm for unification of higher-order patterns modulo simple syntactic equational ...
Unification is a central operation in the construction of a range of computational logic systems bas...
AbstractHigher order unification is equational unification for βη-conversion. But it is not first or...
In current implementations of higher-order logics higher-order unification is used to lift the resol...
Nominal logic is an extension of first-order logic with equality, name-binding, renaming via name-sw...
We developed a procedure to enumerate complete sets of higher-order unifiersbased on work by Jensen ...
AbstractLet E be a first-order equational theory. A translation of higher-order E-unification proble...
The higher order unification procedure as formulated by Huet [Hu 75] unifies terms in the simple the...