tweaks, links

[lambda.git] / content.mdwn

diff --git a/content.mdwn b/content.mdwn
index 5294550..d4b51d1 100644 (file)
--- a/content.mdwn
+++ b/content.mdwn
@@ -5,13 +5,15 @@ week in which they were introduced.
 
 ## Topics by content ##
 
+*   [[What is computation?|topics/week3_what_is_computation]]
+
 *   Functional Programming
 
     *   [[Introduction|topics/week1 kapulet intro]]
     *   [[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"
 
@@ -27,11 +29,11 @@ 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
 
 
-*    Combinatorial Logic
+*    [[Combinatory Logic|topics/week3 combinatory logic]]
 
 
 ## Topics by week ##
@@ -55,9 +57,10 @@ Week 2:
 
 Week 3:
 
-*   More on Lists
+*   [[What is computation?|topics/week3_what_is_computation]]
+*   [[More on Lists|topics/week3 lists]]
 Introduces list comprehensions, discusses how to get the `tail` of lists in the Lambda Calculus
-*   Combinatorial Logic
+*   [[Combinatory Logic|topics/week3 combinatory logic]]
 *   Reduction Strategies and Normal Forms
 *   Homework for week 3