http://thevalerios.net/matt/2009/01/recursion-in-f-and-the-tail-recursion-police/ Just another WordPress weblog Wed, 13 Jan 2010 16:31:08 -0600 http://wordpress.org/?v=2.8.6 hourly 1 http://thevalerios.net/matt/2009/01/recursion-in-f-and-the-tail-recursion-police/comment-page-1/#comment-9843 valerio.net » Blog Archive » Hunting the Elusive ‘tail’ Opcode in F# Thu, 18 Jun 2009 05:00:56 +0000 http://thevalerios.net/matt/2009/01/recursion-in-f-and-the-tail-recursion-police/#comment-9843 [...] Recursion in F# and the Tail Recursion Police [...] [...] Recursion in F# and the Tail Recursion Police [...]

]]> http://thevalerios.net/matt/2009/01/recursion-in-f-and-the-tail-recursion-police/comment-page-1/#comment-5337 Brian McNamara Mon, 05 Jan 2009 18:58:38 +0000 http://thevalerios.net/matt/2009/01/recursion-in-f-and-the-tail-recursion-police/#comment-5337 Regarding the .tail opcode, the F# compiler will turn directly recursive functions into loops, as you saw, but indirect recursion (e.g. where function 'f' tailcalls 'g' and function 'g' tailcalls 'f') will use the .tail opcode, if you're curious to Reflector-find it. In general all tail calls that may create recursion turn into .tail opcodes, except direct calls to the currently running function, which are instead translated into while loops. Regarding the .tail opcode, the F# compiler will turn directly recursive functions into loops, as you saw, but indirect recursion (e.g. where function ‘f’ tailcalls ‘g’ and function ‘g’ tailcalls ‘f’) will use the .tail opcode, if you’re curious to Reflector-find it. In general all tail calls that may create recursion turn into .tail opcodes, except direct calls to the currently running function, which are instead translated into while loops.

]]>