From: Jim Pryor <profjim@jimpryor.net>
Date: Sun, 3 Oct 2010 17:00:22 +0000 (-0400)
Subject: proof of fixed points: W->L, be more specific about '='
X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=commitdiff_plain;h=7b3b1c578a8c6d50c71ab570a1a49a1c3385ca62

proof of fixed points: W->L, be more specific about '='

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

diff --git a/week4.mdwn b/week4.mdwn
index e69832fd..5e219484 100644
--- a/week4.mdwn
+++ b/week4.mdwn
@@ -6,11 +6,11 @@ A: That's easy: let `T` be an arbitrary term in the lambda calculus.  If
 `T` has a fixed point, then there exists some `X` such that `X <~~>
 TX` (that's what it means to *have* a fixed point).
 
-<pre>
-let W = \x.T(xx) in
-let X = WW in
-X = WW = (\x.T(xx))W = T(WW) = TX
-</pre>
+<pre><code>
+let L = \x. T (x x) in
+let X = L L in
+X &equiv; L L &equiv; (\x. T (x x)) L ~~> T (L L) &equiv; T X
+</code></pre>
 
 Please slow down and make sure that you understand what justified each
 of the equalities in the last line.