Optimizing Register Spills for Eager Functional Languages

Authors:
Sounaka Mishra;Kripasindhu Sikdar;Manoranjan Satpathy
Affiliations:
-;-;-
Venue:
ICCS '01 Proceedings of the International Conference on Computational Science-Part II
Year:
2001

Citing 5
Cited 1

Compilers: principles, techniques, and tools

Compilers: principles, techniques, and tools
An introduction to functional programming

An introduction to functional programming
Subprogram Inlining: A Study of its Effects on Program Execution Time

IEEE Transactions on Software Engineering
Code Generation for Expressions with Common Subexpressions

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

On approximability of linear ordering and related NP-optimization problems on graphs

Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 Call Ordering Problem. We shaow that the problem is NP-complete and discuss heuristics to solve this problem.