From 9452f39dcc5b7babde45142e2b24e3617813d6a6 Mon Sep 17 00:00:00 2001 From: Jim Pryor Date: Wed, 15 Sep 2010 22:40:28 -0400 Subject: [PATCH] week1: fix markup processing? Signed-off-by: Jim Pryor --- week1.mdwn | 20 +------------------- 1 file changed, 1 insertion(+), 19 deletions(-) diff --git a/week1.mdwn b/week1.mdwn index f09f393d..5ae3e65f 100644 --- a/week1.mdwn +++ b/week1.mdwn @@ -39,25 +39,7 @@ Basics of Lambda Calculus The lambda calculus we'll be focusing on for the first part of the course has no types. (Some prefer to say it instead has a single type---but if you say that, you have to say that functions from this type to this type also belong to this type. Which is weird.) -Here is its syntax: - -
-Variables: x, y, z... -
- -Each variable is an expression. For any expressions M and N and variable a, the following are also expressions: - -
-Abstract: (λa M) -
- -We'll tend to write (λa M) as just `(\a M)`, so we don't have to write out the markup code for the λ. You can yourself write (λa M) or `(\a M)` or `(lambda a M)`. - -
-Application: (M N) -
- -Some authors reserve the term "term" for just variables and abstracts. We won't participate in that convention; we'll probably just say "term" and "expression" indiscriminately for expressions of any of these three forms. +Some authors reserve the term "term" for just variables and abstracts. We'll probably just say "term" and "expression" indiscriminately for expressions of any of these three forms. Examples of expressions: -- 2.11.0