Ruse compiler does translate to cps and then use a trampoline to avoid
stack depth limit. It is slow but it works. The "counter" demo shows
acceptable speed performance both loading speed and execution speed.
Maybe memory could be better, but it is just getting started.
Of course, there's always Henry Baker's "Cheney on the MTA" algorithm that Chicken and Spock use, maybe some other Schemes.
John Cowan
http://vrici.lojban.org/~cowan xxxxxx@ccil.orgLong-short-short, long-short-short / Dactyls in dimeter,
Verse form with choriambs / (Masculine rhyme):
One sentence (two stanzas) / Hexasyllabically
Challenges poets who / Don't have the time. --robison who's at texas dot net