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 *   [[Kaplan on Plexy|topics/week6_plexy]]
  11 *   [[Groenendijk, Stokhof, and Veltman|/topics/week10_gsv]]
  12 *   Mutation and hyper-synonymy (no notes)
  13
  14
  15 *   Functional Programming
  16
  17     *   [[Introduction|topics/week1 kapulet intro]]
  18     *   [[Week 1 Advanced notes|topics/week1 kapulet advanced]]
  19     *   [["Rosetta Stone" page #1 for Kaupulet, Scheme, OCaml, Haskell|rosetta1]]
  20     *   Offsite links for help on [[learning Scheme]], [[OCaml|learning OCaml]], and [[Haskell|learning Haskell]]
  21     *   [[List Comprehensions|topics/week3 lists#comprehensions]]
  22     *   [[Unit and its usefulness|topics/week3 unit]]
  23     *   More tips on using Scheme
  24     *   Types in OCaml and Haskell (will be posted someday)
  25     *   Practical advice for working with OCaml and/or Haskell (will be posted someday)
  26     *   [[Kaplan on Plexy|topics/week6_plexy]] and the Maybe type
  27     *   Untyped lambda evaluator ([[in browser|code/lambda_evaluator]]) ([[for home|topics/week7_untyped_evaluator]])
  28     *   [[Ramble on Monads and Modules|topics/week8_monads_and_modules]]
  29     *   [[Installing and Using the Juli8 Libraries|/juli8]]
  30     *   [[Programming with mutable state|/topics/week9_mutable_state]]
  31     *   Mutation and hyper-synonymy (no notes)
  32
  33
  34 *   Order, "static versus dynamic"
  35
  36     *   [[Order in programming languages and natural language|topics/week1 order]]
  37     *   [[Reduction Strategies and Normal Forms in the Lambda Calculus|topics/week3_evaluation_order]]
  38     *   [[Unit and its usefulness|topics/week3 unit]]
  39     *   Combinatory evaluator ([[for home|topics/week7_combinatory_evaluator]])
  40     *   [[Programming with mutable state|/topics/week9_mutable_state]]
  41     *   [[Abortable list traversals|/topics/week12_abortable_traversals]]
  42     *   [[List and tree zippers|/topics/week12_list_and_tree_zippers]]
  43
  44
  45 *   The Untyped Lambda Calculus
  46
  47     *   [[Introduction to the Lambda Calculus|topics/week2 lambda intro]]
  48     *   [[Advanced notes on the Lambda Calculus|topics/week2 lambda advanced]]
  49     *   Encoding data types in the Lambda Calculus
  50         *   [[Booleans|topics/week2 encodings#booleans]]
  51         *   [[Tuples|topics/week2 encodings#tuples]]
  52         *   [[Lists|topics/week2 encodings#lists]], v1 (as right-folds)
  53         *   [[Numbers|topics/week2 encodings#numbers]], v1 ("Church's encoding")
  54         *   [[Arithmetic with Church numbers|topics/week3_church_arithmetic]]
  55         *   [[How to get the `tail` of v1 lists?|topics/week3 lists#tails]]
  56         *   [[Some other list encodings|topics/week3 lists#other-lists]]
  57         *   [[Abortable list traversals|/topics/week12_abortable_traversals]]
  58     *   [[Reduction Strategies and Normal Forms|topics/week3_evaluation_order]]
  59     *   [[Fixed point combinators|topics/week4_fixed_point_combinators]]
  60     *   [[More about fixed point combinators|topics/week4_more_about_fixed_point_combinators]]
  61     *   Untyped lambda evaluator ([[in browser|code/lambda_evaluator]]) ([[for home|topics/week7_untyped_evaluator]])
  62     *   [[Environments and Closures|topics/week7_environments_and_closures]]
  63
  64
  65 *   Combinatory logic
  66
  67     *   [[Introduction|topics/week3 combinatory logic]]
  68     *   Combinatory evaluator ([[for home|topics/week7_combinatory_evaluator]])
  69
  70 *   Typed Lambda Calculi
  71
  72     *   [[Simply-typed lambda calculus|topics/week5 simply typed]] (will be updated)
  73     *   [[System F|topics/week5 system F]] (will be updated)
  74     *   Types in OCaml and Haskell (will be posted someday)
  75     *   see also Monads links, below
  76
  77 *   Monads
  78     *   [[Introducing Monads|topics/week7_introducing_monads]]
  79     *   [[Safe division with monads|topics/week8_safe_division_with_monads]]
  80     *   [[Reader Monad|/topics/week8_reader_monad]]
  81     *   [[Ramble on Monads and Modules|topics/week8_monads_and_modules]]
  82     *   [[Using the OCaml Monad library|/topics/week9_using_the_monad_library]]
  83     *   [[Programming with mutable state|/topics/week9_mutable_state]]
  84     *   [[A State Monad Tutorial|/topics/week9_state_monad_tutorial]]
  85     *   [[Using multiple monads together|/topics/week9_monad_transformers]]
  86     *   [[Groenendijk, Stokhof, and Veltman|/topics/week10_gsv]]
  87
  88
  89 *   Continuations
  90     *   [[Abortable list traversals|/topics/week12_abortable_traversals]]
  91     *   [[List and tree zippers|/topics/week12_list_and_tree_zippers]]
  92
  93
  94 ## Topics by week ##
  95
  96 Week 1:
  97
  98 *   [[Order in programming languages and natural language|topics/week1 order]]
  99 This discussion considers conjunction in a language that recognized presupposition failure.
 100 *   [[Introduction to functional programming|topics/week1 kapulet intro]]
 101 Basics of functional programming: `let`, `case`, pattern matching, and
 102 recursion.  Definitions of factorial.
 103 *   [[Advanced notes on functional programming|topics/week1 kapulet advanced]]
 104 *   [[Homework for week 1|exercises/assignment1]] ([[Answers|exercises/assignment1_answers]])
 105
 106 Week 2:
 107
 108 *   [[Introduction to the Lambda Calculus|topics/week2 lambda intro]]
 109 *   [[Advanced notes on the Lambda Calculus|topics/week2 lambda advanced]]
 110 *   [[Encoding Booleans, Tuples, Lists, and Numbers|topics/week2 encodings]]
 111 *   [[Homework for week 2|exercises/assignment2]] ([[Answers|exercises/assignment2_answers]])
 112
 113 Week 3:
 114
 115 *   [[Arithmetic with Church numbers|topics/week3_church_arithmetic]]
 116 *   [[More on Lists|topics/week3 lists]]
 117 Introduces list comprehensions, discusses how to get the `tail` of lists in the Lambda Calculus, and some new list encodings
 118 *   [[What is computation?|topics/week3_what_is_computation]]
 119 *   [[Reduction Strategies and Normal Forms|topics/week3_evaluation_order]] (posted on Monday 23 Feb)
 120 *   [[Unit and its usefulness|topics/week3 unit]]
 121 *   [[Combinatory Logic|topics/week3 combinatory logic]]
 122 *   [[Homework for week 3|exercises/assignment3]] ([[Answers|exercises/assignment3_answers]])
 123
 124 Week 4:
 125
 126 *   [[Fixed point combinators|topics/week4_fixed_point_combinators]]
 127 *   [[More about fixed point combinators|topics/week4_more_about_fixed_point_combinators]]
 128 *   Towards types (in progress)
 129 *   [[Homework for week 4|exercises/assignment4]] ([[Answers|exercises/assignment4_answers]])
 130
 131 Week 5:
 132
 133 *   [[Simply-typed lambda calculus|topics/week5 simply typed]]
 134 *   [[System F|topics/week5 system F]]
 135 *   Types in OCaml and Haskell (will be posted someday)
 136 *   Practical advice for working with OCaml and/or Haskell (will be posted someday)
 137 *   [[Homework for weeks 5 and 6|exercises/assignment5-6]] ([[Answers|exercises/assignment5-6_answers]])
 138
 139
 140 Week 6:
 141
 142 *   [[footnote about "Plexy"|readings/kaplan-plexy.pdf]] from Kaplan's *Demonstratives* about Plexy; [[our notes|topics/week6_plexy]] comparing to the Maybe type
 143 *   (Recommended) [[King's discussion of Schiffer|readings/king-on-schiffer.pdf]] in Chapter 4 of *The Nature and Structure of Content* (2007)
 144 *   (Recommended) [[King's discussion of clausal complements and proposition-designators|readings/king-on-logicism.pdf]] from Chapter 5 of *The Nature and Structure of Content* (2007) <!-- reviews and elaborates his paper "[Designating propositions](http://philpapers.org/rec/KINDP)" -->
 145 *   Michael Rieppel, "[[Being Something: Properties and Predicative Quantification|readings/rieppel-beingsthg.pdf]]"
 146
 147 Week 7:
 148
 149 *   [[Combinatory evaluator|topics/week7_combinatory_evaluator]]
 150 *   [[Introducing Monads|topics/week7_introducing_monads]] (updated Mon 23 Mar)
 151 *   [[Homework for week 7|exercises/assignment7]] (updated Mon 23 Mar)
 152 *   [[Environments and Closures|topics/week7_environments_and_closures]]
 153 *   [[Untyped lambda evaluator|topics/week7_untyped_evaluator]]
 154
 155
 156 Week 8:
 157
 158 *   [[Safe division with monads|topics/week8_safe_division_with_monads]]
 159 *   [[Reader Monad|/topics/week8_reader_monad]]
 160 *   [[Ramble on Monads and Modules|topics/week8_monads_and_modules]]
 161
 162 Week 9:
 163
 164 *   [[Installing and Using the Juli8 Libraries|/juli8]]
 165 *   [[Using the OCaml Monad library|/topics/week9_using_the_monad_library]]
 166 *   [[Programming with mutable state|/topics/week9_mutable_state]]
 167 *   [[A State Monad Tutorial|/topics/week9_state_monad_tutorial]]
 168 *   [[Using multiple monads together|/topics/week9_monad_transformers]]
 169 *   [[Homework for weeks 8-9|/exercises/assignment8-9]]
 170
 171 Week 10:
 172
 173 *   Groenendijk, Stokhof, and Veltman, "[[Coreference and Modality|/readings/coreference-and-modality.pdf]]" (1996)
 174 *   [[Notes on GSV|/topics/week10_gsv]], with links to code
 175
 176
 177 Week 12:
 178
 179 *   Mutation and hyper-synonymy (no notes)
 180 *   [[Abortable list traversals|/topics/week12_abortable_traversals]]
 181 *   [[List and tree zippers|/topics/week12_list_and_tree_zippers]]
 182 *   [[Homework for week 12|exercises/assignment12]]