X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=content.mdwn;h=0a6fa2dee44aed1bd6af0cf0c9384e9b1434c938;hp=99686d4a5e20f33bb85e3ce46585a7f9afa9efc7;hb=588916b85952d356b51cccea0fb38b8cc1582174;hpb=0e07032ec1fdb3dae922e91a8edc1d6802dc982f diff --git a/content.mdwn b/content.mdwn index 99686d4a..0a6fa2de 100644 --- a/content.mdwn +++ b/content.mdwn @@ -13,12 +13,15 @@ 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]] + * 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 @@ -29,7 +32,9 @@ 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 @@ -55,16 +60,16 @@ Week 2: * [[Encoding Booleans, Tuples, Lists, and Numbers|topics/week2 encodings]] * [[Homework for week 2|exercises/assignment2]] -Week 3:But even deci +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.* + +* [[Arithmetic with Church numbers|topics/week3_church_arithmetic]] * [[What is computation?|topics/week3_what_is_computation]] -* More on Lists -Introduces list comprehensions, discusses how to get the `tail` of lists in the Lambda Calculus +* [[More on Lists|topics/week3 lists]] +Introduces list comprehensions, discusses how to get the `tail` of lists in the Lambda Calculus (and will discuss some other list encodings) * [[Combinatory Logic|topics/week3 combinatory logic]] * Reduction Strategies and Normal Forms -* Homework for week 3 - - - -*More coming, please wait...* +* Usefulness of `()` +* [[Homework for week 3|exercises/assignment3]]