+ ((lambda (z) (+ 2 z)) (* y x)))
+ 67) ; exit code modulos at 256
+(test-expr '(if ((lambda (x) (= x 2)) 1) 0 (- 32 1)) 31)
+
+(test-prog-stdout '((if (= 3 2) 1 (let () (print "hello world!") 0))) "hello world!")
+
+(test-expr '((lambda (x y) (+ x y)) 1 2) 3)
+(test-expr '((lambda (x) (+ ((lambda (y) (+ y 1)) 3) x)) 2) 6)
+
+ ; passing closures about
+(test-expr '((lambda (z) ((lambda (x) (x 1)) (lambda (y) (+ z y)))) 2) 3)
+
+ ; passing builtins about
+(test-expr '((lambda (x) ((lambda (a b) (a b 3)) + x)) 3) 6)
+(test-expr '(bool->int ((lambda (x) (x false)) !)) 1)
+(test-expr '((lambda (f) (f true)) bool->int) 1)
+(test-prog-stdout '((let () ((lambda (f) (f "foo")) print) 0)) "foo")
+(test-expr '((lambda (f) (f 3 3)) (lambda (x y) (bool->int (= x y)))) 1)
+(test-expr '(bool->int ((lambda (f) (! (f 2 3))) =)) 1)
+
+ ; recursion
+(test-expr '(let [(inc (lambda (f n x)
+ (if (= n 0)
+ x
+ (f f (- n 1) (+ x 1)))))]
+ (inc inc 3 2))
+ 5)
+
+(test-expr '(let ([go (lambda (n m x)
+ (if (= n 0)
+ x
+ (go (- n 1) m (* x m))))]
+ [pow (lambda (p y) (go p y 1))])
+
+ (pow 3 2))
+ 8)
+
+(test-expr '(let ([pow (lambda (p y)
+ (let ([go (lambda (n x)
+ (if (= n 0)
+ x
+ (go (- n 1) (* x y))))])
+ (go p 1)))])
+ (pow 4 2))
+ 16)
+
+ ; mutual recursion
+;; (test-prog-stdout '((let ([f (lambda (n)
+;; (if (= n 0)
+;; 0
+;; (let ()
+;; (print "a")
+;; (g (- n 1)))))]
+;; [g (lambda (m)
+;; (let ()
+;; (print "b")
+;; (f (- m 1))))])
+;; (f 10))) "ababababab")
+
+ ; adts and pattern matching
+
+(test-prog '((data A [foo Bool Int])
+ (let ([(foo x y) (foo (= 3 3) 42)])
+ y))
+ 42)
+
+(test-exception (expand-pattern-matches
+ '((data A [foo Int]
+ [bar Bool])
+ (let ([(foo x) (foo 0)]) x))))
+
+(test-prog '((data A [foo Int])
+ (let ([x (foo 42)])
+ (let ([(foo y) x])
+ (+ 2 y))))
+ 44)
+
+(test-prog '((data A [foo Bool Int Int])
+ (let ([x (foo (= 2 1) 123 45)]
+ [(foo a b c) x])
+ (+ b c)))
+ (+ 123 45))
+
+(test-prog '((data A [foo Int])
+ (data B [bar A])
+ (let ([(bar (foo x)) (bar (foo 42))])
+ x))
+ 42)
+
+(test-prog '((data Foo [a] [b] [c])
+ (let ([x b])
+ (case x
+ [a 3]
+ [b 2]
+ [c 1])))
+ 2)
+
+(test-prog '((data Foo [foo Int Int] [bar Bool])
+ (case (foo 42 12)
+ [(foo 20 x) 0]
+ [(foo 42 x) x]
+ [(bar x) 0]))
+ 12)
+
+(test-prog '((data Foo [foo Int])
+ (data Bar [bar Foo])
+ (case (bar (foo 42))
+ [(bar (foo x)) x]))
+ 42)
+
+
+ ; mix of singleton and non singleton constructors
+(test-prog '((data A [foo Int] [bar])
+ (case (foo 42)
+ [(foo x) x]
+ [bar 0]))
+ 42)
+
+(test-prog '((data A [foo Int] [bar])
+ (case bar
+ [(foo x) 0]
+ [bar 12]))
+ 12)
+ ; todo: make this error for incomplete pattern match
+(test-exception '((data A [foo Int] [bar Int B])
+ (data B [baz Int])
+ (let ([val (bar 42 (baz 12))])
+ (case val
+ [(foo 42) 0]
+ [(bar 32 (baz 12)) 1]
+ [(bar 42 (baz x)) x]
+ [(foo x) 2]))))