Lines Matching refs:terms
174 \item It scans the two terms.
188 \item Otherwise it means that the two terms are equal and it fails.
193 If it finds a pair of unifiable terms, it returns them in
196 the two terms and scans recursively all their arguments.
212 true % the terms are different
282 In this way, we scan only the part of the terms which is absolutely
283 necessary to detect failure -- the two terms can become
288 original terms
290 Each time the suspension is woken, we scan the two terms
292 If, for instance, the compared terms are lists with thousands of elements
302 as soon as we find a variable, we stop scanning the terms
308 If it finds a pair of unifiable terms, it inserts it into
311 \item \predspec{equal_lists/4} processes the arguments of compound terms.
316 If it finds an identical pair, it succeeds, the two terms
326 to compound terms, the new terms are again scanned by \predspec{equal_arg/4},
334 terms are identical and thus the predicate fails.
345 terms are known not to contain any pairs which are not proper lists.
403 Now we can see that compound terms are processed up to the first
437 on the two terms (i.e., it is a ``tell'' constraint only).
439 Since it does not process the terms completely, it sometimes
455 The easiest way would be to process both terms completely each
458 We can process the terms once when the predicate
473 which will be instantiated when the two terms become
494 of matched terms became identical, it binds those additional
573 disequality on two terms and to query it.
604 especially its unifiability with other terms.