X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=week2.mdwn;h=e6771bfe87918747fdf7e178a9d163d4e465f4f2;hp=2612dd2b6118c2f50504f238948056d00e2a83b7;hb=c9f0198dac937d93c73815bc1149921718af88c7;hpb=d801b3fb06e2a6a6d7c3d205c6b3d247b237b35d;ds=sidebyside

diff --git a/week2.mdwn b/week2.mdwn
index 2612dd2b..e6771bfe 100644
--- a/week2.mdwn
+++ b/week2.mdwn
@@ -148,7 +148,7 @@ Let's check that the translation of the false boolean behaves as expected by fee
 
 Throws away the first argument, returns the second argument---yep, it works.
 
-Here's a more elaborat example of the translation.  The goal is to establish that combinators can reverse order, so we use the T combinator, where `T = \x\y.yx`:
+Here's a more elaborate example of the translation.  The goal is to establish that combinators can reverse order, so we use the T combinator, where `T = \x\y.yx`:
 
     [\x\y.yx] = [\x[\y.yx]] = [\x.S[\y.y][\y.x]] = [\x.(SI)(Kx)] = S[\x.SI][\x.Kx] = S(K(SI))(S[\x.K][\x.x]) = S(K(SI))(S(KK)I)