Hi,
Maybe one reason is will it be complicated to do garbage collection on a hash
table? In theory its possible but maybe it will be a bit tedious compare to
linked list data struct.
BR,
geo
> On Apr 28, 2019, at 3:24 AM, C K Kashyap wrote:
>
> Thank you so much for your detailed
Thank you so much for your detailed explanation.
On Sat, Apr 27, 2019 at 10:46 AM Joh-Tob Schäg wrote:
> Lisp is language where expression are executed in order. Since lisp code
> is expressed in data, we need something that has a way of expression of
> express ordering.
> That is possible in a
Lisp is language where expression are executed in order. Since lisp code is
expressed in data, we need something that has a way of expression of
express ordering.
That is possible in a dictionary too. Let's imagine the code:
{fak => {1 => {1 => N}, {2=>{1=>if, 2=>{1 => =, 2=> N, 3=>0}, 3=>1,
Hi Alex et al,
I've wondered about this question for a bit. Why should list be the
fundamental data type? Should it not be a dictionary? Dictionary is
essentially a function - mapping a domain to a range.
Is it that list could be built more easily with cons cell as the building
block? Is it like
