Abstract
Higher order combinators in functional programming languages can lead to code that would be considerably more efficient if some functions’ definitions were eta-expanded. Previous analyses were not always precise enough to allow that. In particular, this has prevented foldl from efficiently taking part in list fusion.Call Arity is an analysis that eta-expands functions according to how they are used. By virtue of using a new cardinality analysis based on the notion of co-call graphs, it is sufficiently precise even in the presence of recursion, and its inclusion in the Haskell compiler GHC now enables the fusion of foldl-based combinators.
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.
