Abstract
This chapter introduces higher-order unification and term rewriting. First, Section 4.1 reviews a set of transformation rules for full higher-order pre-unification. This is followed by an important special case, higher-order patterns, where unification proceeds almost as in the first-order case.
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). Higher-Order Equational Reasoning. In: Solving Higher-Order Equations. Progress in Theoretical Computer Science. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-1778-7_4
Download citation
DOI: https://doi.org/10.1007/978-1-4612-1778-7_4
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