| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6870944 | Computer Languages, Systems & Structures | 2018 | 27 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Joachim Breitner,