Abstract
We study various shortcut fusion rules for languages like Haskell. Following a careful semantic account of a recently proposed rule for circular program transformation, we propose a new rule that trades circularity for higher-orderedness, and thus attains better semantic properties. This also leads us to revisit the original foldr/build-rule, as well as its dual, and to develop variants that do not suffer from detrimental impacts of Haskell's mixed strict/nonstrict semantics. Throughout, we offer pragmatic insights about our new rules to investigate also their relative effectiveness, rather than just their semantic correctness. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Voigtländer, J. (2008). Semantics and pragmatics of new shortcut fusion rules. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4989 LNCS, pp. 163–179). https://doi.org/10.1007/978-3-540-78969-7_13
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
