Decidability of Higher-Order Unification

  • Christian Prehofer
Part of the Progress in Theoretical Computer Science book series (PTCS)


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.


Free Variable Induction Scheme Decidable Unification Unification Problem Elimination Problem 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1998

Authors and Affiliations

  • Christian Prehofer
    • 1
  1. 1.Institut für Informatik, SB3MünchenGermany

Personalised recommendations