When is a Function a Fold or an Unfold?

@incollection{citeulike:571136, abstract = {We give a necessary and su\#cient 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}, address = {Amsterdam}, author = {Gibbons, Jeremy and Hutton, Graham and Altenkirch, Thorsten }, booktitle = {Proceedings 4th Workshop on Coalgebraic Methods in Computer Science, CMCS'01, Genova, Italy, 6--7 Apr.\ 2001}, citeulike-article-id = {571136}, editor = {Corradini, Andrea and Lenisa, Marina and Montanari, Ugo }, keywords = {gpgpu, streams}, posted-at = {2006-03-30 21:18:51}, priority = {2}, publisher = {Elsevier}, title = {When is a Function a Fold or an Unfold?}, url = {http://citeseer.ist.psu.edu/gibbons01when.html}, volume = {44(1)}, year = {2001} }

TY - CHAP ID - citeulike:571136 L3 - citeulike-article-id:571136 TI - When is a Function a Fold or an Unfold? T2 - Proceedings 4th Workshop on Coalgebraic Methods in Computer Science, CMCS'01, Genova, Italy, 6--7 Apr.\ 2001 VL - 44(1) AD - Amsterdam PB - Elsevier N2 - We give a necessary and su#cient 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 KW - gpgpu KW - streams AU - Gibbons, Jeremy AU - Hutton, Graham AU - Altenkirch, Thorsten A2 - Corradini, Andrea A2 - Lenisa, Marina A2 - Montanari, Ugo PY - 2001/// UR - http://citeseer.ist.psu.edu/gibbons01when.html ER -