A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf
.
Practical Higher-Order Pattern Unification with On-the-Fly Raising
[chapter]
2005
Lecture Notes in Computer Science
Higher-order pattern unification problems arise often in computations carried out within systems such as Twelf, λProlog and Isabelle. An important characteristic of such problems is that they are given by equations appearing under a prefix of alternating universal and existential quantifiers. Existing algorithms for solving these problems assume that such prefixes are simplified to a ∀∃∀ form by an a priori application of a transformation known as raising. There are drawbacks to this approach.
doi:10.1007/11562931_28
fatcat:6tr7ribftjb4ppsvtfxsf4zvbq