Displaying 3 results from an estimated 3 matches for "readscheme".
Did you mean:
readschema
2012 Oct 03
0
[LLVMdev] Does LLVM optimize recursive call?
...ourneyer, you should ignore this stuff that we are saying,
these are all exceptions: you'll fix them if they arise, but you
generally shouldn't design with them in mind. Journeyer, if you want
to learn more about tail calls, I recommend this paper by Guy Lewis
Steele, Jr.:
http://repository.readscheme.org/ftp/papers/ai-lab-pubs/AIM-443.pdf
It's a pretty old paper, but it is exactly about your original
question. By the end, you'll probably know more about tail calls as
you'll ever need to know :)
-- Sean Silva
On Wed, Oct 3, 2012 at 1:28 PM, Preston Briggs <preston.briggs at gmai...
2012 Oct 03
3
[LLVMdev] Does LLVM optimize recursive call?
On Wed, Oct 3, 2012 at 10:15 AM, Matthieu Moy
<Matthieu.Moy at grenoble-inp.fr> wrote:
> Preston Briggs <preston.briggs at gmail.com> writes:
>> Think about costs asymptotically; that's what matters. Calls and
>> returns require constant time, just like addition and multiplication.
>
> Constant time, but not necessarily constant memory.
>
> Deep recursion
2011 Feb 04
3
[LLVMdev] CPS
Hi everybody,
I'd like to try implementing a pass that transforms all functions (and
function calls, returns, etc.) to CPS, so that TCO can get rid of all
(or most of) the function calling overhead (because, as you probably
know, the side effect of using CPS is that all function calls become
tail calls).
That being said, and since I'm pretty new to LLVM, I'd like to ask a
couple