Shrinking reductions in SML. NET

N. Benton; A. Kennedy; S. Lindley; C. Russo

doi:10.1007/11964681

Shrinking reductions in SML. NET

N. Benton, A. Kennedy, S. Lindley, C. Russo

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract / Description of output

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.

Original language	English
Title of host publication	Implementation and Application of Functional Languages
Publisher	Springer
Pages	142-159
Number of pages	18
ISBN (Print)	978-3-540-69174-7
DOIs	https://doi.org/10.1007/11964681
Publication status	Published - 2005

Access to Document

10.1007/11964681

Benton Kennedy ET AL 2005 Shrinking Reductions in SML.NETSubmitted manuscript, 263 KB

Cite this

@inproceedings{5399ef1d475e4f3494840b8b4bb20d64,

title = "Shrinking reductions in SML. NET",

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 algorithmfor this simplification phase, working with a mutable, pointerbasedterm representation, which significantly outperforms our existingfunctional algorithm.",

author = "N. Benton and A. Kennedy and S. Lindley and C. Russo",

year = "2005",

doi = "10.1007/11964681",

language = "English",

isbn = "978-3-540-69174-7",

pages = "142--159",

booktitle = "Implementation and Application of Functional Languages",

publisher = "Springer",

}

TY - GEN

T1 - Shrinking reductions in SML. NET

AU - Benton, N.

AU - Kennedy, A.

AU - Lindley, S.

AU - Russo, C.

PY - 2005

Y1 - 2005

N2 - 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 algorithmfor this simplification phase, working with a mutable, pointerbasedterm representation, which significantly outperforms our existingfunctional algorithm.

AB - 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 algorithmfor this simplification phase, working with a mutable, pointerbasedterm representation, which significantly outperforms our existingfunctional algorithm.

U2 - 10.1007/11964681

DO - 10.1007/11964681

M3 - Conference contribution

SN - 978-3-540-69174-7

SP - 142

EP - 159

BT - Implementation and Application of Functional Languages

PB - Springer

ER -

Shrinking reductions in SML. NET

Abstract / Description of output

Access to Document

Fingerprint

Cite this