Skip to main content
Article thumbnail
Location of Repository

Supercompilation by evaluation

By Max Bolingbroke and Simon Peyton Jones

Abstract

Supercompilation is a technique due to Turchin [1] which allows for the construction of program optimisers that are both simple and extremely powerful. Supercompilation is capable of achieving transformations such as deforestation [2], function specialisation and constructor specialisation [3]. Inspired by Mitchell’s promising results [4], we show how the call-by-need supercompilation algorithm can be recast to be based explicitly on an evaluator, and in the process extend it to deal with recursive let expressions

Topics: functional) languages, D.3.4 [Programming Languages, Processors
Year: 2010
OAI identifier: oai:CiteSeerX.psu:10.1.1.173.1355
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.research.microsoft.... (external link)
  • Suggested articles


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