Shrinking lambda expressions in linear time

  • Authors:

  • Andrew W. Appel;Trevor Jim

  • Affiliations:

  • Princeton University, Princeton, NJ 08544-2087, USA (e-mail: appel@princeton.edu);University of Pennsylvania, Philadelphia, PA 19104-6389, USA (e-mail: tjim@saul.cis.upenn.edu)

  • Venue:
  • Journal of Functional Programming
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

Abstract

Functional-language compilers often perform optimizations based on beta and delta reduction. To avoid speculative optimizations that can blow up the code size, we might wish to use only shrinking reduction rules guaranteed to make the program smaller: these include dead-variable elimination, constant folding, and a restricted beta rule that inlines only functions that are called just once. The restricted beta rule leads to a shrinking rewrite system that has not previously been studied. We show some efficient normalization algorithms that are immediately useful in optimizing compilers; and we give a confluence proof for our system, showing that the choice of normalization algorithm does not affect final code quality.