+Variables:((\a M) N) ~~>_beta M{a := N} +Each variable is an expression. For any expressions M and N and variable a, the following are also expressions: The term on the left of the arrow is an application whose first element is a lambda abstraction. (Such an application is called a "redex".) The beta reduction rule says that a redex is betaequivalent to a term that is constructed by replacing every (free) occurrence of a in M by a copy of N. For example, +x
,y
,z
... +
+Abstract: (λa M)
+
((\x x) z) ~~>_beta z
((\x (x x)) z) ~~>_beta (z z)
((\x x) (\y y)) ~~>_beta (\y y)
+We'll tend to write (λa M)
as just `(\a M)`, so we don't have to write out the markup code for the λ
. You can yourself write (λa M)
or `(\a M)` or `(lambda a M)`.
+
+
+Application: (M N)
+
+
+Some authors reserve the term "term" for just variables and abstracts. We won't participate in that convention; we'll probably just say "term" and "expression" indiscriminately for expressions of any of these three forms.
+
+Examples of expressions:
+
+ x
+ (y x)
+ (x x)
+ (\x y)
+ (\x x)
+ (\x (\y x))
+ (x (\x x))
+ ((\x (x x)) (\x (x x)))
+
+>
+
+The lambda calculus has an associated proof theory. For now, we can regard the proof theory as having just one rule, called the rule of **betareduction** or "betacontraction". Suppose you have some expression of the form:
+
+ ((\a M) N)
+
+that is, an application of an abstract to some other expression. This compound form is called a **redex**, meaning it's a "betareducible expression." `(\a M)` is called the **head** of the redex; `N` is called the **argument**, and `M` is called the **body**.
+
+The rule of betareduction permits a transition from that expression to the following:
+
+ M [a:=N]
+
+What this means is just `M`, with any *free occurrences* inside `M` of the variable `a` replaced with the term `N`.
+
+What is a free occurrence?
+
+> An occurrence of a variable `a` is **bound** in T if T has the form `(\a N)`.
+
+> If T has the form `(M N)`, any occurrences of `a` that are bound in `M` are also bound in T, and so too any occurrences of `a` that are bound in `N`.
+
+> An occurrence of a variable is **free** if it's not bound.
Beta reduction is only allowed to replace *free* occurrences of a variable.
An occurrence of a variable a is BOUND in T if T has the form (\a N).
If T has the form (M N), and the occurrence of a is in M, then a is
bound in T just in case a is bound in M; if the occurrence of a is in
N, than a is bound in T just in case a is bound in N. An occurrence
of a variable a is FREE in a term T iff it is not bound in T.
For instance:
T = (x (\x (\y (x (y z)))))
The first occurrence of x in T is free. The second occurrence of x
immediately follows a lambda, and is bound. The third occurrence of x
occurs within a form that begins with "\x", so it is bound as well.
Both occurrences of y are bound, and the only occurrence of z is free.
+> T is defined to be `(x (\x (\y (x (y z)))))`
+
+The first occurrence of `x` in T is free. The `\x` we won't regard as being an occurrence of `x`. The next occurrence of `x` occurs within a form that begins with `\x`, so it is bound as well. The occurrence of `y` is bound; and the occurrence of `z` is free.
+
+Here's an example of betareduction:
+
+ ((\x (y x)) z)
+
+betareduces to:
+
+ (y z)
+
+We'll write that like this:
+
+ ((\x (y x)) z) ~~> (y z)
+
+Different authors use different notations. Some authors use the term "contraction" for a single reduction step, and reserve the term "reduction" for the reflexive transitive closure of that, that is, for zero or more reduction steps. Informally, it seems easiest to us to say "reduction" for one or more reduction steps. So when we write:
+
+ M ~~> N
+
+We'll mean that you can get from M to N by one or more reduction steps. Hankin uses the symbol →
for onestep contraction, and the symbol ↠
for zeroormore step reduction. Hindley and Seldin use ⊳_{1}
and ⊳
.
+
+When M and N are such that there's some P that M reduces to by zero or more steps, and that N also reduces to by zero or more steps, then we say that M and N are **betaconvertible**. We'll write that like this:
+
+ M <~~> N
+
+This is what plays the role of equality in the lambda calculus. Hankin uses the symbol `=` for this. So too do Hindley and Seldin. Personally, I keep confusing that with the relation to be described next, so let's use this notation instead. Note that `M <~~> N` doesn't mean that each of `M` and `N` are reducible to each other; that only holds when `M` and `N` are the same expression. (Or, with our convention of only saying "reducible" for one or more reduction steps, it never holds.)
+
+In the metatheory, it's also sometimes useful to talk about formulas that are syntactically equivalent *before any reductions take place*. Hankin uses the symbol ≡
for this. So too do Hindley and Seldin. We'll use that too, and will avoid using `=` when discussing metatheory for the lambda calculus. Instead we'll use `<~~>` as we said above. When we want to introduce a stipulative definition, we'll write it out longhand, as in:
+
+> T is defined to be `(M N)`.
+
+We'll regard the following two expressions:
+
+ (\x (x y))
+
+ (\z (z y))
+
+as syntactically equivalent, since they only involve a typographic change of a bound variable. Read Hankin section 2.3 for discussion of different attitudes one can take about this.
+
+Note that neither of those expressions are identical to:
+
+ (\x (x w))
+
+because here it's a free variable that's been changed. Nor are they identical to:
+
+ (\y (y y))
+
+because here the second occurrence of `y` is no longer free.
+
+There is plenty of discussion of this, and the fine points of how substitution works, in Hankin and in various of the tutorials we've linked to about the lambda calculus. We expect you have a good intuitive understanding of what to do already, though, even if you're not able to articulate it rigorously.
+
+
+Shorthand
+
+
+The grammar we gave for the lambda calculus leads to some verbosity. There are several informal conventions in widespread use, which enable the language to be written more compactly. (If you like, you could instead articulate a formal grammar which incorporates these additional conventions. Instead of showing it to you, we'll leave it as an exercise for those so inclined.)
+
+
+**Dot notation** Dot means "put a left paren here, and put the right
+paren as far the right as possible without creating unbalanced
+parentheses". So:
+
+ (\x (\y (x y)))
+
+can be abbreviated as:
+
+ (\x (\y. x y))
+
+and:
+
+ (\x (\y. (z y) z))
+
+would abbreviate:
+
+ (\x (\y ((z y) z)))
+
+This on the other hand:
+
+ (\x (\y. z y) z)
+
+would abbreviate:
+
+ (\x (\y (z y)) z)
+
+**Parentheses** Outermost parentheses around applications can be dropped. Moreover, applications will associate to the left, so `M N P` will be understood as `((M N) P)`. Finally, you can drop parentheses around abstracts, but not when they're part of an application. So you can abbreviate:
+
+ (\x. x y)
+
+as:
+
+ \x. x y
+
+but you should include the parentheses in:
+
+ (\x. x y) z
+
+and:
+
+ z (\x. x y)
+
+**Merging lambdas** An expression of the form `(\x (\y M))`, or equivalently, `(\x. \y. M)`, can be abbreviated as:
+
+ (\x y. M)
+
+Similarly, `(\x (\y (\z M)))` can be abbreviated as:
+
+ (\x y z. M)
+
+
+Lambda terms represent functions
+
Lambda terms represent functions.
All (recursively computable) functions can be represented by lambda
terms (the untyped lambda calculus is Turning complete).
For some lambda terms, it is easy to see what function they represent:
+terms (the untyped lambda calculus is Turing complete). For some lambda terms, it is easy to see what function they represent:
(\x x) the identity function: given any argument M, this function
simply returns M: ((\x x) M) ~~>_beta M.
+> `(\x x)` represents the identity function: given any argument `M`, this function
+simply returns `M`: `((\x x) M) ~~> M`.
(\x (x x)) duplicates its argument:
((\x (x x)) M) ~~> (M M)
+> `(\x (x x))` duplicates its argument:
+`((\x (x x)) M) ~~> (M M)`
(\x (\y x)) throws away its second argument:
(((\x (\y x)) M) N) ~~> M
+> `(\x (\y x))` throws away its second argument:
+`(((\x (\y x)) M) N) ~~> M`
and so on.
It is easy to see that distinct lambda terms can represent the same
function. For instance, (\x x) and (\y y) both express the same
function, namely, the identity function.
+It is easy to see that distinct lambda expressions can represent the same
+function, considered as a mapping from input to outputs. Obviously:

Dot notation: dot means "put a left paren here, and put the right
paren as far the right as possible without creating unbalanced
parentheses". So (\x(\y(xy))) = \x\y.xy, and \x\y.(z y) x =
(\x(\y((z y) z))), but (\x\y.(z y)) x = ((\x(\y(z y))) x).
+ (\x x)
+
+and:
+
+ (\z z)
+
+both represent the same function, the identity function. However, we said above that we would be regarding these expressions as synactically equivalent, so they aren't yet really examples of *distinct* lambda expressions representing a single function. However, all three of these are distinct lambda expressions:
+
+ (\y x. y x) (\z z)
+
+ (\x. (\z z) x)
+
+ (\z z)
+
+yet when applied to any argument M, all of these will always return M. So they have the same extension. It's also true, though you may not yet be in a position to see, that no other function can differentiate between them when they're supplied as an argument to it. However, these expressions are all syntactically distinct.
+
+The first two expressions are *convertible*: in particular the first reduces to the second. So they can be regarded as prooftheoretically equivalent even though they're not syntactically identical. However, the proof theory we've given so far doesn't permit you to reduce the second expression to the third. So these lambda expressions are nonequivalent.
+
+There's an extension of the prooftheory we've presented so far which does permit this further move. And in that extended proof theory, all computable functions with the same extension do turn out to be equivalent (convertible). However, at that point, we still won't be working with the traditional mathematical notion of a function as a set of ordered pairs. One reason is that the latter but not the former permits uncomputable functions. A second reason is that the latter but not the former prohibits functions from applying to themselves. We discussed this some at the end of Monday's meeting (and further discussion is best pursued in person).
+
+
+
+Booleans and pairs
+==================
+
+Our definition of these is reviewed in [[Assignment1]].
+
+
+It's possible to do the assignment without using a Scheme interpreter, however
+you should take this opportunity to [get Scheme installed on your
+computer](/how_to_get_the_programming_languages_running_on_your_computer), and
+[get started learning Scheme](/learning_scheme). It will help you test out
+proposed answers to the assignment.
+
+
+
+
+
+
+Declarative/functional vs Imperatival/dynamic models of computation
+===================================================================
+
+Many of you, like us, will have grown up thinking the paradigm of computation is a sequence of changes. Let go of that. It will take some care to separate the operative notion of "sequencing" here from other notions close to it, but once that's done, you'll see that languages that have no significant notions of sequencing or changes are Turing complete: they can perform any computation we know how to describe. In itself, that only puts them on equal footing with more mainstream, imperatival programming languages like C and Java and Python, which are also Turing complete. But further, the languages we want you to become familiar with can reasonably be understood to be more fundamental. They embody the elemental building blocks that computer scientists use when reasoning about and designing other languages.
+
+Jim offered the metaphor: think of imperatival languages, which include "mutation" and "sideeffects" (we'll flesh out these keywords as we proceeed), as the pâté of computation. We want to teach you about the meat and potatoes, where as it turns out there is no sequencing and no changes. There's just the evaluation or simplification of complex expressions.
+
+Now, when you ask the Scheme interpreter to simplify an expression for you, that's a kind of dynamic interaction between you and the interpreter. You may wonder then why these languages should not also be understood imperatively. The difference is that in a purely declarative or functional language, there are no dynamic effects in the language itself. It's just a static semantic fact about the language that one expression reduces to another. You may have verified that fact through your dynamic interactions with the Scheme interpreter, but that's different from saying that there are dynamic effects in the language itself.
+
+What the latter would amount to will become clearer as we build our way up to languages which are genuinely imperatival or dynamic.
+
+Many of the slogans and keywords we'll encounter in discussions of these issues call for careful interpretation. They mean various different things.
+
+For example, you'll encounter the claim that declarative languages are distinguished by their **referential transparency.** What's meant by this is not always exactly the same, and as a cluster, it's related to but not the same as this means for philosophers and linguists.
+
+The notion of **function** that we'll be working with will be one that, by default, sometimes counts as nonidentical functions that map all their inputs to the very same outputs. For example, two functions from jumbled decks of cards to sorted decks of cards may use different algorithms and hence be different functions.
+
+It's possible to enhance the lambda calculus so that functions do get identified when they map all the same inputs to the same outputs. This is called making the calculus **extensional**. Church called languages which didn't do this **intensional**. If you try to understand that kind of "intensionality" in terms of functions from worlds to extensions (an idea also associated with Church), you may hurt yourself. So too if you try to understand it in terms of mental stereotypes, another notion sometimes designated by "intension."
+
+It's often said that dynamic systems are distinguished because they are the ones in which **order matters**. However, there are many ways in which order can matter. If we have a trivalent boolean system, for exampleeasily had in a purely functional calculuswe might choose to give a truthtable like this for "and":
+
+ true and true = true
+ true and * = *
+ true and false = false
+ * and true = *
+ * and * = *
+ * and false = *
+ false and true = false
+ false and * = false
+ false and false = false
+
+And then we'd notice that `* and false` has a different intepretation than `false and *`. (The same phenomenon is already present with the mateial conditional in bivalent logics; but seeing that a nonsymmetric semantics for `and` is available even for functional languages is instructive.)
+
+Another way in which order can matter that's present even in functional languages is that the interpretation of some complex expressions can depend on the order in which subexpressions are evaluated. Evaluated in one order, the computations might never terminate (and so semantically we interpret them as having "the bottom value"we'll discuss this). Evaluated in another order, they might have a perfectly mundane value. Here's an example, though we'll reserve discussion of it until later:
+
+ (\x. y) ((\x. x x) (\x. x x))
+
+Again, these facts are all part of the metatheory of purely functional languages. But *there is* a different sense of "order matters" such that it's only in imperatival languages that order so matters.
+
+ x := 2
+ x := x + 1
+ x == 3
+
+Here the comparison in the last line will evaluate to true.
+
+ x := x + 1
+ x := 2
+ x == 3
+
+Here the comparison in the last line will evaluate to false.
+
+One of our goals for this course is to get you to understand *what is* that new
+sense such that only so matters in imperatival languages.
+
+Finally, you'll see the term **dynamic** used in a variety of ways in the literature for this course:
+
+* dynamic versus static typing
+
+* dynamic versus lexical scoping
+
+* dynamic versus static control operators
+
+* finally, we're used ourselves to talking about dynamic versus static semantics
+
+For the most part, these uses are only loosely connected to each other. We'll tend to use "imperatival" to describe the kinds of semantic properties made available in dynamic semantics, languages which have robust notions of sequencing changes, and so on.
+
+Map
+===
+
+
+
+
+
+
+
+
+
+
+
+
+Scheme (functional part)  OCaml (functional part)  C, Java, Pasval +Scheme (imperative part) +OCaml (imperative part) 
lambda calculus +combinatorial logic  
 Turing complete   
+  more advanced type systems, such as polymorphic types +  + 
+  simplytyped lambda calculus (what linguists mostly use) +  + 
+ ∀x. (F x or ∀x (not (F x)))
+
+
+ When a previouslybound variable is rebound in the way we see here, that's called **shadowing**: the outer binding is shadowed during the scope of the inner binding.
+
+
+Some more comparisons between Scheme and OCaml
+
+
+11. Simple predefined values
+
+ Numbers in Scheme: `2`, `3`
+ In OCaml: `2`, `3`
+
+ Booleans in Scheme: `#t`, `#f`
+ In OCaml: `true`, `false`
+
+ The eighth letter in the Latin alphabet, in Scheme: `#\h`
+ In OCaml: `'h'`
+
+12. Compound values
+
+ These are values which are built up out of (zero or more) simple values.
+
+ Ordered pairs in Scheme: `'(2 . 3)`
+ In OCaml: `(2, 3)`
+
+ Lists in Scheme: `'(2 3)`
+ In OCaml: `[2; 3]`
+ We'll be explaining the difference between pairs and lists next week.

+ The empty list, in Scheme: `'()`
+ In OCaml: `[]`
Church figured out how to encode integers and arithmetic operations
using lambda terms. Here are the basics:
+ The string consisting just of the eighth letter of the Latin alphabet, in Scheme: `"h"`
+ In OCaml: `"h"`
0 = \f\x.fx
1 = \f\x.f(fx)
2 = \f\x.f(f(fx))
3 = \f\x.f(f(f(fx)))
...
+ A longer string, in Scheme: `"horse"`
+ In OCaml: `"horse"`
Adding two integers involves applying a special function + such that
(+ 1) 2 = 3. Here is a term that works for +:
+ A shorter string, in Scheme: `""`
+ In OCaml: `""`
+ = \m\n\f\x.m(f((n f) x))
+13. Function application
So (+ 0) 0 =
(((\m\n\f\x.m(f((n f) x))) ;+
 \f\x.fx) ;0
 \f\x.fx) ;0
+ Binary functions in OCaml: `foo 2 3`
+
+ Or: `( + ) 2 3`
~~>_beta targeting m for beta conversion
+ These are the same as: `((foo 2) 3)`. In other words, functions in OCaml are "curried". `foo 2` returns a `2`fooer, which waits for an argument like `3` and then foos `2` to it. `( + ) 2` returns a `2`adder, which waits for an argument like `3` and then adds `2` to it.
((\n\f\x.[\f\x.fx](f((n f) x)))
 \f\x.fx)
+ In Scheme, on the other hand, there's a difference between `((foo 2) 3)` and `(foo 2 3)`. Scheme distinguishes between unary functions that return unary functions and binary functions. For our seminar purposes, it will be easiest if you confine yourself to unary functions in Scheme as much as possible.
\f\x.[\f\x.fx](f(([\f\x.fx] f) x))
+ Additionally, as said above, Scheme is very sensitive to parentheses and whenever you want a function applied to any number of arguments, you need to wrap the function and its arguments in a parentheses.
\f\x.[\f\x.fx](f(fx))
\f\x.\x.[f(fx)]x
+What "sequencing" is and isn't
+
\f\x.f(fx)
+We mentioned before the idea that computation is a sequencing of some changes. I said we'd be discussing (fragments of, and in some cases, entire) languages that have no native notion of change.
+Neither do they have any useful notion of sequencing. But what this would be takes some care to identify.
+First off, the mere concatenation of expressions isn't what we mean by sequencing. Concatenation of expressions is how you build syntactically complex expressions out of simpler ones. The complex expressions often express a computation where a function is applied to one (or more) arguments,

+Second, the kind of rebinding we called "shadowing" doesn't involve any changes or sequencing. All the precedence facts about that kind of rebinding are just consequences of the compound syntactic structures in which it occurs.
A concrete example: "damn" side effects
+Third, the kinds of bindings we see in:
1. Sentences have truth conditions.
2. If "John read the book" is true, then
 John read something,
 Someone read the book,
 John did something to the book,
 etc.
3. If "John read the damn book",
 all the same entailments follow.
 To a first approximation, "damn" does not affect atissue truth
 conditions.
4. "Damn" does contribute information about the attitude of the speaker
 towards some aspect of the situation described by the sentence.
+ (define foo A)
+ (foo 2)
+Or even:
+ (define foo A)
+ (define foo B)
+ (foo 2)

Old notes, no longer operative:
+don't involve any changes or sequencing in the sense we're trying to identify. As we said, these programs are just syntactic variants of (single) compound syntactic structures involving "let"s and "lambda"s.
1. Theoretical computer science is beautiful.
+Since Scheme and OCaml also do permit imperatival constructions, they do have syntax for genuine sequencing. In Scheme it looks like this:
 Google search for "anagram": Did you mean "nag a ram"?
 Google search for "recursion": Did you mean "recursion"?
+ (begin A B C)
 Y = \f.(\x.f (x x)) (\x.f (x x))
+In OCaml it looks like this:
+ begin A; B; C end
1. Understanding the meaning(use) of programming languages
 helps understanding the meaning(use) of natural langauges
+Or this:
 1. Richard Montague. 1970. Universal Grammar. _Theoria_ 34:37598.
 "There is in my opinion no important theoretical difference
 between natural languages and the artificial languages of
 logicians; indeed, I consider it possible to comprehend the
 syntax and semantics of both kinds of languages within a
 single natural and mathematically precise theory."
+ (A; B; C)
 2. Similarities:
+In the presence of imperatival elements, sequencing order is very relevant. For example, these will behave differently:
 Function/argument structure:
 f(x)
 kill(it)
 pronominal binding:
 x := x + 1
 John is his own worst enemy
 Quantification:
 foreach x in [1..10] print x
 Print every number from 1 to 10
+ (begin (print "under") (print "water"))
+
+ (begin (print "water") (print "under"))
 3. Possible differences:
+And so too these:
 Parentheses:
 3 * (4 + 7)
 ?It was four plus seven that John computed 3 multiplied by
 (compare: John computed 3 multiplied by four plus seven)
 Ambiguity:
 3 * 4 + 7
 Time flies like and arrow, fruit flies like a banana.
 Vagueness:
 3 * 4
 A cloud near the mountain
 Unbounded numbers of distinct pronouns:
 f(x1) + f(x2) + f(x3) + ...
 He saw her put it in ...
 [In ASL, dividing up the signing space...]


2. Standard methods in linguistics are limited.
+ begin x := 3; x := 2; x end
 1. Firstorder predicate calculus
+ begin x := 2; x := 3; x end
 Invented for reasoning about mathematics (Frege's quantification)
+However, if A and B are purely functional, nonimperatival expressions, then:
 Alethic, order insensitive: phi & psi == psi & phi
 But: John left and Mary left too /= Mary left too and John left
+ begin A; B; C end
 2. Simplytyped lambda calculus
+just evaluates to C (so long as A and B evaluate to something at all). So:
 Can't express the Y combinator
+ begin A; B; C end
+contributes no more to a larger context in which it's embedded than C does. This is the sense in which functional languages have no serious notion of sequencing.
3. Meaning is computation.
+We'll discuss this more as the seminar proceeds.
 1. Semantics is programming
 2. Good programming is good semantics
+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 "firstclass values"
+6. "Curried" functions
 1. Example
+1. Beta reduction
+1. Encoding pairs (and triples and ...)
+1. Encoding booleans
 1. Programming technique
 Exceptions
 throw (raise)
 catch (handle)
 2. Application to linguistics
 presupposition
 expressives
 Develop application:
 fn application
 divide by zero
 test and repair
 raise and handle
 fn application
 presupposition failure
 build into meaning of innocent predicates?
 expressives
 throw
 handle
 resume computation
