8

Unification of λ-terms

The computations that arise in the course of proof search with higher-order logic programs often require finding substitutions for essentially existentially quantified variables that make two different terms λ-convertible. In Chapter 4 we characterized such higher-order unification problems using a mixed quantifier prefix over a “matrix” involving a conjunction of equations. Specifically, unification problems are formulas of the form

where *n, m ≥ 0*, *Q _{i}* is either ∀ or ∃ for 1 ≤

Start Free Trial

No credit card required