From 5739a5066020a0e9dd46e0299165faadb59fc438 Mon Sep 17 00:00:00 2001 From: Jim Pryor Date: Wed, 15 Sep 2010 22:34:51 -0400 Subject: [PATCH] week1: fix markup processing? Signed-off-by: Jim Pryor --- week1.mdwn | 20 +++++++++----------- 1 file changed, 9 insertions(+), 11 deletions(-) diff --git a/week1.mdwn b/week1.mdwn index 8484b17f..f09f393d 100644 --- a/week1.mdwn +++ b/week1.mdwn @@ -61,22 +61,20 @@ Some authors reserve the term "term" for just variables and abstracts. We won't Examples of expressions: -
-x -(y x) -(x x) -(\x y) -(\x x) -(\x (\y x)) -(x (\x x)) -((\x (x x)) (\x (x x))) -
+ x + (y x) + (x x) + (\x y) + (\x x) + (\x (\y x)) + (x (\x x)) + ((\x (x x)) (\x (x x))) 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: - ((lambda a M) N) + ((\ 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