When is a Function a Fold or an Unfold?
Jeremy Gibbons‚ Graham Hutton and Thorsten Altenkirch
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.
Details
| Journal |
Electronic Notes in Theoretical Computer Science |
| Month |
apr |
| Note |
Proceedings of Coalgebraic Methods in Computer Science |
| Number |
1 |
| Volume |
44 |
| Year |
2001 |
Links
Related pages
|
People |
|
|
Activities |