Re: [stack] Re: Welcome to the new members...

hiatoms <[email protected]> wrote:
> Wm, what have you been working on out of curiosity?

I sped up my zeroone/tworing brute-force-search considerably for large
bitcounts; the overhead has become reasonable enough that I'm now
confident that my pseudo-backtracking actually adds something to the
search.

I'm also playing around with some alternative meanings for the zero
and one combinators, based on very different underpinnings. The
current underpinning is combinatorial logic; there are other logics
that may possibly be entertaining -- for example, there's a logic
based on bit copying. We'll see, I don't have any solid results yet.

> I've wondered for awhile now why there's not much cross-pollination of Factor topics on the concatenative list side of things?  That's where a lot of the practical side of things has been happening with regards to concatenative languages... Is there something that the more academically inclined languages like Joy provide that appeal to this list more?

Factor has its own mailing list, so people seem to want to discuss it
there, where Factor people are listening anyhow. Meanwhile, this is
the only place to discuss Joy, even though it's not conceptually on
topic. You're right that Factor has brought some very interesting
theoretical ideas into reality, and they deserve to be discussed in
theory as well :-).

I'm going to say that this is the list on which we discuss all
plausibly concatenative languages which are not discussed on any list.
(That was very carefully phrased.)

> Whatever happened to cat which seems (with the addition of things like Factor's dataflow combinators) would be a good platform to study the statically typed side of things?  With F# 2.0 officially supported in Visual Studio (Or the VS Integrated Shell+Fsharp distribution for a free solution), it'd be neat to see the implementation move over to that language with functional roots based on Ocaml.

I'm not sure. I haven't heard anything.

> -Adam

-Wm