index ffe6288..0a6fa2d 100644 (file)
@@ -5,18 +5,23 @@ week in which they were introduced.

## Topics by content ##

+*   [[What is computation?|topics/week3_what_is_computation]]
+
*   Functional Programming

*   [[Introduction|topics/week1 kapulet intro]]
*   [["Rosetta Stone" page #1 for Kaupulet, Scheme, OCaml, Haskell|rosetta1]]
-    *   List Comprehensions
+    *   [[List Comprehensions|topics/week3 lists#comprehensions]]
+    *   Usefulness of `()`
+    *   More tips on using Scheme

*   Order, "static versus dynamic"

*    [[Order in programming languages and natural language|topics/week1 order]]
*    Reduction Strategies and Normal Forms in the Lambda Calculus
+    *   Usefulness of `()`

*   The Lambda Calculus

@@ -27,11 +32,13 @@ 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?
+        *   [[Arithmetic with Church numbers|topics/week3_church_arithmetic]]
+        *   [[How to get the `tail` of v1 lists?|topics/week3 lists#tails]]
+        *   Some other list encodings
*    Reduction Strategies and Normal Forms

-*    Combinatorial Logic
+*    [[Combinatory Logic|topics/week3 combinatory logic]]

## Topics by week ##
@@ -44,7 +51,7 @@ This discussion considers conjunction in a language that recognized presuppositi
Basics of functional programming: `let`, `case`, pattern matching, and
recursion.  Definitions of factorial.
-*   [[Homework for week 1|exercises/assignment1]]

Week 2:

@@ -55,13 +62,14 @@ Week 2:

Week 3:

-*   More on Lists
-Introduces list comprehensions, discusses how to get the `tail` of lists in the Lambda Calculus
-*   Combinatorial Logic
-*   Reduction Strategies and Normal Forms
-*   Homework for week 3
-
+*We will continue to develop these notes over the next few days. Expect some of the notes already posted to be expanded, and more notes to appear.*

-