If you restrict the input language sufficiently so that all functions have a known number of inputs and outputs and all conditionals leave the stack balanced (a

If you restrict the input language sufficiently so that all functions have a known number of inputs and outputs and all conditionals leave the stack balanced (as Cat does by virtue of its static type system), you can convert a stack program into SSA form pretty easily and apply the same optimizations as you would with an applicative language.