Adds more tests

Author: jacobaustin123

tests/test-hm-ackermann.cl

@@ -0,0 +1,14 @@
+# Test: Ackermann function - deeply nested recursion
+# Should infer (int, int) -> int
+
+def ackermann(m, n):
+    if m == 0:
+        return n + 1
+    else:
+        if n == 0:
+            return ackermann(m - 1, 1)
+        else:
+            return ackermann(m - 1, ackermann(m, n - 1))
+
+type(ackermann(2, 2))
+print(ackermann(2, 2))

tests/test-hm-ackermann.out

@@ -0,0 +1,2 @@
+int
+7

tests/test-hm-double-recurse.cl

@@ -0,0 +1,11 @@
+# Test: Function that makes two recursive calls with different args
+# Should infer int -> int
+
+def double_recurse(n):
+    if n <= 0:
+        return 1
+    else:
+        return double_recurse(n - 1) + double_recurse(n - 2)
+
+type(double_recurse(5))
+print(double_recurse(5))

tests/test-hm-double-recurse.out

@@ -0,0 +1,2 @@
+int
+13

tests/test-hm-factorial-acc.cl

@@ -0,0 +1,11 @@
+# Test: Factorial with accumulator - tests multiple params in recursion
+# Should infer (int, int) -> int
+
+def fact_acc(n, acc):
+    if n <= 1:
+        return acc
+    else:
+        return fact_acc(n - 1, n * acc)
+
+type(fact_acc(5, 1))
+print(fact_acc(5, 1))

tests/test-hm-factorial-acc.out

@@ -0,0 +1,2 @@
+int
+120

tests/test-hm-is-positive.cl

@@ -0,0 +1,11 @@
+# Test: Recursive check that eventually returns bool
+# Should infer int -> bool
+
+def all_positive(n):
+    if n <= 0:
+        return n == 0
+    else:
+        return all_positive(n - 1)
+
+type(all_positive(5))
+print(all_positive(5))

tests/test-hm-is-positive.out

@@ -0,0 +1,2 @@
+bool
+1

tests/test-hm-nested-arg.cl

@@ -0,0 +1,11 @@
+# Test: Recursive call used as argument to another call
+# Should infer int -> int
+
+def nested(n):
+    if n <= 1:
+        return n
+    else:
+        return nested(nested(n - 1))
+
+type(nested(5))
+print(nested(5))

tests/test-hm-nested-arg.out

@@ -0,0 +1,2 @@
+int
+1