Section "syntactic"

With the introduction of the printing of cyclic terms in the top-level, we have also extend equality to cyclic terms. The equality (==)/2 determines bisimilarity of two cyclic terms, using the union find method [6]. The predicate term_hash/2 can compute a hash, but for a cyclic term argument, the hash will not stable among bismulation equivalent terms.

The following syntactic predicates are provided:

X == Y: [ISO 8.4.1]

The built-in succeeds when X and Y are syntactically equivalent, otherwise fails.

X \== Y: [ISO 8.4.1]

The built-in succeeds when X and Y are not syntactically equivalent, otherwise fails.

term_hash(X, H):

The predicate succeeds in H with the hash of the term X.

Use Privacy (c) 2005-2026 XLOG Technologies AG