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 --------------------------------------------------------------------------------
10 Precedence total order:
12 lambda > apply > infix operators > binders
14 where binders are all binders except lambda (i.e. \forall, \pi, \exists)