juvix/tests/Core/positive/test011.jvc

-- tail recursion: compute the n-th Fibonacci number in O(n)

def fib' := \n \x \y if n = 0 then x else fib' (n - 1) y (x + y);
def fib := \n fib' n 0 1;

def writeLn := \x write x >> write "\n";

writeLn (fib 10) >>
writeLn (fib 100) >>
writeLn (fib 1000)