>
> BTW, have any of the vector techniques used in K been applied to
> text/file manipulation? I realize that K's forte is math, but I
> would think that treating strings as lists--or as trees--could
> provide some advantages over C-style strings in terms of flexibility,
> complex algorithms, especially for really massive agglomerations of
> text. (I'm just now starting to read the K reference on I/O, so, I
> don't know much about it.).
k might have a slight performance edge in text processing (see
http://www.kx.com/a/k/examples/bell.k for comparison with perl
and c on the bell labs scripting language benchmark), but to be
competitive in this area one would have to hook up one of the
standard regexp packages. as arthur is wont to say, k prefers
data processing (binary) to text processing.
on a slightly perpendicular matter, i've been skimming some
documents on continuations -- i think i understand the concept --
especially the work done on stackless python. very intriguing,
especially since the c-stack limits the number of recursions
one can perform in k. although it is pretty rare to hit the
limit (the ackermann function is a notable example), it is
annoying to have to worry about it, especially in a recursion-
intensive language like joy.
i see that call-cc has come and gone in joy, and i'm wondering
whether you (manfred) regard continuations as a piece of exotica,
or foresee it as being useful in joy.
>
> --Hodge
>