X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=week2.mdwn;h=d1d02faf0a9159ac7de0adc510a54047d21e5fe5;hp=ce2df76df252e30b20e142599925ed771e6097a2;hb=114aa68bf26aa9438660940f0b6f20796c9ac1d0;hpb=6b354c56b73998dfcdd5be0f148ad24f1b9fed1d diff --git a/week2.mdwn b/week2.mdwn index ce2df76d..d1d02faf 100644 --- a/week2.mdwn +++ b/week2.mdwn @@ -183,6 +183,9 @@ The fifth rule deals with an abstract whose body is an application: the S combin [Fussy notes: if the original lambda term has free variables in it, so will the combinatory logic translation. Feel free to worry about this, though you should be confident that it makes sense. You should also convince yourself that if the original lambda term contains no free variables---i.e., is a combinator---then the translation will consist only of S, K, and I (plus parentheses). One other detail: this translation algorithm builds expressions that combine lambdas with combinators. For instance, the translation of our boolean false `\x.\y.y` is `[\x[\y.y]] = [\x.I] = KI`. In the intermediate stage, we have `\x.I`, which mixes combinators in the body of a lambda abstract. It's possible to avoid this if you want to, but it takes some careful thought. See, e.g., Barendregt 1984, page 156.] +[Various, slightly differing translation schemes from combinatorial logic to the lambda calculus are also possible. These generate different metatheoretical correspondences between the two calculii. Consult Hindley and Seldin for details. Also, note that the combinatorial proof theory needs to be strengthened with axioms beyond anything we've here described in order to make [M] convertible with [N] whenever the original lambda-terms M and N are convertible.] + + Let's check that the translation of the false boolean behaves as expected by feeding it two arbitrary arguments: KIXY ~~> IY ~~> Y @@ -241,7 +244,7 @@ in two books in the 1990's. A final linguistic application: Steedman's Combinatory Categorial Grammar, where the "Combinatory" is from combinatory logic (see especially his 2000 book, The Syntactic Processs). Steedman attempts to build -a syntax/semantics interface using a small number of combinators, including T = `\xy.yx`, B = `\fxy.f(xy)`, +a syntax/semantics interface using a small number of combinators, including T ≡ `\xy.yx`, B ≡ `\fxy.f(xy)`, and our friend S. Steedman used Smullyan's fanciful bird names for the combinators, Thrush, Bluebird, and Starling. @@ -318,20 +321,24 @@ will eta-reduce by n steps to: \x. M +When we add eta-reduction to our proof system, we end up reconstruing the meaning of `~~>` and `<~~>` and "normal form", all in terms that permit eta-reduction as well. Sometimes these expressions will be annotated to indicate whether only beta-reduction is allowed (`~~>β`) or whether both beta- and eta-reduction is allowed (`~~>βη`). + The logical system you get when eta-reduction is added to the proof system has the following property: > if `M`, `N` are normal forms with no free variables, then `M ≡ N` iff `M` and `N` behave the same with respect to every possible sequence of arguments. -That is, when `M` and `N` are (closed normal forms that are) syntactically distinct, there will always be some sequences of arguments `L1, ..., Ln` such that: +This implies that, when `M` and `N` are (closed normal forms that are) syntactically distinct, there will always be some sequences of arguments `L1, ..., Ln` such that:
``````M L1 ... Ln x y ~~> x
N L1 ... Ln x y ~~> y
``````
-That is, closed normal forms that are not just beta-reduced but also fully eta-reduced, will be syntactically different iff they yield different values for some arguments. That is, iff their extensions differ. +So closed beta-plus-eta-normal forms will be syntactically different iff they yield different values for some arguments. That is, iff their extensions differ. So the proof theory with eta-reduction added is called "extensional," because its notion of normal form makes syntactic identity of closed normal forms coincide with extensional equivalence. +See Hindley and Seldin, Chapters 7-8 and 14, for discussion of what should count as capturing the "extensionality" of these systems, and some outstanding issues. + The evaluation strategy which answers Q1 by saying "reduce arguments first" is known as **call-by-value**. The evaluation strategy which answers Q1 by saying "substitute arguments in unreduced" is known as **call-by-name** or **call-by-need** (the difference between these has to do with efficiency, not semantics). @@ -430,6 +437,7 @@ But is there any method for doing this in general---for telling, of any given co * [Scooping the Loop Snooper](http://www.cl.cam.ac.uk/teaching/0910/CompTheory/scooping.pdf), a proof of the undecidability of the halting problem in the style of Dr Seuss by Geoffrey K. Pullum +Interestingly, Church also set up an association between the lambda calculus and first-order predicate logic, such that, for arbitrary lambda formulas `M` and `N`, some formula would be provable in predicate logic iff `M` and `N` were convertible. So since the right-hand side is not decidable, questions of provability in first-order predicate logic must not be decidable either. This was the first proof of the undecidability of first-order predicate logic. ##[[Lists and Numbers]]##