Add set index in list, and update lib+examples+tests

examples/recursive.ang

@@ -1,14 +1,15 @@
 # This program computes the fibonacci numbers using recursion (O(2^n))
 # It is very slow
-func fib(x: number) number {
+fn fib(x: number) number {
 	if x <= 1 {
-		return x
+		x
+	} else {
+		fib(x - 1) + fib(x - 2)
 	}
-	return fib(x - 1) + fib(x - 2)
 }
 
 n := 0
 while n < 100 {
-	write(str(fib(n)))
+	println(fib(n))
 	n = n + 1
 }