Garbage Collection Can Be Faster Than Stack Allocation

Abstract:

Optimizing LISP compilers try to deduce which closures (function-call frames) may be stack-allocated, because heap-allocated closures must be garbage-collected at (presumably) great expense. In fact, with enough memory, garbage-collection becomes cheaper than decrementing a stack pointer. Special hardware,
intricate garbage-collection algorithms, and fancy compiler analysis become unnecessary.