content.mdwn

   1 # Topics #
   2
   3 These topics are organized in two ways: by their content, and by the
   4 week in which they were introduced.
   5
   6 ## Topics by content ##
   7
   8 *   [[What is computation?|topics/week3_what_is_computation]]
   9
  10 *   Functional Programming
  11
  12     *   [[Introduction|topics/week1 kapulet intro]]
  13     *   [[Week 1 Advanced notes|topics/week1 kapulet advanced]]
  14     *   [["Rosetta Stone" page #1 for Kaupulet, Scheme, OCaml, Haskell|rosetta1]]
  15     *   Offsite links for help on [[learning Scheme]], [[OCaml|learning OCaml]], and [[Haskell|learning Haskell]]
  16     *   [[List Comprehensions|topics/week3 lists#comprehensions]]
  17
  18 *   Order, "static versus dynamic"
  19
  20     *    [[Order in programming languages and natural language|topics/week1 order]]
  21     *    Reduction Strategies and Normal Forms in the Lambda Calculus
  22
  23 *   The Lambda Calculus
  24
  25     *   [[Introduction to the Lambda Calculus|topics/week2 lambda intro]]
  26     *   [[Advanced notes on the Lambda Calculus|topics/week2 lambda advanced]]
  27     *   Encoding data types in the Lambda Calculus
  28         *   [[Booleans|topics/week2 encodings#booleans]]
  29         *   [[Tuples|topics/week2 encodings#tuples]]
  30         *   [[Lists|topics/week2 encodings#lists]], v1 (as right-folds)
  31         *   [[Numbers|topics/week2 encodings#numbers]], v1 ("Church's encoding")
  32         *   [[How to get the `tail` of v1 lists?|topics/week3 lists#tails]]
  33     *    Reduction Strategies and Normal Forms
  34
  35
  36 *    [[Combinatory Logic|topics/week3 combinatory logic]]
  37
  38
  39 ## Topics by week ##
  40
  41 Week 1:
  42
  43 *   [[Order in programming languages and natural language|topics/week1 order]]
  44 This discussion considers conjunction in a language that recognized presupposition failure.
  45 *   [[Introduction to functional programming|topics/week1 kapulet intro]]
  46 Basics of functional programming: `let`, `case`, pattern matching, and
  47 recursion.  Definitions of factorial.
  48 *   [[Advanced notes on functional programming|topics/week1 kapulet advanced]]
  49 *   [[Homework for week 1|exercises/assignment1]] ([[Answers|exercises/assignment1_answers]])
  50
  51 Week 2:
  52
  53 *   [[Introduction to the Lambda Calculus|topics/week2 lambda intro]]
  54 *   [[Advanced notes on the Lambda Calculus|topics/week2 lambda advanced]]
  55 *   [[Encoding Booleans, Tuples, Lists, and Numbers|topics/week2 encodings]]
  56 *   [[Homework for week 2|exercises/assignment2]]
  57
  58 Week 3:
  59
  60 *   [[What is computation?|topics/week3_what_is_computation]]
  61 *   [[More on Lists|topics/week3 lists]]
  62 Introduces list comprehensions, discusses how to get the `tail` of lists in the Lambda Calculus
  63 *   [[Combinatory Logic|topics/week3 combinatory logic]]
  64 *   Reduction Strategies and Normal Forms
  65 *   Homework for week 3
  66
  67
  68
  69 *More coming, please wait...*
  70