(Enter summary)
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, we 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... (Update)
Cited by: More
Algebras for combinatorial search - Michael Spivey Oxford
(Correct)
Fission for Program Comprehension - Jeremy Gibbons Oxford
(Correct)
Design Patterns as Higher-Order Datatype-Generic Programs - Gibbons (2006)
(Correct)
Similar documents (at the sentence level):
73.1%: The Under-Appreciated Unfold - Gibbons, Jones (1998)
(Correct)
Active bibliography (related documents): More All
0.5: Generic Downwards Accumulations - Gibbons (2000)
(Correct)
0.5: Polytypic Downwards Accumulations - Gibbons (1998)
(Correct)
0.3: The Role of Lazy Evaluation in Amortized Data Structures - Okasaki (1996)
(Correct)
Similar documents based on text: More All
0.5: Streaming Algorithms (Extended Abstract) - Gibbons
(Correct)
0.5: Streaming Representation-Changers - Gibbons (2004)
(Correct)
0.4: Embedding Logics in the Local Computation - Nic Wilson And
(Correct)
Related documents from co-citation: More All
12: Introduction to Functional Programming using Haskell 2nd ed (context) - Bird - 1998
12: Algebras of Programming (context) - Bird, de Moor - 1996
10: Functional programming with bananas (context) - Meijer, Fokkinga et al. - 1991
BibTeX entry: (Update)
J. Gibbons and G. Jones. The under-appreciated unfold. In 3rd ACM SIGPLAN International Conference on Functional Programming 1998, 1998. http://citeseer.ist.psu.edu/gibbons98underappreciated.html More
@incollection{ gibbons98underappreciated,
author = "Jeremy Gibbons and Geraint Jones",
title = "The Under-Appreciated Unfold",
booktitle = "Proceedings 3rd {ACM} {SIGPLAN} Int.\ Conf.\ on Functional Programming, {ICFP}'98, Baltimore, {MD}, {USA}, 26--29 Sept.\ 1998",
volume = "34(1)",
publisher = "ACM Press",
address = "New York",
pages = "273--279",
year = "1998",
url = "citeseer.ist.psu.edu/gibbons98underappreciated.html" }
Citations (may not include all citations):
333
An Introduction to Functional Programming (context) - Bird, Wadler - 1988
324
Deforestation: Transforming programs to eliminate trees
- Wadler - 1990
206
Why functional programming matters
- Hughes - 1989
108
Introduction to Functional Programming Using Haskell (context) - Bird - 1998
104
Science of Computer Programming (context) - Malcolm, program - 1990
81
The promotion and accumulation strategies in transformationa.. (context) - Bird - 1984
81
The promotion and accumulation strategies in transformationa.. (context) - Bird - 1985
77
Type Theory and Functional Programming (context) - Thompson - 1991
52
Functional programming with bananas (context) - Meijer, Fokkinga et al. - 1991
51
A calculational fusion system HYLO
- Onoue, Hu et al. - 1997
47
Continuation-based program transformation strategies (context) - Wand - 1980
46
Deriving structural hylomorphisms from recursive definitions
- Hu, Iwasaki et al. - 1996
39
A typed lambda calculus with categorical type constructors (context) - Hagino - 1987
36
Texts and Monographs in Computer Science (context) - Gries, of - 1981
28
Research Topics in Functional Programming (context) - Turner - 1990
23
Revisiting catamorphisms over datatypes with embedded functi..
- Fegaras, Sheard - 1996
21
Real-time queue operations in pure Lisp (context) - Hood, Melville - 1981
19
Simple and efficient purely functional queues and deques
- Okasaki - 1995
12
Available as Technical Monograph PRG (context) - Gibbons, Tree et al. - 1991
9
First steps towards the theory of rose trees (context) - Meertens - 1988
9
A symmetric set of efficient list operations (context) - Hoogerwoord - 1992
8
An efficient functional implementation of FIFO queues (context) - Burton - 1982
7
Personal communication (context) - Moller - 1993
6
Linear-time breadth-first tree algorithms: An exercise in th..
- Jones, Gibbons - 1993
3
Earlier version appears as Technical Report No (context) - Gibbons, drawings et al. - 1996
3
Simon Peyton Jones (context) - Peterson, Hammond et al. - 1997
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://web.comlab.ox.ac.uk/oucl/work/jeremy.gibbons/publications/index.html): More
Computing Downwards Accumulations on Trees Quickly - Gibbons (1996)
(Correct)
Bridging the Algorithm Gap: A Linear-time Functional Program .. - de Moor, Gibbons (1999)
(Correct)
Dotted and Dashed Lines in METAFONT - Gibbons
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC