The good news
However, we’re still not in trouble
Church proved a theorem that shows that any recursive function can be written non-recursively in the lambda calculus
- So we can use recursion without (this) danger in defining programs in functional languages