X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=content.mdwn;h=99686d4a5e20f33bb85e3ce46585a7f9afa9efc7;hp=322615c50244941119a54f50373ba0ab08e56b85;hb=8b4fc32ec904cba61e9fd304c971f9e5dc465d88;hpb=56e557c41574b65a943890c99ba3cee350ede223 diff --git a/content.mdwn b/content.mdwn index 322615c5..99686d4a 100644 --- a/content.mdwn +++ b/content.mdwn @@ -5,45 +5,64 @@ week in which they were introduced. ## Topics by content ## -* [[Introduction to functional programming|topics/week1 kapulet intro]] +* [[What is computation?|topics/week3_what_is_computation]] -* [[Order: static versus dynamic|topics/week1 order]] +* Functional Programming -* The Lambda Calculus + * [[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 - * [[Intro to the Lambda Calculus|topics/week2 lambda intro]] +* Order, "static versus dynamic" - * [[Advanced notes on the Lambda Calculus|topics/week2 lambda advanced]] + * [[Order in programming languages and natural language|topics/week1 order]] + * Reduction Strategies and Normal Forms in the Lambda Calculus - * Encoding data types in the Lambda Calculus +* The Lambda Calculus + + * [[Introduction to the Lambda Calculus|topics/week2 lambda intro]] + * [[Advanced notes on the Lambda Calculus|topics/week2 lambda advanced]] + * Encoding data types in the Lambda Calculus + * [[Booleans|topics/week2 encodings#booleans]] + * [[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? + * Reduction Strategies and Normal Forms + + +* [[Combinatory Logic|topics/week3 combinatory logic]] - * [[Booleans, Tuples, Lists, and Numbers|topics/week2 encodings]] ## Topics by week ## Week 1: -* [[Order in programming languages and natural language|topics/week1 order]] +* [[Order in programming languages and natural language|topics/week1 order]] This discussion considers conjunction in a language that recognized presupposition failure. -* [[Introduction to functional programming|topics/week1 kapulet intro]] +* [[Introduction to functional programming|topics/week1 kapulet intro]] Basics of functional programming: `let`, `case`, pattern matching, and recursion. Definitions of factorial. -* [[Advanced notes on functional programming|topics/week1 kapulet advanced]] -* [[Homework for week 1|exercises/assignment1]] +* [[Advanced notes on functional programming|topics/week1 kapulet advanced]] +* [[Homework for week 1|exercises/assignment1]] ([[Answers|exercises/assignment1_answers]]) Week 2: -* [[Introduction to the Lambda Calculus|topics/week2 lambda intro]] -* [[Advanced notes on the Lambda Calculus|topics/week2 lambda advanced]] -* [[Encoding Booleans, Tuples, Lists, and Numbers|topics/week2 encodings]]; -* [[Homework for week 2|exercises/assignment2]] +* [[Introduction to the Lambda Calculus|topics/week2 lambda intro]] +* [[Advanced notes on the Lambda Calculus|topics/week2 lambda advanced]] +* [[Encoding Booleans, Tuples, Lists, and Numbers|topics/week2 encodings]] +* [[Homework for week 2|exercises/assignment2]] -Week 3: +Week 3:But even deci -* More on Lists -Introduces list comprehensions, shows how to encode `tail` in the Lambda Calculus -* Combinatorial Logic -* Homework for week 3 +* [[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 +* [[Combinatory Logic|topics/week3 combinatory logic]] +* Reduction Strategies and Normal Forms +* Homework for week 3