Re: [stack] recursion is too hard
Chris Double <[email protected]>
| Newsgroups | gmane.comp.lang.concatenative |
|---|---|
| Message-ID | <[email protected]> |
On Thu, Mar 12, 2009 at 10:18 PM, John Nowak <[email protected]> wrote: > > Not sure how locals would fix this particular problem. In the example > I gave, the function provided was already pulled in via substitution. > Maybe you can give an example so I can understand what you mean. I didn't actually understand your example, sorry. Can you break down your example, explaining what each word does and what stack effect it has? I don't know what 'spread' does and I didn't know whether the language given is like joy, in that it preserves the stack, or like Factor, in that it doesn't. Chris. -- http://www.bluishcoder.co.nz