list/1

Tests whether a term is a fully-specified list

list(Term) -(i)

?Term <term>

Remarks:

1) This predicate succeeds if Term is a fully-specified list, which means that it is currently bound to a list all of whose elements are enumerated.

2) This predicate originally served an entirely different purpose inside the original old "P.I.E" toolbox, out of which G.I.S. Prolog was born: The old "list" predicate produced program- or predicate- listings. However, for reasons explained in listing/1, this is no longer so.

Compatibility: LPA Win-Prolog, Swindon Prolog, most other Prologs.