XGitUrl: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=week1.mdwn;h=9a83861abe305f5d4485d7dc7a7c8e9be24fad8b;hp=5018c711cd694565b0da85e9cb7181fb999bf2d3;hb=131b2977d60a0aef69ae892763f1f1cdc2d87feb;hpb=59081b2acb15b435e9a486ce18bc85c1abe232c2
diff git a/week1.mdwn b/week1.mdwn
index 5018c711..9a83861a 100644
 a/week1.mdwn
+++ b/week1.mdwn
@@ 1,4 +1,6 @@
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.)
+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.
Applications
============
@@ 12,7 +14,7 @@ From linguistics
* (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
+* 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

@@ 30,12 +32,244 @@ From philosophy
* 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
+=========================
+
+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 typebut 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:
+
+
+Variables: x
, y
, z
...
+
+
+Each variable is an expression. For any expressions M and N and variable a, the following are also expressions:
+
+
+Abstract: (λa M)
+
+
+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.
+
+For instance:
+
+
+> 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
+
+
+All (recursively computable) functions can be represented by lambda
+terms (the untyped lambda calculus is Turing complete). For some lambda terms, it is easy to see what function they represent:
+
+> `(\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 (\y x))` throws away its second argument:
+`(((\x (\y x)) M) N) ~~> M`
+
+and so on.
+
+It is easy to see that distinct lambda expressions can represent the same
+function, considered as a mapping from input to outputs. Obviously:
+
+ (\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 pate 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.
+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.
@@ 47,7 +281,7 @@ For example, you'll encounter the claim that declarative languages are distingui
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 this in terms of functions from worlds to extensions (an idea also associated with Church), you will hurt yourself. So too if you try to understand it in terms of mental stereotypes, another notion sometimes designated by "intension."
+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":
@@ 230,7 +464,7 @@ Here's how it looks to say the same thing in various of these languages.
(fun x > (( + ) (3) (x)))
 As we'll see below, parentheses can often be omitted in the lambda calculus too. But not in Scheme. Every parentheses has a specific role.
+ As we saw above, parentheses can often be omitted in the lambda calculus too. But not in Scheme. Every parentheses has a specific role.
4. Supplying an argument to an anonymous function
@@ 364,7 +598,7 @@ Here's how it looks to say the same thing in various of these languages.
let x = A;;
... rest of the file or interactive session ...
 It's easy to be lulled into thinking this is a kind of imperative construction. *But it's not!* It's really just a shorthand for the compound "let"expressions we've already been looking at, taking the maximum syntactically permissible scope. (Compare the "dot" convention in the lambda calculus, discussed below.)
+ It's easy to be lulled into thinking this is a kind of imperative construction. *But it's not!* It's really just a shorthand for the compound "let"expressions we've already been looking at, taking the maximum syntactically permissible scope. (Compare the "dot" convention in the lambda calculus, discussed above.)
9. Some shorthand
@@ 407,7 +641,7 @@ Here's how it looks to say the same thing in various of these languages.
which just means:
 (let [(bar (lambda (x) B))] ... rest of the file or interactive session ...)
+ (let* [(bar (lambda (x) B))] ... rest of the file or interactive session ...)
which just means:
@@ 429,17 +663,19 @@ Here's how it looks to say the same thing in various of these languages.
int x = 3;
x = 2;
 *but it's not the same!* In the latter case we have mutation, in the former case we don't. You will learn to recognize the difference as we proceed.
+ but it's not the same! In the latter case we have mutation, in the former case we don't. You will learn to recognize the difference as we proceed.
The OCaml expression just means:
(fun x > ((fun x > x) 2) 3)
 and there's no more change of state going on here than there is in:
+ and there's no more mutation going on there than there is in:

 &exists;x. (F x and &exists;x (not (F x)))

+ + ∀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
@@ 447,296 +683,110 @@ Some more comparisons between Scheme and OCaml
11. Simple predefined values
 Numbers in Scheme: 2, 3
 In OCaml: 2, 3
+ Numbers in Scheme: `2`, `3`
+ In OCaml: `2`, `3`
 Booleans in Scheme: #t, #f
 In OCaml: true, false
+ Booleans in Scheme: `#t`, `#f`
+ In OCaml: `true`, `false`
 The eighth letter in the Latin alphabet, in Scheme: #\h
 In OCaml: 'h'
+ 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)
+ Ordered pairs in Scheme: `'(2 . 3)`
+ In OCaml: `(2, 3)`
 Lists 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: []
+ The empty list, in Scheme: `'()`
+ In OCaml: `[]`
 The string consisting just of the eighth letter of the Latin alphabet, in Scheme: "h"
 In OCaml: "h"
+ The string consisting just of the eighth letter of the Latin alphabet, in Scheme: `"h"`
+ In OCaml: `"h"`
 A longer string, in Scheme: "horse"
 In OCaml: "horse"
+ A longer string, in Scheme: `"horse"`
+ In OCaml: `"horse"`
 A shorter string, in Scheme: ""
 In OCaml: ""
+ A shorter string, in Scheme: `""`
+ In OCaml: `""`
13. Function application
 Binary functions in OCaml: foo 2 3
+ Binary functions in OCaml: `foo 2 3`
 Or: ( + ) 2 3
+ Or: `( + ) 2 3`
 These are the same as: ((foo 2) 3). In other words, functions in OCaml are "curried". foo 2 returns a 2fooer, which waits for an argument like 3 and then foos 2 to it. ( + ) 2 returns a 2adder, which waits for an argument like 3 and then adds 2 to it.
+ 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.
 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.
+ 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.
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.
+What "sequencing" is and isn't
+
+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.
Computation = sequencing changes?

 Different notions of sequencing

 Concatanation / syntactic complexity is not sequencing

 Shadowing is not mutating

 Define isn't mutating




(let [(three 3) (two 2)] (+ 3 2))



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 typebut 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:


Variables: x
, y
, z
...


Each variable is an expression. For any expressions M and N and variable a, the following are also expressions:


Abstract: (λa M)


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.

For instance:


> 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 ⊳
.
+Third, the kinds of bindings we see in:
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:
+ (define foo A)
+ (foo 2)
 M <~~> N
+Or even:
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.)
+ (define foo A)
+ (define foo B)
+ (foo 2)
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:
+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.
> T is defined to be `(M N)`.
+Since Scheme and OCaml also do permit imperatival constructions, they do have syntax for genuine sequencing. In Scheme it looks like this:
We'll regard the following two expressions:
+ (begin A B C)
 (\x (x y))
+In OCaml it looks like this:
 (\z (z y))
+ begin A; B; C end
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.
+Or this:
Note that neither of those expressions are identical to:
+ (A; B; C)
 (\x (x w))
+In the presence of imperatival elements, sequencing order is very relevant. For example, these will behave differently:
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


All (recursively computable) functions can be represented by lambda
terms (the untyped lambda calculus is Turing complete). For some lambda terms, it is easy to see what function they represent:

> `(\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 (\y x))` throws away its second argument:
`(((\x (\y x)) M) N) ~~> M`

and so on.

It is easy to see that distinct lambda expressions can represent the same
function, considered as a mapping from input to outputs. Obviously:

 (\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)
+ (begin (print "under") (print "water"))
+
+ (begin (print "water") (print "under"))
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.
+And so too these:
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.
+ begin x := 3; x := 2; x end
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).
+ begin x := 2; x := 3; x end
+However, if A and B are purely functional, nonimperatival expressions, then:
+ begin A; B; C end
Booleans and pairs
==================
+just evaluates to C (so long as A and B evaluate to something at all). So:
Our definition of these is reviewed in [[Assignment1]].
+ 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.
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.

+We'll discuss this more as the seminar proceeds.
1. Declarative vs imperatival models of computation.