Factorising folds for faster functions

DOI10.1017/S0956796810000122zbMath1210.68047MaRDI QIDQ3070772

Andy Gill, G. Hutton, Mauro Jaskelioff

Publication date: 26 January 2011

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

zbMATH Keywords

performance of recursive programs

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items (3)

Folding left and right matters: Direct style, accumulators, and continuations ⋮ Notions of computation as monoids ⋮ Work it, wrap it, fix it, fold it

Uses Software

• Haskell

Cites Work

• Unnamed Item
• Data structures and program transformation
• Proof of correctness of data representations
• Practical type inference for arbitrary-rank types
• Asymptotic Improvement of Computations over Free Monads
• The worker/wrapper transformation
• Fission for Program Comprehension
• A tutorial on the universality and expressiveness of fold

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