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     *   [[Unit and its usefulness|topics/week3 unit]]
  18     *   More tips on using Scheme
  19     *   Types in OCaml and Haskell (will be posted soon)
  20     *   Practical advice for working with OCaml and/or Haskell (will be posted soon)
  21
  22 *   Order, "static versus dynamic"
  23
  24     *   [[Order in programming languages and natural language|topics/week1 order]]
  25     *   [[Reduction Strategies and Normal Forms in the Lambda Calculus|topics/week3_evaluation_order]]
  26     *   [[Unit and its usefulness|topics/week3 unit]]
  27
  28 *   The Untyped Lambda Calculus
  29
  30     *   [[Introduction to the Lambda Calculus|topics/week2 lambda intro]]
  31     *   [[Advanced notes on the Lambda Calculus|topics/week2 lambda advanced]]
  32     *   Encoding data types in the Lambda Calculus
  33         *   [[Booleans|topics/week2 encodings#booleans]]
  34         *   [[Tuples|topics/week2 encodings#tuples]]
  35         *   [[Lists|topics/week2 encodings#lists]], v1 (as right-folds)
  36         *   [[Numbers|topics/week2 encodings#numbers]], v1 ("Church's encoding")
  37         *   [[Arithmetic with Church numbers|topics/week3_church_arithmetic]]
  38         *   [[How to get the `tail` of v1 lists?|topics/week3 lists#tails]]
  39         *   [[Some other list encodings|topics/week3 lists#other-lists]]
  40     *   [[Reduction Strategies and Normal Forms|topics/week3_evaluation_order]]
  41     *   [[Fixed point combinators|topics/week4_fixed_point_combinators]]
  42     *   [[More about fixed point combinators|topics/week4_more_about_fixed_point_combinators]]
  43
  44 *   [[Combinatory Logic|topics/week3 combinatory logic]]
  45
  46 *   Typed Lambda Calculi
  47
  48     *   [[Simply-typed lambda calculus|topics/week5 simply typed]] (will be updated)
  49     *   [[System F|topics/week5 system F]] (will be updated)
  50     *   Types in OCaml and Haskell (will be posted soon)
  51
  52
  53 ## Topics by week ##
  54
  55 Week 1:
  56
  57 *   [[Order in programming languages and natural language|topics/week1 order]]
  58 This discussion considers conjunction in a language that recognized presupposition failure.
  59 *   [[Introduction to functional programming|topics/week1 kapulet intro]]
  60 Basics of functional programming: `let`, `case`, pattern matching, and
  61 recursion.  Definitions of factorial.
  62 *   [[Advanced notes on functional programming|topics/week1 kapulet advanced]]
  63 *   [[Homework for week 1|exercises/assignment1]] ([[Answers|exercises/assignment1_answers]])
  64
  65 Week 2:
  66
  67 *   [[Introduction to the Lambda Calculus|topics/week2 lambda intro]]
  68 *   [[Advanced notes on the Lambda Calculus|topics/week2 lambda advanced]]
  69 *   [[Encoding Booleans, Tuples, Lists, and Numbers|topics/week2 encodings]]
  70 *   [[Homework for week 2|exercises/assignment2]] ([[Answers|exercises/assignment2_answers]])
  71
  72 Week 3:
  73
  74 *These notes were developed over the course of the week. It'd be a good idea to review them again now, to be sure you've read all the content.*
  75
  76 *   [[Arithmetic with Church numbers|topics/week3_church_arithmetic]]
  77 *   [[More on Lists|topics/week3 lists]]
  78 Introduces list comprehensions, discusses how to get the `tail` of lists in the Lambda Calculus, and some new list encodings
  79 *   [[What is computation?|topics/week3_what_is_computation]]
  80 *   [[Reduction Strategies and Normal Forms|topics/week3_evaluation_order]] (posted on Monday 23 Feb)
  81 *   [[Unit and its usefulness|topics/week3 unit]]
  82 *   [[Combinatory Logic|topics/week3 combinatory logic]]
  83 *   [[Homework for week 3|exercises/assignment3]] ([[Answers|exercises/assignment3_answers]])
  84
  85 Week 4:
  86
  87 *   [[Fixed point combinators|topics/week4_fixed_point_combinators]]
  88 *   [[More about fixed point combinators|topics/week4_more_about_fixed_point_combinators]]
  89 *   Towards types (in progress)
  90 *   [[Homework for week 4|exercises/assignment4]]
  91
  92 Week 5:
  93
  94 *Note*: Jim will be updating and expanding the lecture notes by Tuesday, but doesn't want to delay any longer letting you have access to the drafts we (in part) presented from in seminar. But do come back and re-read the pages when the expanded versions are posted.
  95
  96 *   [[Simply-typed lambda calculus|topics/week5 simply typed]]
  97 *   [[System F|topics/week5 system F]]
  98 *   Types in OCaml and Haskell (will be posted soon)
  99 *   Practical advice for working with OCaml and/or Haskell (will be posted soon)
 100 *   [[Homework for weeks 5 and 6|exercises/assignment5]]
 101
 102 Outside readings for week 6:
 103
 104 *   [[footnote|readings/kaplan-plexy.pdf]] from Kaplan's *Demonstratives* about "Plexy"
 105 *   Michael Rieppel, "[[Being Something: Properties and Predicative Quantification|readings/rieppel-beingsthg.pdf]]
 106 *   Optional: Jeff King, from *The Nature and Structure of Content*, on the difference between clausal complements and "the proposition that P", "the fact that P"