X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=week1.mdwn;h=967f8144e1b586272051a4667b8bc0b9f2b22df4;hp=7ea30c3d490fbeb0faeb58ca5514014f4fa07b97;hb=fdc741933683621ccad260cf9b8c985d234f48f3;hpb=0d2b33a56cdeba0ca5c4fe605fcd4e7e6d5cdc3d

diff --git a/week1.mdwn b/week1.mdwn
index 7ea30c3d..967f8144 100644
--- a/week1.mdwn
+++ b/week1.mdwn
@@ -37,7 +37,6 @@ We'll tend to write <code>(&lambda;a M)</code> as just `(\a M)`, so we don't hav
 <strong>Application</strong>: <code>(M N)</code>
 </blockquote>
 
-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:
 
@@ -328,7 +327,7 @@ To read further about the relation between declarative or functional programming
 *	[[!wikipedia Purely functional]]
 *	[[!wikipedia Referential transparency (computer science)]]
 *	[[!wikipedia Imperative programming]]
-
+*	[[!wikipedia Side effect (computer science) desc="Side effects"]]
 
 
 Map
@@ -357,6 +356,9 @@ combinatorial logic</td>
 </table>
 
 
+[Correction: OCaml is Turing complete, but I'm not sure if the merely functional part is; I suspect it's not.]
+
+
 Rosetta Stone
 =============