From 8d1accffb8ffedf0d183a1b166b0fc19fe8c110f Mon Sep 17 00:00:00 2001 From: jim Date: Sat, 14 Feb 2015 17:50:07 -0500 Subject: [PATCH] tweak --- topics/week3_combinatory_logic.mdwn | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/topics/week3_combinatory_logic.mdwn b/topics/week3_combinatory_logic.mdwn index a86f711b..4c92bfc6 100644 --- a/topics/week3_combinatory_logic.mdwn +++ b/topics/week3_combinatory_logic.mdwn @@ -24,9 +24,9 @@ complicated operation, but is extremely versatile and useful (see below): it copies its third argument and distributes it over the first two arguments. -> **get-first** was our function for extracting the first element of an ordered pair: `\fst snd. fst`. Compare this to `K` and `true` as well. +> **fst** was our function for extracting the first element of an ordered pair: `\a b. a`. Compare this to `K` and `true` as well. -> **get-second** was our function for extracting the second element of an ordered pair: `\fst snd. snd`. Compare this to our definition of `false`. +> **snd** was our function for extracting the second element of an ordered pair: `\a b. b`. Compare this to our definition of `false`. > **B** is defined to be: `\f g x. f (g x)`. (So `B f g` is the composition `\x. f (g x)` of `f` and `g`.) -- 2.11.0