tests whether two terms are not unifiable. ...
Move to
=> <=
Darueber Spitze
See also
\=/2
=/2
unifiy_with_occurs_check/2
IF Computer > MINERVA > Manual > Reference > Predicates > Term unification > \=/2

\=/2

tests whether two terms are not unifiable.

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

'\='/2 succeeds when Term1 and Term2 are not unifiable and fails if they are unifiable.

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

Arguments

Term1                  term
Term2                  term

Examples

\=(7,7.00). Succeeds.
X=a, f(X,b) \= f(b,b). Succeeds.
f(g(X),X) \= f(Y,write(a)). Fails.

Standard

This predicate is part of the ISO-Prolog Standard.

See also

'='/2, unify_with_occurs_check/2.

read on...
MINERVA
ifcomputer logo
f
Expert Services on the Web
Sprache
English
Japanese
Server
USA
Japan
Site Access
Local Index
Local Contents
Site Contents
Site Index
Printer Friendly
For imode
For PDA
Search
document: http://www.ifcomputer.co.jp/MINERVA/Manual/Reference/Predicates/term_unification/not_unifiable/home_de.html
published 2008/11/17 update 1998/8/7 (c) 1996-2006 IF Computer Japan
IF Computer 5-28-2 Sendagi, Bunkyo-ku Tel +81-3-5814-3352 start (AT) ifcomputer.com
Customer Support Tokyo 113-0022 Japan   http://www.ifcomputer.com
scroll to top managed with ubiCMS