Flattening tuples in an SSA intermediate representation

DOI10.1007/S10990-008-9035-3zbMath1175.68107OpenAlexW2018436366MaRDI QIDQ1029812

Suresh Jagannathan, Lukasz Ziarek, Stephen Weeks

Publication date: 13 July 2009

Published in: Higher-Order and Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10990-008-9035-3

zbMATH Keywords

optimizationflatteningcompilationSSAtuplesunboxing

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20)

Uses Software

• TIL

Cites Work

• Unnamed Item
• Deforestation: Transforming programs to eliminate trees
• Definitional interpreters for higher-order programming languages
• A retrospective on region-based memory management
• From ML to Ada: Strongly-typed language interoperability via source translation
• On the runtime complexity of type-directed unboxing

This page was built for publication: Flattening tuples in an SSA intermediate representation