http://kix.in/2007/12/30/the-trampoline/ Anant Narayanan Mon, 30 Jan 2012 14:18:45 +0000 hourly 1 http://wordpress.com/ http://kix.in/2007/12/30/the-trampoline/#comment-951 Wed, 07 Oct 2009 01:08:27 +0000 http://localhost/blog/?p=187#comment-951 [...] Across the Stars » Blog Archive » The Trampoline (tags: fp recursion lisp optimization interpreter) [...]

]]> http://kix.in/2007/12/30/the-trampoline/#comment-950 Thu, 03 Jan 2008 10:11:00 +0000 http://localhost/blog/?p=187#comment-950 If your method is not tail-recursive, it may take some effort in trying to make it tail-recursive; and sometimes it may not be possible at all. But Bj̦rn is right in stating that the trampoline is in fact a tail-recursion optimization Рif you can use a trampoline, you can represent your function in a tail-recursive manner.@Leslie: That would indeed be the case when your language is statically compiled, but tail-recursion optimization is a lot more trickier in dynamic languages such as Java or Python, in which case such optimization is left to the programmer.

]]> http://kix.in/2007/12/30/the-trampoline/#comment-949 Thu, 03 Jan 2008 09:55:00 +0000 http://localhost/blog/?p=187#comment-949 Yeah, tail recursion is the way to go. And that should rather be part of the compiler implementation, not of application land… Leslie

]]> http://kix.in/2007/12/30/the-trampoline/#comment-948 Mon, 31 Dec 2007 01:24:00 +0000 http://localhost/blog/?p=187#comment-948 When you can use a trampoline you can also use have the recursive call allowing tail-recursion optimizations.Actually the trampoline _is_ a tail recursion optimization in a way …

]]> http://kix.in/2007/12/30/the-trampoline/#comment-947 Sun, 30 Dec 2007 21:19:00 +0000 http://localhost/blog/?p=187#comment-947 In our (functional) world, we would rather employ Tail Recursion instead –G0SUB

]]>