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