Optimizing abstract SECD machine code (Q2763597)

A new algorithm for optimizing abstract SECD machine code is presented. In the introduction the standard way to implement functional languages is described. The second part contains 21 commands of Henderson's version of the SECD machine and the description of the SECD to Modula-2 translator. After that two techniques used in the new algorithm for optimizing are exposed. These techniques are based on the more effective usage of the top of the stack S and the special handling of constant declaration. The results of optimizing are presented by using seven benchmark programs. Two tables with numerical data show that the speedup ratio of optimized programs with respect to non-optimized programs is increased by 25\%--39\%.NEWLINENEWLINEFor the entire collection see [Zbl 0977.00022].