X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=content.mdwn;h=d067df76060462cf69e8a64bc0a888eb3735af5d;hp=6b4c55fb02f3f7bc94e308c167babd1b09617f20;hb=58b1b1a64793610dfca627e683a1bc5d45a78157;hpb=47a1e74d28317b889a39c4ab9233445fb05f402f

diff --git a/content.mdwn b/content.mdwn
index 6b4c55fb..d067df76 100644
--- a/content.mdwn
+++ b/content.mdwn
@@ -11,40 +11,15 @@ week in which they were introduced.
 
 ## Topics by week ##
 
-Week 1: 
+Week 1:
 
-* [[Order in programming languages and natural language|topics/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]]
 Basics of functional programming: `let`, `case`, pattern matching, and
 recursion.  Definitions of factorial.
 * [[Homework for week 1|exercises/assignment1]]
-* [[Advanced notes|week1 advanced notes]] 
+* [[Advanced notes|topics/week1 advanced notes]]
 
 *More coming, please wait...*
 
-<!--
-Once we get up and running, the central focii of the course will be
-**continuations**, **types**, and **monads**. One of the on-going themes will
-concern evaluation order and issues about how computations (inferences,
-derivations) unfold in (for instance) time.  The key analytic technique is to
-form a static, order-independent model of a dynamic process. We'll be
-discussing this in much more detail as the course proceeds.
-
-The logical systems we'll be looking at include:
-
-*	the "pure"/untyped lambda calculus
-*	combinatorial logic
-*	the simply-typed lambda calculus
-*	polymorphic types with System F
-*	some discussion of dependent types
-*	if time permits, "indeterministic" or "preemptively parallel" computation and linear logic
-
-
-Other keywords:
-	recursion using the Y-combinator
-	evaluation-order stratgies
-	normalizing properties
-	the Curry-Howard isomorphism(s)
-	monads in category theory and computation
--->