Add to ORKGThis paper describes a procedure for unification in extensional higher order logics. The procedure is due to Gerard Huet and was described in /Hu75/. In this paper we consider unification in extensional theories' which is a significantly simpler problem and is not described in detail in Huet's paper. In addition, the description here focuses on computation of substitutions rather than deciding inifiability, as in Huet's paper. To this some explanatory and clarifying material has been added
We develop an efficient representation and a pre-unification algorithm in the style of Huet for the ...
We give a first-order presentation of higher-order logic based on explicit substitutions. This prese...
This techreport presents two approaches to primitive equality treatment in higher-order (HO) automat...
This paper describes a procedure for unification in extensional higher order logics. The procedure i...
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...
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 ...
This paper develops a sound and complete transformation-based algorithm forunification in an extensi...
International audienceAbstract Unification is a central operation in constructing a range of computa...
In this monograph we study two generalizations of standard unification, E-unification and higher-ord...
. In this paper, we present several improvements of an algorithm for a higher-order unification base...
Abstract: "The first part of this paper introduces an extension for a variant of Huet's higher-order...
AbstractWe present an algorithm for unification in the simply typed lambda calculus which enumerates...
AbstractLet E be a first-order equational theory. A translation of higher-order E-unification proble...
We develop an efficient representation and a pre-unification algorithm in the style of Huet for the ...
We give a first-order presentation of higher-order logic based on explicit substitutions. This prese...
This techreport presents two approaches to primitive equality treatment in higher-order (HO) automat...
This paper describes a procedure for unification in extensional higher order logics. The procedure i...
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...
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 ...
This paper develops a sound and complete transformation-based algorithm forunification in an extensi...
International audienceAbstract Unification is a central operation in constructing a range of computa...
In this monograph we study two generalizations of standard unification, E-unification and higher-ord...
. In this paper, we present several improvements of an algorithm for a higher-order unification base...
Abstract: "The first part of this paper introduces an extension for a variant of Huet's higher-order...
AbstractWe present an algorithm for unification in the simply typed lambda calculus which enumerates...
AbstractLet E be a first-order equational theory. A translation of higher-order E-unification proble...
We develop an efficient representation and a pre-unification algorithm in the style of Huet for the ...
We give a first-order presentation of higher-order logic based on explicit substitutions. This prese...
This techreport presents two approaches to primitive equality treatment in higher-order (HO) automat...