Publications

BibTex format

@article{Hinze:2013:10.1145/2544174.2500578,
author = {Hinze, R and Wu, N and Gibbons, J},
doi = {10.1145/2544174.2500578},
journal = {ACM SIGPLAN Notices},
pages = {209--220},
title = {Unifying structured recursion schemes},
url = {http://dx.doi.org/10.1145/2544174.2500578},
volume = {48},
year = {2013}
}

Download

RIS format (EndNote, RefMan)

TY  - JOUR
AB  - <jats:p>Folds over inductive datatypes are well understood and widely used. In their plain form, they are quite restricted; but many disparate generalisations have been proposed that enjoy similar calculational benefits. There have also been attempts to unify the various generalisations: two prominent such unifications are the 'recursion schemes from comonads' of Uustalu, Vene and Pardo, and our own 'adjoint folds'. Until now, these two unified schemes have appeared incompatible. We show that this appearance is illusory: in fact, adjoint folds subsume recursion schemes from comonads. The proof of this claim involves standard constructions in category theory that are nevertheless not well known in functional programming: Eilenberg-Moore categories and bialgebras.</jats:p>
AU  - Hinze,R
AU  - Wu,N
AU  - Gibbons,J
DO  - 10.1145/2544174.2500578
EP  - 220
PY  - 2013///
SN  - 0362-1340
SP  - 209
TI  - Unifying structured recursion schemes
T2  - ACM SIGPLAN Notices
UR  - http://dx.doi.org/10.1145/2544174.2500578
VL  - 48
ER  -

Download

DrNicolasWu

Contact

Location

Summary

Citation

BibTex format

RIS format (EndNote, RefMan)