From 6885a008cfcbb9fed72b19db62a6046665860c44 Mon Sep 17 00:00:00 2001 From: Jim Pryor Date: Wed, 15 Sep 2010 22:33:05 -0400 Subject: [PATCH] week1: fix markup processing? Signed-off-by: Jim Pryor --- week1.mdwn | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/week1.mdwn b/week1.mdwn index 9ee159a9..8484b17f 100644 --- a/week1.mdwn +++ b/week1.mdwn @@ -76,7 +76,7 @@ The lambda calculus has an associated proof theory. For now, we can regard the proof theory as having just one rule, called the rule of **beta-reduction** or "beta-contraction". Suppose you have some expression of the form: - ((\a M) N) + ((lambda a M) N) that is, an application of an abstract to some other expression. This compound form is called a **redex**, meaning it's a "beta-reducible expression." `(\a M)` is called the **head** of the redex; `N` is called the **argument**, and `M` is called the **body**. -- 2.11.0