Abstract
One of Prolog’s most powerful features is its built-in pattern-matching algorithm, unification. For all of the examples we have seen so far, unification has been relatively simple. We will now examine unification more closely.
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
© 1990 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Merritt, D. (1990). Unification. In: Adventure in Prolog. Springer Compass International. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-3426-5_10
Download citation
DOI: https://doi.org/10.1007/978-1-4612-3426-5_10
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-8007-1
Online ISBN: 978-1-4612-3426-5
eBook Packages: Springer Book Archive