🚀 go-pugleaf

IBM-Prolog has arrays and "item-lists" (like arrays, except
that the indexes are arbitrary atoms).  They are O(1) for
access and update.  Updates are undone on backtracking.
(There are also "global terms" which provide associative
tables whose changes may be undone by backtracking or not,
at the programmers control).

I have used item-lists to implement a constraint logic programming
version of n-queens: the algorithm is essentially linear on "n"
whereas even the best of the permute-and-test algorithms is exponential
(for n=20, the constraint version took 40 milliseconds and I gave
up waiting for the conventional program after a few minutes).

- Peter Ludemann	prefered e-mail: ludemann@mlpvm1.iinus1.ibm.com