Unification Under a Mixed Prefix

  title={Unification Under a Mixed Prefix},
  author={Dale Miller},
  journal={J. Symb. Comput.},
Unification problems are identified with conjunctions of equations between simply typed λ-terms where free variables in the equations can be universally or existentially quantified. Two schemes for simplifying quantifier alternation, called Skolemization and raising (a dual of Skolemization), are presented. In this setting where variables of functional type can be quantified and not all types contain closed terms, the naive generalization of first-order Skolemization has several technical… CONTINUE READING