View in EDS

Optimization of Functional Language ASL/F Programs.

Saved in:
Bibliographic Details
Title: Optimization of Functional Language ASL/F Programs.
Authors: Seki, Hiroyuki1, Taniguchi, Kenichi1, Kasami, Tadao1, Inoue, Katsuro2
Source: Systems & Computers in Japan. Jul/Aug85, Vol. 16 Issue 4, p9-18. 10p.
Subject Terms: Semantics, Program transformation, Computer software, Computer programming, Sorting (Electronic computers), Pascal (Computer program language), Information theory, Mathematical optimization
Abstract: Functional languages are known to have such advantages as simply defined semantics. However little study has been made regarding compilation or optimization methods for efficient execution on a conventional machine. This paper formulates some optimization methods compiling a functional language ASL/F program into an object program in a procedural language, and further gives some sufficient conditions to perform these optimizations. It introduces "needed-arguments first computation" and "globalization of sorts (data types)," which are new optimization methods and have not been discussed before. Sample programs which are compiled and executed by an experimental compiler perform these optimization methods, as well as elimination of duplicated computation for common subterms, elimination of tail recursion, and rewriting in compilation. These experimental results show that execution time and dynamic memory space requirement of the object program are reduced by these optimizations and the program can be executed in almost the same time as an equivalent program written in a procedural language such as PASCAL. [ABSTRACT FROM AUTHOR]
Database: Supplemental Index
Description
Abstract:Functional languages are known to have such advantages as simply defined semantics. However little study has been made regarding compilation or optimization methods for efficient execution on a conventional machine. This paper formulates some optimization methods compiling a functional language ASL/F program into an object program in a procedural language, and further gives some sufficient conditions to perform these optimizations. It introduces "needed-arguments first computation" and "globalization of sorts (data types)," which are new optimization methods and have not been discussed before. Sample programs which are compiled and executed by an experimental compiler perform these optimization methods, as well as elimination of duplicated computation for common subterms, elimination of tail recursion, and rewriting in compilation. These experimental results show that execution time and dynamic memory space requirement of the object program are reduced by these optimizations and the program can be executed in almost the same time as an equivalent program written in a procedural language such as PASCAL. [ABSTRACT FROM AUTHOR]
ISSN:08821666
DOI:10.1002/scj.4690160402