XGitUrl: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=content.mdwn;h=6b1153721e9d03a8246bed8de0fd654c53eb3ea1;hp=aaab7a5158e21debbf5500696da14ea453868e23;hb=7936567be1fea69bb7e1bb299bd3d1616b6e2dcc;hpb=31cebc8050836005ee17dd1d20ae81b2ab9afa3c;ds=sidebyside
diff git a/content.mdwn b/content.mdwn
index aaab7a51..6b115372 100644
 a/content.mdwn
+++ b/content.mdwn
@@ 5,18 +5,23 @@ week in which they were introduced.
## Topics by content ##
+* [[What is computation?topics/week3_what_is_computation]]
+
* Functional Programming
* [[Introductiontopics/week1 kapulet intro]]
* [[Week 1 Advanced notestopics/week1 kapulet advanced]]
* [["Rosetta Stone" page #1 for Kaupulet, Scheme, OCaml, Haskellrosetta1]]
* Offsite links for help on [[learning Scheme]], [[OCamllearning OCaml]], and [[Haskelllearning Haskell]]
 * List Comprehensions
+ * [[List Comprehensionstopics/week3 lists#comprehensions]]
+ * [[Unit and its usefulnesstopics/week3 unit]]
+ * More tips on using Scheme
* Order, "static versus dynamic"
* [[Order in programming languages and natural languagetopics/week1 order]]
* Reduction Strategies and Normal Forms in the Lambda Calculus
+ * Usefulness of `()`
* The Lambda Calculus
@@ 27,8 +32,12 @@ week in which they were introduced.
* [[Tuplestopics/week2 encodings#tuples]]
* [[Liststopics/week2 encodings#lists]], v1 (as rightfolds)
* [[Numberstopics/week2 encodings#numbers]], v1 ("Church's encoding")
 * How to get the `tail` of v1 lists?
+ * [[Arithmetic with Church numberstopics/week3_church_arithmetic]]
+ * [[How to get the `tail` of v1 lists?topics/week3 lists#tails]]
+ * [[Some other list encodingstopics/week3 lists#otherlists]]
* Reduction Strategies and Normal Forms
+ * [[Fixed point combinatorstopics/week4_fixed_point_combinators]]
+ * [[More about fixed point combinatorstopics/week4_more_about_fixed_point_combinators]]
* [[Combinatory Logictopics/week3 combinatory logic]]
@@ 51,17 +60,24 @@ Week 2:
* [[Introduction to the Lambda Calculustopics/week2 lambda intro]]
* [[Advanced notes on the Lambda Calculustopics/week2 lambda advanced]]
* [[Encoding Booleans, Tuples, Lists, and Numberstopics/week2 encodings]]
* [[Homework for week 2exercises/assignment2]]
+* [[Homework for week 2exercises/assignment2]] ([[Answersexercises/assignment2_answers]])
Week 3:
* More on Lists
Introduces list comprehensions, discusses how to get the `tail` of lists in the Lambda Calculus
* [[Combinatory Logictopics/week3 combinatory logic]]
* Reduction Strategies and Normal Forms
* Homework for week 3

+*These notes were developed over the course of the week. It'd be a good idea to review them again now, to be sure you've read all the content.*
+* [[Arithmetic with Church numberstopics/week3_church_arithmetic]]
+* [[More on Liststopics/week3 lists]]
+Introduces list comprehensions, discusses how to get the `tail` of lists in the Lambda Calculus, and some new list encodings
+* [[What is computation?topics/week3_what_is_computation]]
+* Reduction Strategies and Normal Forms (will try to post soon)
+* [[Unit and its usefulnesstopics/week3 unit]]
+* [[Combinatory Logictopics/week3 combinatory logic]]
+* [[Homework for week 3exercises/assignment3]] ([[Answersexercises/assignment3_answers]])
*More coming, please wait...*
+Week 4:
+* [[Fixed point combinatorstopics/week4_fixed_point_combinators]]
+* [[More about fixed point combinatorstopics/week4_more_about_fixed_point_combinators]]
+* Towards types (in progress)
+* [[Homework for week 4exercises/assignment4]]