Skip to main content
Article thumbnail
Location of Repository

Improving supercompilation: tag-bags, rollback, speculation, normalisation, and generalisation

By Maximilian Bolingbroke and Simon Peyton Jones

Abstract

Supercompilation is a powerful technique for program optimisation and theorem proving. In this paper we describe and evaluate three improvements to the Cambridge Haskell Supercompiler (CHSC). We reduce supercompiled program size by the use of a weak normaliser and aggressive rollback, and we improve the performance of supercompiled programs by heap speculation and generalisation. Our generalisation method is simpler than those in the literature, and is better at generalising computations involving primitive operations such as those on machine integers. We also provide the first comprehensive account of the tag-bag termination mechanism

Topics: General Terms
Year: 2011
OAI identifier: oai:CiteSeerX.psu:10.1.1.363.5323
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cl.cam.ac.uk/~mb566... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.