From: Jacko <jackokring@...>
Date: 2010-07-19T08:15:07+09:00
Subject: The price of a modern list architecture?

http://groups.google.co.uk/group/comp.lang.forth/browse_thread/thread/ef39e59023a8ae4c/9eb9f6b99139a5df#9eb9f6b99139a5df

Simple really, if Lisp's (X , Y) construct should have limits placed
on assignment of Y for translation lookaside buffer vitual memory
mapping thrashing and for easier garbage collection (provable), then
are there any structures in Ruby that may be better adapted such that
kernal poijnters may be used for faster code, and possibly extra
memory bandwidth for no garbage collector gc stalls and faster code?

I wish to call this a constrafucation.

Cheers Jacko