返回
Optimizing register spills for eager functional languages
DOI:10.1016/S0167-739X(02)00035-3.png)
摘要
En 中文
Functional programs are referentially transparent in the sense that the order of evaluation of subexpressions in an expression does not matter. Any order of evaluation leads to the same result. In the context of a compilation strategy for eager functional languages, we discuss an optimization problem, which we call the optimal evaluation ordering problem (OEOP). We show that the problem is NP-complete and discuss heuristics to solve this problem. (C) 2002 Elsevier Science B.V. All rights reserved.
Keyword:
NP-completeness
functional languages
register utilization
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
F
IF:
6.1
论文数:
6.8K
被引数:
2.3W
机构
暂无机构信息
引用论文
没有更多内容

