Previous: Testing of Terms, Up: Terms [Contents][Index]

Succeed if `L3`

is the concatentation of `L1`

and `L2`

append: ([T]?, [T]?, [T]?)<= | (![T], ![T], ?[T])<= | (?[T], ?[T], ![T])<=

Succeed if `L2`

is the reverse of `L1`

.

`reverse : (![T?], ?[T?]) <=`

Succeed if `L2`

is `L1`

sorted.

`sort : (![T?], ?[T?]) <=`

Succeed if `X`

is in `L`

.

`member : (T?, [T]?) <=`

Succeed if `X`

is in `L`

.

in: (?T,[T])<= | (T?,![T?])<= | (?string,[string])<= | (?T,{T}) <=

Almost exactly the same uses as `member`

except that it it must be given a complete list of possibly non-ground terms.

As its type indicates, `in`

can also be used to access single character substrings of a string and ground elements of a set.