The Minor Scheme IA-32 Binary Interface       -*- mode: text -*-
               =======================================

For a first cut, allocate all activation records on the heap.  That
makes a lot of stuff really simple.

For a second cut, recognize procedures (and perhaps other objects?)
that have stack-like lifetimes.  Have the heap and the stack grow
towards each other in the nursery, so bounds checks can be
register-to-register comparisons, but we still only use two registers.