Shrinking reductions in SML.NET

Nick Benton, Andrew Kennedy, Sam Lindley, Claudio Russo

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

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, pointer-based 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.

Original languageEnglish
Title of host publicationImplementation and Application of Functional Languages
Subtitle of host publicationIFL 2004
PublisherSpringer
Pages142-159
Number of pages18
ISBN (Electronic)9783540320388
ISBN (Print)9783540260943
DOIs
Publication statusPublished - 2005
Event16th International Workshop on Implementation and Application of Functional Languages 2004 - Lubeck, Germany
Duration: 8 Sep 200410 Sep 2004

Publication series

NameLecture Notes in Computer Science
Volume3474
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference16th International Workshop on Implementation and Application of Functional Languages 2004
Abbreviated titleIFL 2004
CountryGermany
CityLubeck
Period8/09/0410/09/04

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Shrinking reductions in SML.NET'. Together they form a unique fingerprint.

  • Cite this

    Benton, N., Kennedy, A., Lindley, S., & Russo, C. (2005). Shrinking reductions in SML.NET. In Implementation and Application of Functional Languages: IFL 2004 (pp. 142-159). (Lecture Notes in Computer Science; Vol. 3474). Springer. https://doi.org/10.1007/11431664_9