test/fib.myr


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16

use std
/* checks if recursive functions work. should return 21. */
const fib = {n
	if n <= 0
		-> 0
	elif n == 1
		-> 1
	else
		-> fib(n - 1) + fib(n - 2)
	;;
}

const main = {
	std.exit(fib(8))
}