Rethinking supercompilation

DOI10.1145/1863543.1863588MaRDI QIDQ5176950zbMATH OpenOpenAlexFDO

Authors Neil Mitchell

Publication date 5 March 2015

Published in Proceedings of the 15th ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1863543.1863588

zbMATH Keywords

Haskelloptimisationsupercompilation

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Theory of compilers and interpreters (68N20)

Recommendations

• Supercompilation for datatypes
• The concept of a supercompiler
• Positive supercompilation for a higher-order call-by-value language
• scientific article; zbMATH DE number 3976299
• scientific article; zbMATH DE number 2124969

Cited in

(9)

• A higher-order strategy for eliminating common subexpressions
• Assaying supertasks
• Superoptimization in LLVM
• Extension of superblock technique to hyperblock using predicate hierarchy graph
• Supercompilation for datatypes
• Data Movement Optimisation in Point-Free Form
• Experience with the Super Monaco optimizing compiler
• scientific article; zbMATH DE number 2084362 (Why is no real title available?)
• scientific article; zbMATH DE number 2124969 (Why is no real title available?)

This page was built for publication: Rethinking supercompilation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5176950)