Coming from yesterdays Java, Scala is a naturally the next step. It is a functional language compiled to run on the Java Virtual Machine. It integrates easily with Java programs, and as such, it is often used in conjunction with Java. Javas API is also available in Scala. This makes it easier for Java developers to start with Scala if they want to dive into functional programming.

This is the 4th day in my little challenge I am carrying out as a personal project. The first days elaborated on simple concepts, but later on more complicated concepts such as type level programming, parallel programming and even more theoretical subjects are explored.

Day 3 - Scala

Today I present an implementation of Fibonacci in the Continuation Passing Style (CPS). This can easily be done in Scala because of its functional nature:

// Fibonacci in Contiuation Passing Styledef fib_cps (n: Int, k: (Int => Int)) : Int = n match{    case 0 => k(0)    case 1 => k(1)    case _ => fib_cps(n-1, (a: Int) =>        fib_cps(n-2, (b: Int) =>            k(a+b)))}

In this example I have used pattern matching to keep it easily readable. The variable k holds the continuation which is evaluated in the base cases (case 0 and case 1).

The above code was wrapped to make it compatible to the usually type signature of Fibonacci.

// An alias to make it satisfy the type signature Int -> Intdef fib_cont(n: Int) = fib_cps(n, ((x: Int) => x)) 

The main function holds a call to above. The whole thing is compiled and run on the command line completely as one would expect coming from Java.

$ scalac Fib.scala $ scala Fib55

A little quiz: Guess n such that $fib(n) = 55$ (I have elaborated on this tomorrow).

The code can as usually be found on GIT here

Continuation Passing Style

Continuation Passing Style is not easy to read, and as such it is not a good way to implement functions, unless there is a very good reason. These reasons can be applications where explicit management of the control flow is necessary.

Many compilers do an implicit conversion from recursive functions to functions in CPS. A reason is that all computations are wrapped in a package (i.e. the continuation) and is put in the heap which reduces maximum stack size.


Today I looked at 2 new things, Scala and Continuation Passing style.

Scala is a great language for writing functional code that has to integrate with Java projects, or for writing functional code using Java libraries.

Continuation passing style is a way of programming which can be enormously useful. Especially when writing large project where the control flow has to be explicitly managed.