How would you express the `succ` function in the Lambda Calculus?
- let succ = \n. \f z. f (n f z)
+ let succ = \n. \f z. f (n f z) in ...
+ Compare the definition of `cons`, which has an additional element:
+
+ <code>let cons = \<u>d</u> ds. \f z. f <u>d</u> (ds f z) in ...</code>