II(IX) ~~> IIX ~~> IX ~~> X
-The reduction rule for K is also straigtforward:
+The reduction rule for K is also straightforward:
KXY ~~> X
We've already established that the behavior of combinatory terms can be perfectly mimicked by lambda terms: just replace each combinator with its equivalent lambda term, i.e., replace I with `\x.x`, replace K with `\fxy.x`, and replace S with `\fgx.fx(gx)`. How about the other direction? Here is a method for converting an arbitrary lambda term into an equivalent Combinatory Logic term using only S, K, and I. Besides the intrinsic beauty of this mapping, and the importance of what it says about the nature of binding and computation, it is possible to hear an echo of computing with continuations in this conversion strategy (though you would be able to hear these echos until we've covered a considerable portion of the rest of the course).
-
+Assume that for any lambda term T, [T] is the equivalent combinatory logic term. The we can define the [.] mapping as follows:
+ lambda term equivalent SKI term condition
+ ----------- ------------------- ---------
+ 1. [\x.x] I
+ 2. [\x.M] K[M] x does not occur free in M
+ 3. [\x.(M N)] S[\x.M][\x.N]
+ 4. [\x\y.M] [\x[\y.M]]
+ 5. [M N] [M][N]
+It's easy to understand these rules based on what S, K and I do. The first rule is obvious.
+The second rule says that if a lambda abstract contains no occurrences of the variable targeted by lambda,
+what the function expressed by that lambda term does it throw away its argument and returns whatever M
+computes: it's the constant function K[M].
+The third and fourth rules say what happens when there are occurrences of the bound variable in the body.
+
+Finally, the fifth rule says what to do for an application (divide and conquer).
These systems are Turing complete. In other words: every computation we know how to describe can be represented in a logical system consisting of only a single primitive operation!