X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=week1.mdwn;h=ec57775130e6160d7d148e5fe2ad0b185d94ede0;hp=6391bb5a177fc8a6411f9387c5ecc73e4c4e28dd;hb=1328b3b48bb03309f5a57167bfbcffcf691bf9bd;hpb=830bceeb7d4175430140587be3a80747a6a69314 diff --git a/week1.mdwn b/week1.mdwn index 6391bb5a..ec577751 100644 --- a/week1.mdwn +++ b/week1.mdwn @@ -1,42 +1,21 @@ 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. These notes expand on *a lot*, and some of this material will be reviewed next week. +Sometimes these notes will expand on things mentioned only briefly in class, or discuss useful tangents that didn't even make it into class. This present page expands on *a lot*, and some of this material will be reviewed next week. -Applications -============ +[Linguistic and Philosophical Applications of the Tools We'll be Studying](/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.) +[Explanation of the "Damn" example shown in class](/damn) -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 [summary](/damn) 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 +Basics of Lambda Calculus +========================= +See also: +* [Chris Barker's Lambda Tutorial](http://homepages.nyu.edu/~cb125/Lambda) +* [Lambda Animator](http://thyer.name/lambda-animator/) -Basics of Lambda Calculus -========================= - The lambda calculus we'll be focusing on for the first part of the course has no types. (Some prefer to say it instead has a single type---but if you say that, you have to say that functions from this type to this type also belong to this type. Which is weird.) Here is its syntax: @@ -367,6 +346,11 @@ Rosetta Stone Here's how it looks to say the same thing in various of these languages. +The following site may be useful; it lets you run a Scheme interpreter inside your web browser: + +* [Try Scheme in your web browser](http://tryscheme.sourceforge.net/) + + 1. Binding suitable values to the variables `three` and `two`, and adding them. In Scheme: