Everything applies: so, e.g., when we see something like ABC, we actually omit the parentheses; if we include them, we have (((A)B)C). This can be confusing because applications associate to the left, but lambdas associate to the right[1].
So 11 13 (12 13) is actually (((11)13)((12)13)). In roundabout English, 11 applies to 13 which then applies to the result of 12 applies to 13.
[1] https://www.cs.cmu.edu/~anupamg/251-notes/lambda_calculus.pd...
In Python:
S = lambda x: lambda y: lambda z: x(z)(y(z))
K = lambda x: lambda y: x
I = lambda x: x
That there is runnable code and with it you can implement numbers, math, logic, etc.That's all the SKI combinators are: those functions. You apply them to themselves in various patterns and they model numbers and arithmetic and programming languages.
In [1]: S = lambda x: lambda y: lambda z: x(z)(y(z))
In [2]: K = lambda x: lambda y: x
In [3]: I = lambda x: x
In [4]: K(I)
Out[4]: <function __main__.<lambda>.<locals>.<lambda>(y)>
In [5]: _(S) is I
Out[5]: True
In [6]: K(I)(S) is I
Out[6]: True
Hope that helps.TypeError: 'int' object is not callable
Heh, yeah I did that too when I was wrapping my head around 'em. The thing to remember is that in SKI combinator logic nothing else exists. You can't pass 'int' objects to SKI because they don't exist in that universe. (Obviously you can in the sense that Python will let you do it, but it's logically meaningless.)
(I had to break out pencil and paper and walk through some evaluations of SKI expressions by hand.)
Let's have versions of I that also print their names and arg as a side effect:
def E(x):
print('E', x)
return x
def F(x):
print('F', x)
return x
def G(x):
print('G', x)
return x
Consider: S(E)(F)
Start with the definition of S: S = lambda x: lambda y: lambda z: x(z)(y(z))
Substitute: S = lambda E: lambda y: lambda z: E(z)(y(z))
So now S returns this new function (call it S') that has the E function
embedded in the closure: S' = lambda y: lambda z: E(z)(y(z))
That gets called on F: S'(F)
Substitute: S' = lambda F: lambda z: E(z)(F(z))
And this creates S'' with both E and F embedded: S'' = lambda z: E(z)(F(z))
So the result is a function that takes some function z, calls F on it,
calls G on it, and then calls the result of the first on the result of
the second. S''(G)
E(G)(F(G))
E(G) -> G ; prints "E <function G at 0x000001E0A4A741F0>"
G(F(G))
F(G) -> G ; prints "F <function G at 0x000001E0A4A741F0>"
G(G)
prints "G <function G at 0x000001E0A4A741F0>"
G <--- G returns itself.
In action: In [16]: S(E)(F)
Out[16]: <function __main__.<lambda>.<locals>.<lambda>.<locals>.<lambda>(z)>
In [17]: S(E)(F)(G)
E <function G at 0x000001E0A4A741F0>
F <function G at 0x000001E0A4A741F0>
G <function G at 0x000001E0A4A741F0>
Out[17]: <function __main__.G(x)>
Since G is also a version of I we can get away with passing it anything
(not just functions): In [18]: S(E)(F)(G)("Hi!")
E <function G at 0x000001E0A4A741F0>
F <function G at 0x000001E0A4A741F0>
G <function G at 0x000001E0A4A741F0>
G Hi!
Out[18]: 'Hi!'
That's why you can pass anything to SIII (aka S(I)(I)(I) in Python) and it returns it, because SIII = I. In [19]: S(I)(I)(I) is I
Out[19]: True
HTH
S takes 2 values, and returns 1
K takes 3 values, and returns the 1st, 3rd, and (2nd applied to 3rd)
I returns the value it is given (like a no-op)