IF Computer > MINERVA > Manual > Reference > Predicates > Term unification > =/2

=/2

MINERVA
ifcomputer logo
f
Expert Services on the Web

unifies two terms.

?Term1 = ?Term2
=(?Term1, ?Term2)

'='/2 unifies Term1 with Term2 . It succeeds if they are unifiable, otherwise the predicate fails.

'='/2 is a predefined infix-operator with priority 700 which is non-associative (see also current_op/3).

Arguments

Term1                  term
Term2                  term

Examples

X is 10*10, X=100. Succeeds with substitution X <- 100.
X=f(X), Y=f(Y), X=Y. Creates an infinite term -> writing this term will result in an inifite loop.
integer(2) = integer(2.0). Fails.

Standard

This predicate is part of the ISO-Prolog Standard.

See also

'\='/2, unify_with_occurs_check/2.

document: http://www.ifcomputer.co.jp/MINERVA/Manual/Reference/Predicates/term_unification/unify/print_en.html
published 2008/6/30 update 1998/8/7 (c) 1996-2006 IF Computer Japan
IF Computer 5-28-2 Sendagi, Bunkyo-ku Tel +81-3-5814-3352 info@ifcomputer.com
Customer Support Tokyo 113-0022 Japan   http://www.ifcomputer.com
Back> managed with ubiCMS