The (x . y) construct

[Jacko]

(x . y) will have to be execised from the language on the grounds of
hardware efficiency.

The problem relates to the difference between a circular reference and
a self-reference, and strategies for garbage collection using
counting.

The strong non circular list argument says that all circular
references can be emulated with self references. An removing the
circularity can improve cycle detection to a much simpler problem,
eliminate certain TLB thrashings and allow the use of seperate memory
banks for link pointers.

To represent tree's some mechanism has to be used which is seperate
from using a botched list, and it needs to be made so that circularity
does not happen either. This post therefore asks for input on possible
solutions to the tree representation problem, either though new syntax
or some other non emulated but faster list representation.

Cheers Jacko