Re: [stack] disallowing recursive definitions
John Cowan <[email protected]>
| Newsgroups | gmane.comp.lang.concatenative |
|---|---|
| Message-ID | <[email protected]> |
William Tanksley, Jr scripsit:
> Seriously, I'm confused. Why did you start your paragraph with "no,"
> if you weren't intending to disagree with me? This probably all comes
> down to miscommunication again...
I can no longer fully sort this out, but your remark ended with a smiley,
so I assumed it was ironic, and was answering (seriously) that the ironic
statement was wrong, meaning that what I took to be your underlying actual
opinion was correct.
In any case, a tail-call in a concatenative language is a possible stack
reshuffle to get the arguments in the correct order for the new function
and then a GO TO to that function, which is essentially how it's implemented
in tail-recursive applicative languages like Scheme: you shuffle the arguments
about in registers, possibly spilling to the stack or restoring from the stack
as needed, and then do a machine-language GO TO.
Assembler: the ultimate concatenative language....
--
After fixing the Y2K bug in an application: John Cowan
WELCOME TO <censored> [email protected]
DATE: MONDAK, JANUARK 1, 1900 http://www.ccil.org/~cowan