The talk will describe the implementation technique known as "Cheney-on-the-MTA", an interesting method of elegantly supporting constant-space tail call optimization, fast allocation, generational garbage collection and fast continuations. This is suitable for any dynamic language but is particularly useful for Scheme, which requires all of these features. The CHICKEN Scheme compiler is to our knowledge the only mature system implementing this strategy.