From: Jim Pryor <profjim@jimpryor.net>
Date: Wed, 15 Sep 2010 18:23:24 +0000 (-0400)
Subject: start week1 summary
X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=commitdiff_plain;h=545b8774052183ad91afd0b7dc741162af7ac405;ds=sidebyside

start week1 summary

Signed-off-by: Jim Pryor <profjim@jimpryor.net>
---

diff --git a/notes_and_schedule.mdwn b/notes_and_schedule.mdwn
index 50a9c33b..628a960d 100644
--- a/notes_and_schedule.mdwn
+++ b/notes_and_schedule.mdwn
@@ -1,26 +1,18 @@
-This is very sketchy at this point, but it should give a sense of our intended scope.
+# Lecture Notes #
+
+[[Week1]] (13 Sept)
 
 
-## Introduction ##
+# Still To Come #
 
-1.	Declarative vs imperatival models of computation.
-2.	Variety of ways in which "order can matter."
-3.	Variety of meanings for "dynamic."
-4.	Schoenfinkel, Curry, Church: a brief history
-5.	Functions as "first-class values"
-6.	"Curried" functions
+This is very sketchy at this point, but it should give a sense of our intended scope.
 
-## The "pure" or untyped lambda calculus ##
+## More on the "pure" or untyped lambda calculus ##
 
-1.	Beta reduction
-1.	Substitution; using alpha-conversion and other strategies
-1.	Conversion versus reduction
 1.	Eta reduction and "extensionality"
 1.	Different evaluation strategies (call by name, call by value, etc.)
 1.	Strongly normalizing vs weakly normalizing vs non-normalizing; Church-Rosser Theorem(s)
 1.	Lambda calculus compared to combinatorial logic<p>
-1.	Encoding pairs (and triples and ...)
-1.	Encoding booleans
 1.	Church-like encodings of numbers, defining addition and multiplication
 1.	Defining the predecessor function; alternate encodings for the numbers
 1.	Homogeneous sequences or "lists"; how they differ from pairs, triples, etc.
diff --git a/week1.mdwn b/week1.mdwn
index d5ddbac6..be1b714d 100644
--- a/week1.mdwn
+++ b/week1.mdwn
@@ -1,4 +1,55 @@
-Order matters
+Here's what we did in seminar on Monday 9/13, (Sometimes these notes will expand on things mentioned only briefly in class, or discuss useful tangents that didn't even make it into class.)
+
+Applications
+============
+
+We mentioned a number of linguistic and philosophical applications of the tools that we'd be helping you learn in the seminar. (We really do mean "helping you learn," not "teaching you." You'll need to aggressively browse and experiment with the material yourself, or nothing we do in a few two-hour sessions will succeed in inducing mastery of it.)
+
+From linguistics
+----------------
+
+*	generalized quantifiers are a special case of operating on continuations
+
+*	(Chris: fill in other applications...)
+
+*	expressives -- at the end of the seminar we gave a demonstration of modeling [[damn]] using continuations...see the linked summary for more explanation and elaboration
+
+From philosophy
+---------------
+
+*	the natural semantics for positive free logic is thought by some to have objectionable ontological commitments; Jim says that thought turns on not understanding the notion of a "union type", and conflating the folk notion of "naming" with the technical notion of semantic value. We'll discuss this in due course.
+
+*	those issues may bear on Russell's Gray's Elegy argument in "On Denoting"
+
+*	and on discussion of the difference between the meaning of "is beautiful" and "beauty," and the difference between the meaning of "that snow is white" and "the proposition that snow is white."
+
+*	the apparatus of monads, and techniques for statically representing the semantics of an imperatival language quite generally, are explicitly or implicitly invoked in dynamic semantics
+
+*	the semantics for mutation will enable us to make sense of a difference between numerical and qualitative identity---for purely mathematical objects!
+
+*	issues in that same neighborhood will help us better understand proposals like Kit Fine's that semantics is essentially coordinated, and that `R a a` and `R a b` can differ in interpretation even when `a` and `b` don't
+
+
+
+
+
+1.	Declarative vs imperatival models of computation.
+2.	Variety of ways in which "order can matter."
+3.	Variety of meanings for "dynamic."
+4.	Schoenfinkel, Curry, Church: a brief history
+5.	Functions as "first-class values"
+6.	"Curried" functions
+
+1.	Beta reduction
+1.	Encoding pairs (and triples and ...)
+1.	Encoding booleans
+
+
+
+
+
+
+	Order matters
 
 Declarative versus imperative: