CONS Should Not CONS Its Arguments, Part II: Cheney on the M.T.A. Export

@misc{citeulike:4636, abstract = {Previous Schemes for implementing full tail-recursion when compiling into C have required some form of \"trampoline\" to pop the stack. We propose solving the tail-recursion problem in the same manner as Standard ML of New Jersey, by allocating all frames in the (garbage-collected) heap. The Scheme program is translated into continuation-passing style, so the target C functions never return. The C stack pointer then becomes the allocation pointer for a Cheney-style copying garbage collection...}, author = {Baker, Henry G.}, citeulike-article-id = {4636}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.54.7143}, howpublished = {comp.lang.scheme.c newsgroup}, keywords = {continuations, lazy, memory-management}, posted-at = {2006-04-20 19:29:37}, priority = {2}, title = {CONS Should Not CONS Its Arguments, Part II: Cheney on the M.T.A.}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.54.7143}, year = {1994} }

TY - GEN ID - citeulike:4636 L3 - citeulike-article-id:4636 N2 - Previous Schemes for implementing full tail-recursion when compiling into C have required some form of "trampoline" to pop the stack. We propose solving the tail-recursion problem in the same manner as Standard ML of New Jersey, by allocating all frames in the (garbage-collected) heap. The Scheme program is translated into continuation-passing style, so the target C functions never return. The C stack pointer then becomes the allocation pointer for a Cheney-style copying garbage collection... TI - CONS Should Not CONS Its Arguments, Part II: Cheney on the M.T.A. KW - continuations KW - lazy KW - memory-management AU - Baker, Henry PY - 1994/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.54.7143 ER -