[[[RMS] faults Tcl for its linked-lists-lessness.  Explain
what linked lists are, who RMS is, and Tcl perspective--mostly that Tcl doesn't need 'em.]]

[Arjen Markus] I do not know who RMS is, but "woe , ye of little imagination", Tcl lists can be used as linked lists - if you regard a linked list as some abstract data structure (apart from the implementation!). I regard his/her statement as an example that most people can not distinguish implementation and concept!

[RS] RMS is Richard M Stallman, a famous programmer in the GNU scene, but not enthusiastic about Tcl. (See [Who says Tcl sucks...]) I also have problems understanding the need for linked lists - Tcl's are contiguous in memory, so the benefit of links, i.e. iterating over it, is easily reached with [foreach]. OTOH, recursing over lists involves copying in Tcl, so real linked lists like LISP's CAR/CDR also have their advantages.

[LV] I'd say the issue is likely this - people used to algorithmic solutions requiring specific data structures, such as structures, linked lists, etc. find it difficult to envision how to efficiently implement such solutions in Tcl with only flat lists and hash tables.