1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
implementation module fib_eqI_b (+) :: !Int !Int -> Int (+) a b = code inline { addI } (-) :: !Int !Int -> Int (-) a b = code inline { subI } fib :: Int -> Int fib 0 = 1 fib 1 = 1 fib n = fib (n-2) + fib (n-1) Start = fib 43