Modular, higher-order cardinality analysis in theory and practice
Modular, higher-order cardinality analysis in theory and practice
复制标题
理论与实践中的模块化、高阶基数分析
DOI：
10.1145/2535838.2535861
复制
发表时间：
2014
期刊：
影响因子：
--
通讯作者：
S. Jones
中科院分区：
文献类型：
--
作者：
Ilya Sergey;Dimitrios Vytiniotis;S. Jones
自80年代中期以来，功能性语言的编译器作家（尤其是懒惰的语言）一直在撰写有关仅使用一次的识别和利用Thunks和Lambdas的论文。然而，事实证明，在实践中很难实现权力和简单性。我们描述了一种针对高阶语言的新的模块化分析，该分析既简单又有效，并且可以介绍其在完整的，最先进的技术优化编译器中的使用中。该分析找到了许多单一入门和单发lambdas，并实现了许多程序优化。
Since the mid '80s, compiler writers for functional languages (especially lazy ones) have been writing papers about identifying and exploiting thunks and lambdas that are used only once. However it has proved difficult to achieve both power and simplicity in practice. We describe a new, modular analysis for a higher-order language, which is both simple and effective, and present measurements of its use in a full-scale, state of the art optimising compiler. The analysis finds many single-entry thunks and one-shot lambdas and enables a number of program optimisations.