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.
Chapter PDF
Similar content being viewed by others
References
Aho A. V., Johnson S. C. & Ullman J. D., Code generation for expressions with common subexpressions, JACM, Vol. 24(1), January 1977, pp. 146–160.
Aho A. V., Sethi R. & Ullman J. D., Compilers: Principles, Techniques and Tools, Addison Wesley, 1986.
Bird R. & Wadler P., Introduction to Functional Programming, Printice Hall, 1988.
Davidson J. W. & Holler A. M., Subprogram Inlining: A study of its effect on program execution time, IEEE Tr. on Software Engineering, Vol. 18(2), Feb. 1992, pp. 89–102.
Garey M. R. & Johnson D. S., Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman and Company, New York, 1979.
Grotschel M., Junger M. & Reinelt G., On the acyclic subgraph polytope, Math. Programming 33 (1985), pp. 28–42.
Harary F., Graph Theory, Addition-Wesley, Reading, MA, 1969.
Satpathy M., Sanyal A & Venkatesh G., Improved Register Usage of Functional Programs through multiple function versions, Journal of Functional and Logic Programming, December 1998, MIT Press.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mishra, S., Sikdar, K., Satpathy, M. (2001). Optimizing Register Spills for Eager Functional Languages. In: Alexandrov, V.N., Dongarra, J.J., Juliano, B.A., Renner, R.S., Tan, C.J.K. (eds) Computational Science - ICCS 2001. ICCS 2001. Lecture Notes in Computer Science, vol 2074. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45718-6_15
Download citation
DOI: https://doi.org/10.1007/3-540-45718-6_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42233-4
Online ISBN: 978-3-540-45718-3
eBook Packages: Springer Book Archive