When is a function a fold or an unfold?
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. ©2001 Published by Elsevier...
| Main Authors: | , , |
|---|---|
| Format: | Conference item |
| Published: |
2001
|
| Summary: | 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. ©2001 Published by Elsevier Science B. V. |
|---|