When is a function a fold or an unfold?

Gibbons, Jeremy and Hutton, Graham and Altenkirch, Thorsten (2001) When is a function a fold or an unfold? In: Workshop on Coalgebraic Methods in Computer Science (4th), 6-7 April 2001, Genova, Italy.

[img]
Preview
PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Available under Licence Creative Commons Attribution.
Download (220kB) | Preview

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.

Item Type: Conference or Workshop Item (Paper)
Additional Information: Published in Electronic Notes in Theoretical Computer Science, 44(1), May 2001, 146-160, doi: 10.1016/S1571-0661(04)80906-X
Schools/Departments: University of Nottingham UK Campus > Faculty of Science > School of Computer Science
Depositing User: Hutton, Prof Graham
Date Deposited: 26 Feb 2015 16:11
Last Modified: 19 Sep 2016 05:50
URI: http://eprints.nottingham.ac.uk/id/eprint/28196

Actions (Archive Staff Only)

Edit View Edit View