higher-order-unification. A simple, concise implementation of Huet's algorithm. Written because it's difficult to translate the simple prose ...
If higher-order variables, that is, variables representing functions, are allowed in an expression, the process is ...
State of the art — yes, so far as I know all algorithms more or less take the same shape as Huet's (I follow theory of logic programming, although ...
The higher-order unification problem (Huet,. 1975) involves finding a substitution for the free variables in a pair of lambda-calculus expressions that, when applied, ...
Inducing Probabilistic CCG Grammars from Logical Form with Higher-Order Unification · Tom Kwiatkowksi, Luke Zettlemoyer, Sharon Goldwater, Mark ...
Chierchia, Gennaro: 1983, 'Outline of a Semantic Theory of (Obligatory) Control', in Michael Barlow, Daniel Flickinger, and Michael Wescoat (eds.),Proceedings of ...
Abstract: Pulman has shown that Higher--Order Unification (HOU) can be used to model the interpretation of focus. In this paper, we extend the ...
One of the reasons for higher-order unification's explosiveness lies in flex-flex pairs, which consist of two applied variables, e.g., F X ? = G a, where F, G, and X are ...
ELLIPSIS AND HIGHER-ORDER UNIFICATION*. ABSTRACT. We present a new method for characterizing the interpretive possibilities generated by elliptical ...
We compare two different styles of Higher-Order Unification (HOU): the classical HOU algorithm of Huet for the simply typed λ-calculus and HOU based on the ...