Publication View

When is a function a fold or an unfold (2001)

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. 1

Publication details
Download http://citeseerx.ist.psu.edu/viewdoc/summary?doi=?doi=10.1.1.103.6073
Source http://www.cs.nott.ac.uk/~txa/publ/cmcs01.pdf
Publisher Elsevier
Contributors CiteSeerX
Repository CiteSeerX - Scientific Literature Digital Library and Search Engine (United States)
Type text
Language English
Relation 10.1.1.41.125, 10.1.1.37.1418, 10.1.1.47.1361, 10.1.1.36.4082, 10.1.1.39.5086, 10.1.1.38.2678, 10.1.1.42.1735, 10.1.1.34.1618, 10.1.1.42.6862, 10.1.1.43.5501, 10.1.1.22.1438, 10.1.1.64.823, 10.1.1.103.7480, 10.1.1.63.9058, 10.1.1.133.9794, 10.1.1.16.8985, 10.1.1.108.2008, 10.1.1.11.2933, 10.1.1.61.3043