2 Input Should be parsed as Derived constraint
4 --------------------------------------------------------------------------------
5 \lambda x.x y \lambda x.(x y) lambda > apply
6 S x = y (= (S x) y) apply > infix operators
7 \forall x.x=x (\forall x.(= x x)) infix operators > binders
8 \lambda x.x \to x \lambda. (x \to x) \to > \lambda
9 --------------------------------------------------------------------------------
11 Precedence total order:
13 apply > infix operators > to > binders
15 where binders are all binders except lambda (i.e. \forall, \pi, \exists)
19 ./test_parser term << EOT