KIT | KIT-Bibliothek | Impressum | Datenschutz
Originalveröffentlichung
DOI: 10.1007/978-3-319-14675-1_3
Scopus
Zitationen: 4

Call Arity

Breitner, Joachim

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, but the existing analyses are 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 based on their uses, instead of their definitions, and is very precise in the presence of recursion. Its inclusion in GHC now allows to fuse foldl-based combinators.


Zugehörige Institution(en) am KIT Institut für Programmstrukturen und Datenorganisation (IPD)
Publikationstyp Proceedingsbeitrag
Jahr 2015
Sprache Englisch
Identifikator ISBN: 978-331-91467-4-4
ISSN: 1611-3349
KITopen ID: 1000049757
Erschienen in Trends in Functional Programming : 15th International Symposium, TFP 2014, Soesterberg, The Netherlands, May 26-28, 2014. Revised Selected Papers. Ed.: J. Hage E
Verlag Springer, Cham
Seiten 34-50
Serie Lecture notes in computer science ; 8843
KIT – Die Forschungsuniversität in der Helmholtz-Gemeinschaft KITopen Landing Page