Re: [stack] Barebone implementation of concatenative language in c or c++

Ruurd scripsit:

> Side effects. Then usual culprits are I/O. Now suppose I have a program:
> get 3 [+] i. I can still proceed from right to left, except that when
> I am about to execute + I do not find two numbers, but a function and
> a number. So 'get' must be evaluated before + is evaluated. This means
> that when + finds something that is a function, it has to invoke the
> function before proceeding with the addition.

This amounts to creating a lazy variety of Joy, a perfectly good idea,
but not equivalent to standard Joy, any more than Haskell is ML.

> The current implementation uses a stack, yes. But I was not talking
> about implementations, I was talking about the language and the
> way that I, as a person, can evaluate expressions in whatever
> order I like. If I can do that, mentally or on paper, it is a
> property of Joy, the language.

Only it's not.

> Manfred also thinks that it should be possible to
> build Joy, the implementation, as a rewriting system:
> http://www.latrobe.edu.au/philosophy/phimvt/joy/j07rrs.html, so who
> am I to question that?

Sure, but it would have to be an eager impure rewriting system.  Which is
what Pure is.

-- 
Verbogeny is one of the pleasurettes    John Cowan <[email protected]>
of a creatific thinkerizer.             http://www.ccil.org/~cowan
   --Peter da Silva