X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=week1.mdwn;h=c13fa7ca8787de96d87d81694544064fa1654522;hp=801ae6984609be27b76abc8ca7f378fc93020dc6;hb=93600ef645fa8bbb304288ea2161ec06b017762e;hpb=787216b36925c3757985a48ced39d6eee1ee5392
diff --git a/week1.mdwn b/week1.mdwn
index 801ae698..c13fa7ca 100644
--- a/week1.mdwn
+++ b/week1.mdwn
@@ -59,7 +59,6 @@ We'll tend to write (λa M)
as just `(\a M)`, so we don't hav
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:
x
@@ -70,7 +69,6 @@ Examples of expressions:
(\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
@@ -605,7 +603,6 @@ Here's how it looks to say the same thing in various of these languages.
It's easy to be lulled into thinking this is a kind of imperative construction. *But it's not!* It's really just a shorthand for the compound "let"-expressions we've already been looking at, taking the maximum syntactically permissible scope. (Compare the "dot" convention in the lambda calculus, discussed above.)
-
9. Some shorthand
OCaml permits you to abbreviate:
@@ -654,6 +651,8 @@ Here's how it looks to say the same thing in various of these languages.
or in other words, interpret the rest of the file or interactive session with `bar` assigned the function `(lambda (x) B)`.
+
Some more comparisons between Scheme and OCaml
----------------------------------------------