(no commit message)

diff --git a/topics/_week3_combinatory_logic.mdwn b/topics/_week3_combinatory_logic.mdwn
index 59717b8..5a17657 100644 (file)
--- 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`.
 
            (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.
           complicated operation, but is extremely versatile and useful
           (see below): it copies its third argument and distributes it
           over the first two arguments.