Please use this identifier to cite or link to this item:
Title: Redundant call elimination via tupling
Authors: Chin, W.-N. 
Khoo, S.-C. 
Jones, N.
Issue Date: 2006
Citation: Chin, W.-N.,Khoo, S.-C.,Jones, N. (2006). Redundant call elimination via tupling. Fundamenta Informaticae 69 (1-2) : 1-37. ScholarBank@NUS Repository.
Abstract: Redundant call elimination has been an important program optimisation process as it can produce super-linear speedup in optimised programs. In this paper, we investigate use of the tupling transformation in achieving this optimisation over a first-order functional language. Standard tupling technique, as described in [6], works excellently in a restricted variant of the language; namely, functions with single recursion argument. We provide a semantic understanding of call redundancy, upon which we construct an analysis for handling the tupling of functions with multiple recursion arguments. The analysis provides a means to ensure termination of the tupling transformation. As the analysis is of polynomial complexity, it makes the tupling suitable as a step in compiler optimisation.
Source Title: Fundamenta Informaticae
ISSN: 01692968
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

checked on Oct 13, 2018

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.