week2: comments about alpha-conversion, de Bruijn

[lambda.git] / week1.mdwn

diff --git a/week1.mdwn b/week1.mdwn
index 7ea30c3..967f814 100644 (file)
--- 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
 =============