Lisp like lists -> box/invariant

[Bjoern]

bearophile wrote:

quote :
So you have one or more bits free into the pointers. So you can use your 
cons cells to represent far more than just pairs of pointers, like 
chars, symbols, not-too-much-short integers, almost-floats, short 
strings (just need their length, that is small. Small strings are very 
common), etc. Many Lisp implementations use such tagged data, this 
reduces pointer deferences and memory use. The problem is that this is 
dynamic typing, so such cons become a kind of box/variant (and this 
isn't too much bad, I think).
end quote
---------
Yes, this is excactly what I want!
The idea is to implement a  rowset (database related) datatype based on 
lists.
Well, having a LISP list in D is, beside a possible rowset 
implementation, not that bad, I guess.
Thanks, Bjoern