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

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