Optimizing structural recursion in functional programs

An optimization technique for the implementation of functional languages with eager evaluation is described. Recursion is compiled into a variant of the Schorr-Waite algorithm that is faster and uses less stack space than a standard runtime stack implementation. Analysis techniques are provided to determine the safety of the optimization.<
>