week3 evaluator fix

[lambda.git] / week1.mdwn

diff --git a/week1.mdwn b/week1.mdwn
index 7ea30c3..b1df1ad 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:
 
@@ -131,7 +130,7 @@ because here the second occurrence of `y` is no longer free.
 
 There is plenty of discussion of this, and the fine points of how substitution works, in Hankin and in various of the tutorials we've linked to about the lambda calculus. We expect you have a good intuitive understanding of what to do already, though, even if you're not able to articulate it rigorously.
 
-*      MORE
+*      [More discussion in week 2 notes](/week2/#index1h1)
 
 
 Shorthand
@@ -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,7 @@ combinatorial logic</td>
 </table>
 
 
+
 Rosetta Stone
 =============