When is a function a fold or an unfold (2001)
Cached
Download Links
by
Jeremy Gibbons
,
Graham Hutton
,
Thorsten Altenkirch
| Venue: | Coalgebraic Methods in Computer Science, number 44.1 in Electronic Notes in Theoretical Computer Science |
| Citations: | 8 - 3 self |
BibTeX
@INPROCEEDINGS{Gibbons01whenis,
author = {Jeremy Gibbons and Graham Hutton and Thorsten Altenkirch},
title = {When is a function a fold or an unfold},
booktitle = {Coalgebraic Methods in Computer Science, number 44.1 in Electronic Notes in Theoretical Computer Science},
year = {2001},
publisher = {Elsevier}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We give a necessary and sufficient condition for when a set-theoretic function can be written using the recursion operator fold, and a dual condition for the recursion operator unfold. The conditions are simple, practically useful, and generic in the underlying datatype. 1
