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.
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.
Actions (Archive Staff Only)