Compiling and optimizing methods for the functional language ASL/F

AbstractA purely functional language called ASL/F is defined, and compiling and optimizing methods, by which ASL/F programs are translated into object programs that can be executed efficiently on the conventional machines, are studied. The effectiveness of those method is investigated by implementing an optimizing compiler for ASL/F and executing several sample programs. Experimental results show that (1) all optimization discussed here are useful in reducing the execution time and/or memory space requirement, and (2) the execution time of an ASL/F program is about 75 to 135% of that of a PASCAL program which implements the same algorithm