Unification is a fundamental process upon which many methods for automated deduction
are based. Unification theory abstracts from the specific applications of this process: it …

Higher-order unification and matching | Handbook of automated reasoning skip to main content
ACM Digital Library home ACM home Google, Inc. (search) Advanced Search Browse About …

Higher order unification is equational unification for βη-conversion. But it is not first order
equational unification, as substitution has to avoid capture. Thus, the methods for equational …

The usage of sorts in rst-order automated deduction has brought greater conciseness of
representation and a considerable gain in e ciency by reducing the search spaces involved …

The talk will present a survey of higher order unification, covering an outline of its historical
development, a summary of its applications to three fields: automated theorem proving, and …

We investigate several approaches to resolution based automated theoremproving in
classical higher-order logic (based on Church's simply typedλ-calculus) and discuss their …

The history of building automated theorem provers for higher-order logic is almost as old as
the field of deduction systems itself. The first successful attempts to mechanize and …

In this paper, we propose a sufficient condition for modularity of completeness of hierarchical
combinations. The sufficient condition is a syntactic one (about recursion) based on …

Equation solving is the process of finding a substitution of terms for variables that makes two
terms equal in a given theory, while semantic unification is the process that generates a …

In modern functional languages, pattern matching is used to define functions or expressions
by performing an analysis of the structure of values. We extend Haskell with a new non-local …