X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=topics_and_themes.mdwn;fp=topics_and_themes.mdwn;h=0000000000000000000000000000000000000000;hp=ab4a53381e7b35c9670ed473accf273cfac64b71;hb=6f28a0b32bad78d0a109d64e15e52b9aab11b832;hpb=536b3ca117f2fbd3fecc229e62a63a41294428d3

diff --git a/topics_and_themes.mdwn b/topics_and_themes.mdwn
deleted file mode 100644
index ab4a5338..00000000
--- a/topics_and_themes.mdwn
+++ /dev/null
@@ -1,27 +0,0 @@
-*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
--->