Factorising folds for faster functions

DOI10.1017/S0956796810000122MaRDI QIDQ3070772zbMATH OpenFDO

Authors Graham Hutton, Mauro Jaskelioff, Andy Gill

Publication date 26 January 2011

Published in Journal of Functional Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0956796810000122

zbMATH Keywords

performance of recursive programs

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• Work it, wrap it, fix it, fold it
• The worker/wrapper transformation
• Short note: Strict unwraps make worker/wrapper fusion totally correct
• Worker/wrapper/makes it/faster
• How powerful are folding/unfolding transformations?

Cites work

• A tutorial on the universality and expressiveness of fold
• Asymptotic Improvement of Computations over Free Monads
• Data structures and program transformation
• Fission for Program Comprehension
• scientific article; zbMATH DE number 1952947 (Why is no real title available?)
• Practical type inference for arbitrary-rank types
• Proof of correctness of data representations
• The worker/wrapper transformation

Cited in

(9)

• Worker/wrapper/makes it/faster
• Work it, wrap it, fix it, fold it
• Shortcut fusion for accumulating parameters & zip-like functions
• The worker/wrapper transformation
• Worker/Wrapper Transformation
• scientific article; zbMATH DE number 1940296 (Why is no real title available?)
• Notions of computation as monoids
• Folding left and right matters: Direct style, accumulators, and continuations
• Program optimisations via hylomorphisms for extraction of executable code

Describes a project that uses

Uses Software

• Haskell

This page was built for publication: Factorising folds for faster functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3070772)