Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media New York
About this chapter
Cite this chapter
Prehofer, C. (1998). Decidability of Higher-Order Unification. In: Solving Higher-Order Equations. Progress in Theoretical Computer Science. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-1778-7_5
Download citation
DOI: https://doi.org/10.1007/978-1-4612-1778-7_5
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-1-4612-7278-6
Online ISBN: 978-1-4612-1778-7
eBook Packages: Springer Book Archive