Add to ORKGIn current implementations of higher-order logics higher-orderunification is used to lift the resolution principle from the first-order case to the higher-order case. Higher-order matching is the core of implementations of higher-order rewriting systems and some systems for program transformation. In this paper I argue that Church's original lambda calculus, called non-forgetful lambda calculus, is an appropriate basis for higher-order matching. I provide two correct and complete algorithms for unification in the non-forgetful lambda calculus. Finally, I show how these unification algorithms can be used for matching in the non-forgetful lambda calculus
1. We analyze expressiveness of the simply typed lambda calculus (STLC) over a single base type, and...
Abstract. We present an abstract view of existential variables in a dependently typed lambda-calculu...
We study the higher-order rewrite/equational proof systems obtained by adding the simply typed lambd...
In current implementations of higher-order logics higher-order unification is used to lift the resol...
We develop an order-sorted higher-order calculus suitable forautomatic theorem proving applications ...
AbstractHuet proposed delaying some unifications of typed lambda terms, as part of a higher-order re...
. A higher order logic programming system is presented. The declarative semantics of the system is b...
Huet proposed delaying some unifications of typed lambda terms, as part of a higher-order resolution...
This paper develops a sound and complete transformation-based algorithm forunification in an extensi...
In current implementations of higher-order logics higher-orderunification is used to lift the resolu...
Nominal logic is an extension of first-order logic with equality, name-binding, renaming via name-sw...
Term rewriting has proven to be an important technique in theorem proving. In this paper, we illustr...
The unification of simply typed λ-terms modulo the rules of ß- and η-conversions is often called hi...
AbstractWe present an algorithm for unification in the simply typed lambda calculus which enumerates...
AbstractHuet proposed delaying some unifications of typed lambda terms, as part of a higher-order re...
1. We analyze expressiveness of the simply typed lambda calculus (STLC) over a single base type, and...
Abstract. We present an abstract view of existential variables in a dependently typed lambda-calculu...
We study the higher-order rewrite/equational proof systems obtained by adding the simply typed lambd...
In current implementations of higher-order logics higher-order unification is used to lift the resol...
We develop an order-sorted higher-order calculus suitable forautomatic theorem proving applications ...
AbstractHuet proposed delaying some unifications of typed lambda terms, as part of a higher-order re...
. A higher order logic programming system is presented. The declarative semantics of the system is b...
Huet proposed delaying some unifications of typed lambda terms, as part of a higher-order resolution...
This paper develops a sound and complete transformation-based algorithm forunification in an extensi...
In current implementations of higher-order logics higher-orderunification is used to lift the resolu...
Nominal logic is an extension of first-order logic with equality, name-binding, renaming via name-sw...
Term rewriting has proven to be an important technique in theorem proving. In this paper, we illustr...
The unification of simply typed λ-terms modulo the rules of ß- and η-conversions is often called hi...
AbstractWe present an algorithm for unification in the simply typed lambda calculus which enumerates...
AbstractHuet proposed delaying some unifications of typed lambda terms, as part of a higher-order re...
1. We analyze expressiveness of the simply typed lambda calculus (STLC) over a single base type, and...
Abstract. We present an abstract view of existential variables in a dependently typed lambda-calculu...
We study the higher-order rewrite/equational proof systems obtained by adding the simply typed lambd...