X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=topics%2F_week3_combinatory_logic.mdwn;h=5a176575a2897e9c43c8e15eeef7b75a6f2c1812;hp=59717b83f64da66d15ad715d842fc614939a5c5d;hb=aaf2ff6a5405de529d0272a4692557c5a55e822a;hpb=d9b2cfb131ee863c2ba4e3fa897bbad13eed3cf0

diff --git a/topics/_week3_combinatory_logic.mdwn b/topics/_week3_combinatory_logic.mdwn
index 59717b83..5a176575 100644
--- a/topics/_week3_combinatory_logic.mdwn
+++ b/topics/_week3_combinatory_logic.mdwn
@@ -10,7 +10,7 @@ Lambda expressions that have no free variables are known as **combinators**. Her
            (further) argument to `x`. ("K" for "constant".) Compare K
            to our definition of `true`.
 
->       **S** is defined to be `\f g x. f x (g x)`.  This is a more
+>	**S** is defined to be `\f g x. f x (g x)`.  This is a more
           complicated operation, but is extremely versatile and useful
           (see below): it copies its third argument and distributes it
           over the first two arguments.