From e8fef07715c72bf4fc4995aacdea55f2552ed165 Mon Sep 17 00:00:00 2001 From: jim Date: Tue, 17 Feb 2015 22:55:31 -0500 Subject: [PATCH] fix markup --- 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 5f686499..5e842ebd 100644 --- a/topics/week3_combinatory_logic.mdwn +++ b/topics/week3_combinatory_logic.mdwn @@ -252,7 +252,7 @@ Wait, what is that `@a ...` business? Well, that's another operation on (a varia 6. @a(Xa) = X if a is not in X 7. @a(XY) = S(@aX)(@aY) -Think of `@aX` as a pseudo-lambda abstract. (Hankin and Barendregt write it as λ*a. X; Hindley &anp; Seldin write it as `[a] X`.) It is possible to omit line 6, and some presentations do, but Hindley & Seldin observe that this "enormously increases" the length of "most" translations. +Think of `@aX` as a pseudo-lambda abstract. (Hankin and Barendregt write it as λ*a. X; Hindley & Seldin write it as `[a] X`.) It is possible to omit line 6, and some presentations do, but Hindley & Seldin observe that this "enormously increases" the length of "most" translations. It's easy to understand these rules based on what `S`, `K` and `I` do. -- 2.11.0