Add to ORKGWe introduce several approaches for solving higherorder equational problems by higher-order narrowing and give first completeness results. The results apply to higher-order functional-logic programming languages and to higher-order unification modulo a higher-order equational theory. We lift th
technical reportThis thesis studies first-order unification in equational theories, called E-unifica...
This paper describes a procedure for unification in extensional higher order logics. The procedure i...
Abstract. Using higher-order functions is standard practice in functional programming, but most func...
We develop an effective model for higher-order functional-logic programming by refining higher-order...
Abstract. We describe a new approach to higher-order narrowing computations ina class of systems sui...
AbstractLet E be a first-order equational theory. A translation of higher-order E-unification proble...
Let E be a first-order equational theory. A translation of typed higher-order E-unification problems...
We give a first-order presentation of higher-order logic based on explicit substitutions. This prese...
Solving equations in equational theories is a relevant programming paradigm which integrates logic a...
AbstractWe introduce a necessary and sufficient condition for the ω-extensionality rule of higher-or...
Colloque avec actes et comité de lecture.We propose a first-order presentation of higher-order logic...
We investigate several approaches to resolution based automated theorem proving in classical higher-...
International audienceWe propose a first-order presentation of higher-order logic based on explicit ...
AbstractEquational logic programming is an extended programming paradigm of equational programming. ...
This paper develops a sound and complete transformation-based algorithm forunification in an extensi...
technical reportThis thesis studies first-order unification in equational theories, called E-unifica...
This paper describes a procedure for unification in extensional higher order logics. The procedure i...
Abstract. Using higher-order functions is standard practice in functional programming, but most func...
We develop an effective model for higher-order functional-logic programming by refining higher-order...
Abstract. We describe a new approach to higher-order narrowing computations ina class of systems sui...
AbstractLet E be a first-order equational theory. A translation of higher-order E-unification proble...
Let E be a first-order equational theory. A translation of typed higher-order E-unification problems...
We give a first-order presentation of higher-order logic based on explicit substitutions. This prese...
Solving equations in equational theories is a relevant programming paradigm which integrates logic a...
AbstractWe introduce a necessary and sufficient condition for the ω-extensionality rule of higher-or...
Colloque avec actes et comité de lecture.We propose a first-order presentation of higher-order logic...
We investigate several approaches to resolution based automated theorem proving in classical higher-...
International audienceWe propose a first-order presentation of higher-order logic based on explicit ...
AbstractEquational logic programming is an extended programming paradigm of equational programming. ...
This paper develops a sound and complete transformation-based algorithm forunification in an extensi...
technical reportThis thesis studies first-order unification in equational theories, called E-unifica...
This paper describes a procedure for unification in extensional higher order logics. The procedure i...
Abstract. Using higher-order functions is standard practice in functional programming, but most func...