Disciplined, efficient, generalised folds for nested datatypes
| Venue: | UNDER CONSIDERATION FOR PUBLICATION IN FORMAL ASPECTS OF COMPUTING |
| Citations: | 3 - 0 self |
BibTeX
@MISC{Martin_disciplined,efficient,,
author = {Clare Martin and Jeremy Gibbons and Ian Bayley},
title = { Disciplined, efficient, generalised folds for nested datatypes},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Nested (or non-uniform, or non-regular) datatypes have recursive definitions in which the type parameter changes. Their folds are restricted in power due to type constraints. Bird and Paterson introduced generalised folds for extra power, but at the cost of a loss of efficiency: folds may take more than linear time to evaluate. Hinze introduced efficient generalised folds to counter this inefficiency, but did so in a pragmatic way: he did not provide categorical or equivalent underpinnings, so did not get the associated universal properties for manipulating folds. We combine the efficiency of Hinze’s construction with the powerful reasoning tools of Bird and Paterson’s.
