+so that `lift (+) (Some 3) (Some 4)` will evalute to `Some 7`.
+Don't worry about why you need to put `+` inside of parentheses.
+You should make use of `bind` in your definition of `lift`:
+
+ let bind (x: int option) (f: int -> (int option)) =
+ match x with None -> None | Some n -> f n;;
+
+
+Booleans, Church numbers, and Church lists in OCaml
+---------------------------------------------------
+
+(These questions adapted from web materials by Umut Acar. See <http://www.mpi-sws.org/~umut/>.)
+
+The idea is to get booleans, Church numbers, "Church" lists, and
+binary trees working in OCaml.
+
+Recall from class System F, or the polymorphic λ-calculus.
+
+ τ ::= α | τ1 → τ2 | ∀α. τ
+ e ::= x | λx:τ. e | e1 e2 | Λα. e | e [τ ]
+
+Recall that bool may be encoded as follows:
+
+ bool := ∀α. α → α → α
+ true := Λα. λt:α. λf :α. t
+ false := Λα. λt:α. λf :α. f
+
+(where τ indicates the type of e1 and e2)
+
+Note that each of the following terms, when applied to the
+appropriate arguments, return a result of type bool.
+
+(a) the term not that takes an argument of type bool and computes its negation;
+(b) the term and that takes two arguments of type bool and computes their conjunction;
+(c) the term or that takes two arguments of type bool and computes their disjunction.
+
+The type nat (for "natural number") may be encoded as follows:
+
+ nat := ∀α. α → (α → α) → α
+ zero := Λα. λz:α. λs:α → α. z
+ succ := λn:nat. Λα. λz:α. λs:α → α. s (n [α] z s)
+
+A nat n is defined by what it can do, which is to compute a function iterated n times. In the polymorphic
+encoding above, the result of that iteration can be any type α, as long as you have a base element z : α and
+a function s : α → α.
+
+**Excercise**: get booleans and Church numbers working in OCaml,
+including OCaml versions of bool, true, false, zero, succ, add.
+
+Consider the following list type:
+
+ type ’a list = Nil | Cons of ’a * ’a list
+
+We can encode τ lists, lists of elements of type τ as follows:
+
+ τ list := ∀α. α → (τ → α → α) → α
+ nilτ := Λα. λn:α. λc:τ → α → α. n
+ makeListτ := λh:τ. λt:τ list. Λα. λn:α. λc:τ → α → α. c h (t [α] n c)
+
+As with nats, recursion is built into the datatype.
+
+We can write functions like map:
+
+ map : (σ → τ ) → σ list → τ list
+ = λf :σ → τ. λl:σ list. l [τ list] nilτ (λx:σ. λy:τ list. consτ (f x) y
+
+**Excercise** convert this function to OCaml. Also write an `append` function.
+Test with simple lists.
+
+Consider the following simple binary tree type:
+
+ type ’a tree = Leaf | Node of ’a tree * ’a * ’a tree
+
+**Excercise**
+Write a function `sumLeaves` that computes the sum of all the
+leaves in an int tree.
+
+Write a function `inOrder` : τ tree → τ list that computes the in-order traversal of a binary tree. You
+may assume the above encoding of lists; define any auxiliary functions you need.