From 38e98c659e1819ddd4457935508ee12824b50241 Mon Sep 17 00:00:00 2001
From: chris
Date: Mon, 9 Feb 2015 17:18:33 -0500
Subject: [PATCH]
---
topics/_week3_combinatory_logic.mdwn | 2 +-
1 file changed, 1 insertion(+), 1 deletion(-)
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.
--
2.11.0