// The worst implementation of Fibonacci calculations
// possible. FYI, it can be done in constant time.
fib :: fn a:int -> int {
    if a < 2 {
        ret a
    }
    ret fib(a - 1) + fib(a - 2)
}
// 23 is around where things start getting slow.
start :: fn {
    //TODO pass arguments to skip debug printing. this test is very slow otherwise
    <!>
    // fib(23) <=> 28657
}