From: Jim Pryor <profjim@jimpryor.net>
Date: Tue, 26 Oct 2010 14:44:50 +0000 (-0400)
Subject: ass5: more formatting
X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=commitdiff_plain;h=a62a6d29714711535dd7a1eb6a1d0611bf4f739b

ass5: more formatting

Signed-off-by: Jim Pryor <profjim@jimpryor.net>
---

diff --git a/assignment5.mdwn b/assignment5.mdwn
index 85ac9a18..fab21e49 100644
--- a/assignment5.mdwn
+++ b/assignment5.mdwn
@@ -123,56 +123,59 @@ and that "bool" is any boolean.  Then we can try the following:
 
 	[[Hint assignment 5 problem 3]]
 
-Booleans, Church numbers, and Church lists in OCaml
----------------------------------------------------
+Booleans, Church numerals, and v3 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, v3 lists, and
-binary trees working in OCaml.
+Let's think about the encodings of booleans, numerals and lists in System F, and get datastructures with the same explicit form working in OCaml. (The point... so we won't rely on OCaml's native booleans, integers, or lists.)
 
 Recall from class System F, or the polymorphic λ-calculus.
 
-	τ ::= α | τ1 → τ2 | ∀α. τ
-	e ::= x | λx:τ. e | e1 e2 | Λα. e | e [τ ]
+	types τ ::= c | 'a | τ1 → τ2 | ∀'a. τ
+	expressions e ::= x | λx:τ. e | e1 e2 | Λ'a. e | e [τ]
 
-Recall that bool may be encoded as follows:
+The boolean type, and its two values, may be encoded as follows:
 
-	bool := ∀α. α → α → α
-	true := Λα. λt:α. λf :α. t
-	false := Λα. λt:α. λf :α. f
+	bool := ∀'a. 'a → 'a → 'a
+	true := Λ'a. λt:'a. λf :'a. t
+	false := Λ'a. λt:'a. λf :'a. f
 
-(where τ indicates the type of e1 and e2)
+It's used like this:
 
-Note that each of the following terms, when applied to the
-appropriate arguments, return a result of type bool.
+	b [τ] e1 e2
+
+where b is a boolean value, and τ is the shared type of e1 and e2.
+
+**Exercise**. How should we implement the following terms. Note that the result of applying them to the appropriate arguments should also give us a term 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)
+	nat := ∀'a. 'a → ('a → 'a) → 'a
+	zero := Λ'a. λz:'a. λs:'a → 'a. z
+	succ := λn:nat. Λ'a. λz:'a. λs:'a → 'a. s (n ['a] 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 : α → α.
+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 'a, as long as you have a base element z : 'a and a function s : 'a → 'a.
 
 **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
+	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)
+	τ list := ∀'a. 'a → (τ → 'a → 'a) → 'a
+	nilτ := Λ'a. λn:'a. λc:τ → 'a → 'a. n
+	makeListτ := λh:τ. λt:τ list. Λ'a. λn:'a. λc:τ → 'a → 'a. c h (t ['a] n c)
 
 As with nats, recursion is built into the datatype.
 
@@ -186,7 +189,7 @@ Test with simple lists.
 
 Consider the following simple binary tree type:
 
-	type ’a tree = Leaf | Node of ’a tree * ’a * ’a tree
+	type 'a tree = Leaf | Node of 'a tree * 'a * 'a tree
 
 **Excercise**
 Write a function `sumLeaves` that computes the sum of all the