Re: DEFUN list argument

On 2024-09-29, Axel Reichert <mail@axel-reichert.de> wrote:

Kaz Kylheku <643-408-1753@kylheku.com> writes:
>

Scheme offers very little; most serious work done with Scheme picks an
implementation and uses it.
>
Many of your own posts pick a particular Scheme like Gauche and often
use its extensions that are not in Scheme.

>
Like in geography: "Where does London end?"   (-:

That's a harder problem than picking some concrete criteria for
deciding where it ends, and applying them consistently when comparing
the sizes of London, Liverpool or Birmingham.

Linked lists have poor cache performance. Chasing down a linked list
involved dependent loads which the machine cannot prefetch, unlike
marching down an array that is contiguously laid out in memory.
>
The battle you are trying to pick here is outdated.

>
I have read so a couple of times. Interesting. But what is a Lisper to
do in the source code? Convert it all to vectors/arrays? Use more
imperative idioms than recursion? Do not care, because it is all handled
by the implementation?
>
Honestly curious,

Lists are fine in most situations. Just maybe when you find yourself
doing discrete Fourier transforms on nested lists on what is supposed
to be some sort of real time signal processing code, maybe have a word
with yourself.

--
TXR Programming Language: http://nongnu.org/txr
Cygnal: Cygwin Native Application Library: http://kylheku.com/cygnal
Mastodon: @Kazinator@mstdn.ca