[gambit-list] A question about CPS conversion

C K Kashyap ckkashyap at gmail.com
Tue Jul 10 17:54:16 EDT 2018


Hi Marc et al,

I've been exploring the 90-minutes scheme to c and trying to get my head
around it. I think I am pretty close to the aha moment.

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?

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?

Regards,
Kashyap
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mailman.iro.umontreal.ca/pipermail/gambit-list/attachments/20180710/2545a9d9/attachment.htm>


More information about the Gambit-list mailing list