18 May
2016
18 May
'16
12:58 a.m.
On May 11, 2016, at 5:41 PM, ben <bfranchuk at jetnet.ab.ca> wrote:
On 5/11/2016 5:54 PM, Toby Thain wrote:
Lisp has had data structures beyond lists for decades.
You don?t think a CLOS object is implemented as lists of lists of lists, do you?
-- Chris
On 2016-05-11 7:43 PM, Liam Proven wrote:
But List still sequential processing as far as I can see? How do you speed that up?
...
If we'd had 4 decades of effort aimed at fast Lisp Machines, I think
we'd have them.
Compiled Lisp, even on generic hardware, is fast. Fast enough, in fact,
that it obviated Symbolics. (More in Richard P. Gabriel's history of
Lucid.) See also: The newly open sourced Chez Scheme.