3 ms·
You can write a lambda calculus interpreter which does beta-reduction. In this case, there is no stack which could overflow. Just a lambda expression, which is
by qznc 14y ago
You can write a lambda calculus interpreter which does beta-reduction. In this case, there is no stack which could overflow. Just a lambda expression, which is reduced to another expression.
- kragen 14y agoYes, as I mentioned in another comment in this thread, TCE falls out automatically from combinator-graph reduction.