Sciweavers

Share
IFL
2004
Springer

Shrinking Reductions in SML.NET

9 years 4 months ago
Shrinking Reductions in SML.NET
One performance-critical phase in the SML.NET compiler involves rewriting intermediate terms to monadic normal form and performing non-duplicating β-reductions. We present an imperative algorithm for this simplification phase, working with a mutable, pointerbased term representation, which significantly outperforms our existing functional algorithm. This is the first implementation and evaluation of a linear-time rewriting algorithm proposed by Appel and Jim.
Nick Benton, Andrew Kennedy, Sam Lindley, Claudio
Added 02 Jul 2010
Updated 02 Jul 2010
Type Conference
Year 2004
Where IFL
Authors Nick Benton, Andrew Kennedy, Sam Lindley, Claudio V. Russo
Comments (0)
books