link to lambda library

[lambda.git] / week4.mdwn

diff --git a/week4.mdwn b/week4.mdwn
index 8fe37ad..8714eae 100644 (file)
--- a/week4.mdwn
+++ b/week4.mdwn
@@ -217,7 +217,7 @@ and so on.
 
 #Typed lambda terms#
 
-Given a set of types `T`, we define the set of typed lambda terms <code>&Lamda;_T</code>,
+Given a set of types `T`, we define the set of typed lambda terms <code>&Lambda;_T</code>,
 which is the smallest set such that
 
 *    each type `t` has an infinite set of distinct variables, {x^t}_1,
@@ -227,12 +227,12 @@ which is the smallest set such that
      &sigma;, then the application `(M N)` has type &tau;.
 
 *    If a variable `a` has type &sigma;, and term `M` has type &tau;, 
-     then the abstract `&lambda; a M` has type `&sigma; --> &tau;`.
+     then the abstract <code>&lambda; a M</code> has type &sigma; --> &tau;.
 
 The definitions of types and of typed terms should be highly familiar
-to semanticists, except that instead of writing `&sigma; --> &tau;`,
-linguists (following Montague, who followed Church) write `<&sigma;,
-&tau;>`.  We will use the arrow notation, since it is more iconic.
+to semanticists, except that instead of writing &sigma; --> &tau;,
+linguists (following Montague, who followed Church) write <&sigma;,
+&tau;>.  We will use the arrow notation, since it is more iconic.
 
 Some examples (assume that `x` has type `o`):