Abstract
In this chapter we introduce some of the built-in predicates that a Prolog system might provide. What do we mean when we say that a predicate is built-in? We mean that the predicate’s definition is provided in advance by the Prolog system, instead of by your own clauses. Built-in predicates may provide facilities that cannot be obtained by definitions in pure Prolog. Or they may provide convenient facilities just to save each programmer from having to define them himself. We have already encountered some built-in predicates: the predicates for reading and writing discussed in Chapter 5. Also, the “cut” could be regarded as a built-in predicate.
Keywords
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.
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
© 1987 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Clocksin, W.F., Mellish, C.S. (1987). Built-in Predicates. In: Programming in Prolog. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-97005-4_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-97005-4_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-17539-1
Online ISBN: 978-3-642-97005-4
eBook Packages: Springer Book Archive