I have two related questions:
- Do you know of any good reference to the recursive function / lambda-calculus equivalence in terms of computability, including proofs?
- Do you know of any reference to subclasses of computable layers in lambda-calculus, like you have in recursion theory? It looks like you can't "dumb down" lambda-calculus but I'm not sure about that. And if we can't "dumb it down" to less computable classes, I'd love some reference to why this is so.