Common Subexpression Elimination in a Lazy Functional Language

Chitil, Olaf (1997) Common Subexpression Elimination in a Lazy Functional Language. In: Draft Proceedings of the 9th International Workshop on Implementation of Functional Languages. (Full text available)

PDF
Download (167kB)
[img]
Preview

Abstract

Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. To our knowledge it has not yet been applied to lazy functional programming languages, although there are several advantages. First, the referential transparency of these languages makes the identification of common subexpressions very simple. Second, more common subexpressions can be recognised because they can be of arbitrary type whereas standard common subexpression elimination only shares primitive values. However, because lazy functional languages decouple program structure from data space allocation and control flow, analysing its effects and deciding under which conditions the elimination of a common subexpression is beneficial proves to be quite difficult. We developed and implemented the transformation for the language Haskell by extending the Glasgow Haskell compiler and measured its effectiveness on real-world programs.

Item Type: Conference or workshop item (Paper)
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group
Depositing User: Mark Wheadon
Date Deposited: 01 Aug 2009 15:08
Last Modified: 06 Sep 2011 03:54
Resource URI: http://kar.kent.ac.uk/id/eprint/21455 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year