Don Box made another post on Continuations and Closures that made me realised I’d made a mistake in my last post. I had not used continuation; I merely used a closure that captured some mutable variables. Also F#/Caml does not have continuations in the same way Ruby does. F# does however have continuation style passing, also discussed in Mr. Box aforementioned post.

<?xml:namespace prefix = o ns = “urn:schemas-microsoft-com:office:office” /> /o:p

Anyway I thought I’d write a sort piece to show continuation style passing in action in F# , using my old favourite the Fibonacci series. Consider the following recursive code function that calculated the Fibonacci series.

/o:p

let rec fib i j =/o:p

if i < 1000 then /o:p

let _ = Printf.printf “%d\n” i in/o:p

fib j (i + j)/o:p

else ()/o:p

/o:p

let _ = fib 0 1/o:p

/o:p

While this is quite a nice implementation of the Fibonacci series there are a couple of problems with it. The basic problem is lack of flexibility; you can neither produce Fibonacci numbers above1000 nor can you do anything other than write them to the console. This can be solved using continuation style passing, the function could be rewritten removing all flow control and printing and replacing them with a continuation. A worker function can then be produced that replaces everything that was hard coded into the old function./o:p

/o:p

let rec fib i j cont =/o:p

cont i;/o:p

fib j (i + j) cont/o:p

/o:p

let worker i = /o:p

if i > 1000 then raise (new System.Exception()); /o:p

Printf.printf “%d\n” i/o:p

/o:p

let _ = /o:p

try /o:p

fib 0 1 worker with/o:p

_ -> ()/o:p

/o:p

It is interesting to note an expectation is used to control the flow. In imperative programming we are often told not use exceptions as flow control. I have begun to wonder if this statement is a little bit silly, after all exception are a mechanism for flow control, so not used them as flow control would mean not to use them at all. In functional programming it is somewhat less of a taboo, as they are extremely useful for breaking out of infinite loops or recursion with resorting to more imperative style flow control./o:p

/o:p

I think final solution looks something similar to the Fibonacci stream in Joe Duffy’s post on  laziness and streams in C# 2.0. Sure it not lazy, but the function does hand you a infinite set of numbers until you decide you don’t want any more. Of course F# does support streams and laziness./o:p