Abstract
A great deal of effort is currently being directed towards the development of optimization techniques for functional languages. In particular, for lazy languages strictness analysis is capable of yielding performance improvements by indicating where function arguments may safely be evaluated before (or concurrently with) function application without altering the meaning of a program; the optimization that results is the avoidance of the run time construction and detection of closures (or better utilization of a multiprocessor machine). An indication of the possible gains to be made can be seen in experiments reported in [1], where improvements in execution speed ranging from about three to twenty times were observed.KeywordsFunctional programmingoptimizationstrictness analysisabstract interpretation
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
