the S-m-n theorem
Exists computable f:N2→N so that
φf(x,y)(z)=φx(y,z)
Note that this theorem rests relative to the choice of indexing φ
This is just saying we can computably perform currying, which is the canonical isomorphism
(a×b)→c ≅ a→(b→c)
where → forms a collection of functions