Conference item icon

Conference item

The under-appreciated unfold

Abstract:

Folds are appreciated by functional programmers. Their dual, unfolds, are not new, but they are not nearly as well appreciated. We believe they deserve better. To illustrate, ve present (indeed, we calculate) a number of algorithms for computing the breadth-first traversal of a tree. We specify breadth-first traversal in terms of level-order traversal, which we characterize first as a fold. The presentation as a fold is simple, but it is inefficient, and removing the inefficiency makes it no ...

Expand abstract
Publication status:
Published

Actions


Access Document


Publisher copy:
10.1145/291251.289455

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Role:
Author
Volume:
34
Issue:
1
Pages:
273-279
Host title:
ACM SIGPLAN NOTICES
Publication date:
1999-01-01
DOI:
ISSN:
0362-1340
Source identifiers:
163496
Keywords:
Pubs id:
pubs:163496
UUID:
uuid:41f346e0-dac8-47dc-9658-c07b2305b0aa
Local pid:
pubs:163496
Deposit date:
2012-12-19

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP