From: jim <jim@web>
Date: Thu, 12 Feb 2015 18:09:51 +0000 (-0500)
Subject: tweaks, links
X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=commitdiff_plain;h=5646e29791bf39b18c894926f12fd57dd192941b

tweaks, links
---

diff --git a/content.mdwn b/content.mdwn
index 99686d4a..d4b51d12 100644
--- a/content.mdwn
+++ b/content.mdwn
@@ -13,7 +13,7 @@ week in which they were introduced.
     *   [[Week 1 Advanced notes|topics/week1 kapulet advanced]]
     *   [["Rosetta Stone" page #1 for Kaupulet, Scheme, OCaml, Haskell|rosetta1]]
     *   Offsite links for help on [[learning Scheme]], [[OCaml|learning OCaml]], and [[Haskell|learning Haskell]]
-    *   List Comprehensions
+    *   [[List Comprehensions|topics/week3 lists#comprehensions]]
 
 *   Order, "static versus dynamic"
 
@@ -29,7 +29,7 @@ week in which they were introduced.
         *   [[Tuples|topics/week2 encodings#tuples]]
         *   [[Lists|topics/week2 encodings#lists]], v1 (as right-folds)
         *   [[Numbers|topics/week2 encodings#numbers]], v1 ("Church's encoding")
-        *   How to get the `tail` of v1 lists?
+        *   [[How to get the `tail` of v1 lists?|topics/week3 lists#tails]]
     *    Reduction Strategies and Normal Forms
 
 
@@ -55,10 +55,10 @@ Week 2:
 *   [[Encoding Booleans, Tuples, Lists, and Numbers|topics/week2 encodings]]
 *   [[Homework for week 2|exercises/assignment2]]
 
-Week 3:But even deci
+Week 3:
 
 *   [[What is computation?|topics/week3_what_is_computation]]
-*   More on Lists
+*   [[More on Lists|topics/week3 lists]]
 Introduces list comprehensions, discusses how to get the `tail` of lists in the Lambda Calculus
 *   [[Combinatory Logic|topics/week3 combinatory logic]]
 *   Reduction Strategies and Normal Forms