Under-appreciated unfold
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, we present (indeed, we calculate) a number of algorithms for computing the breadth-first traversal of a tree. We specify brea...
| Main Authors: | , |
|---|---|
| 格式: | Journal article |
| 语言: | English |
| 出版: |
Association for Computing Machinery
1998
|