Re:How the right syntax can help teach recursion
by taeric on Thursday September 15, 2016 @01:14PM
(#12507915)
I find this... still an odd definition. To quote Sussman/Abelson[1], "An evaluator that can execute a procedure such as sqrt-iter without requiring increasing storage as the procedure continues to call itself is called a tail-recursive evaluator."
Specifically, the caller of this function will have to clear out the stack of all operations that were pushed. Something you wouldn't have to do on a tail or non-recursive function.
[1] https://mitpress.mit.edu/sicp/full-text/book/book-Z-H-34.htm...
Re:How the right syntax can help teach recursion
by qwertyuiop924 on Thursday September 15, 2016 @02:23PM
(#12508507)
It is an odd definition, I won't deny that. I was trying to talk about possible implementation, as opposed to the typical definition, so it's possible that I should have used another term.
By the way, this is the paper I was talking about. It won't explain my bizarre choice of words, but it might explain what I meant when I said that Scheme tail-call optimizes unconditionally:
http://repository.readscheme.org/ftp/papers/ai-lab-pubs/AIM-...
Re:How the right syntax can help teach recursion
by taeric on Thursday September 15, 2016 @03:46PM
(#12509218)
I think I see the difference. There are tail call optimizations, and then there is tail call recursion. They are two different things, potentially.
Thanks for linking the paper!
Re:How the right syntax can help teach recursion
by qwertyuiop924 on Thursday September 15, 2016 @05:07PM
(#12509841)
Yeah, there you go.
That paper is part of a collection of papers, known as The Lambda Papers. If you enjoyed this one, you'll probably want to read the rest:
Let's look at Factorial in Scheme. You mentioned Fib, but Factorial is a simpler example, and will suffice.
The Scheme compiler/interpreter will detect that the last expression to be evaluated, and thus the return value will be: Now, you might think that Scheme would detect this as ineligible for TCO, but that's not what happens. In fact, what happens (in pseudo-asm) is this: obviously, in a real asm, sub and mul are primitives, not funcalls, but you get the idea.If that didn't make sense, just read, "LAMBDA: The Ultimate Declarative." it explains it better than I could.
So yes, all functions in Scheme are TCOed (at least, in the original implementation), it's just that some of the build of stack frames. I don't know if that's how other languages work, but it might be.