let mul = \m n s. m (n s) in
let pred = (\shift n. n shift (make\_pair 0 0) get\_snd) (\p. p (\x y. make\_pair (succ x) x)) in
let leq = \m n. iszero(n pred m) in
let mul = \m n s. m (n s) in
let pred = (\shift n. n shift (make\_pair 0 0) get\_snd) (\p. p (\x y. make\_pair (succ x) x)) in
let leq = \m n. iszero(n pred m) in
;
; a fixed-point combinator for defining recursive functions
let Y = \f. (\h. f (h h)) (\h. f (h h)) in
;
; a fixed-point combinator for defining recursive functions
let Y = \f. (\h. f (h h)) (\h. f (h h)) in
let t12 = (make\_list t1 (make\_list t2 empty)) in
let t23 = (make\_list t2 (make\_list t3 empty)) in
let ta = (make\_list t1 t23) in
let t12 = (make\_list t1 (make\_list t2 empty)) in
let t23 = (make\_list t2 (make\_list t3 empty)) in
let ta = (make\_list t1 t23) in