-
-Let's say that for any lambda term T, [T] is the equivalent Combinatory Logic term. Then we define the [.] mapping as follows.
-
- 1. [a] = a
- 2. [(\aX)] = @a[X]
- 3. [(XY)] = ([X][Y])
-
-Wait, what is that @a ... business? Well, that's another operation on (a variable and) a CL expression, that we can define like this:
-
- 4. @aa = I
- 5. @aX = KX if a is not in X
- 6. @a(Xa) = X if a is not in X
- 7. @a(XY) = S(@aX)(@aY)
-
-
-
-