Decidability of Higher-Order Unification
Christian Prehofer · Birkhäuser Boston eBooks · 1998
As the known decidability results (see Section 2.6) do not cover many practical cases, we examine decidability of higher-order unification more closely, mostly considering the second-order case. An overview of the results and the corresponding sections can be found in Figure 5.1. Notice that the results only hold under the assumption that all conditions in the path to the node hold. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.