From 9873c23f4967dc8a1dc03bd57a20bf73db1ac721 Mon Sep 17 00:00:00 2001
From: chris <chris@web>
Date: Wed, 25 Feb 2015 21:43:42 -0500
Subject: [PATCH]

---
 topics/_week5_system_F.mdwn | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/topics/_week5_system_F.mdwn b/topics/_week5_system_F.mdwn
index 55f49aed..f7537090 100644
--- a/topics/_week5_system_F.mdwn
+++ b/topics/_week5_system_F.mdwn
@@ -118,7 +118,7 @@ relevant evaluator is called "fullpoly"):
 
     N = ∀α.(α->α)->α->α;
     Pair = (N->N->N)->N;
-    let zero = Λα.λs:α->α.λz:α. z in 
+    let zero = Λα.λs:α->α.λz:α.z in 
     let fst = λx:N.λy:N.x in
     let snd = λx:N.λy:N.y in
     let pair = λx:N.λy:N.λz:N->N->N.z x y in
@@ -137,7 +137,7 @@ lambda).
 
 The key to the extra expressive power provided by System F is evident
 in the typing imposed by the definition of `pre`.  The variable `n` is
-typed as a Church number, i.e., as `∀ α . (α->α)->α->α`.  The type
+typed as a Church number, i.e., as `∀α.(α->α)->α->α`.  The type
 application `n [Pair]` instantiates `n` in a way that allows it to
 manipulate ordered pairs: `n [Pair]: (Pair->Pair)->Pair->Pair`.  In
 other words, the instantiation turns a Church number into a
@@ -164,14 +164,14 @@ Typing &omega;
 In fact, unlike in the simply-typed lambda calculus, 
 it is even possible to give a type for &omega; in System F. 
 
-<code>&omega; = λlambda x:(∀ α. α->α) . x [∀ α . α->α] x</code>
+<code>&omega; = λx:(∀α.α->α).x [∀α.α->α] x</code>
 
 In order to see how this works, we'll apply &omega; to the identity
 function.  
 
 <code>&omega; id ==</code>
 
-    (λx:(∀α. α->α) . x [∀α.α->α] x) (Λα.λx:α. x)
+    (λx:(∀α.α->α). x [∀α.α->α] x) (Λα.λx:α.x)
 
 Since the type of the identity function is `∀α.α->α`, it's the
 right type to serve as the argument to &omega;.  The definition of
-- 
2.11.0