Hi,
On 10/07/18 23:54, C K Kashyap wrote:
I have a question though - Is there any limitation to CPS conversation? As in, are there programs that cannot be transformed such that all calls are tail calls?
There are no limitations, the CPS conversion is a total transformation. The evaluation of any expression in Scheme has necessarily a continuation, the transformation just makes this continuation explicit.
If I understood it right - the 90 minutes scheme to C implementation has not taken any short cut and is turning complete - my logic of arriving at this conclusion is simple - you can define functions and call them so it's complete lambda calculus and so turning complete :) - is that correct?
Basically, yes.
Cheers,