The Under-Appreciated Unfold

The Under-Appreciated Unfold (1998)

Cached

Download Links

[web.comlab.ox.ac.uk]
[ftp.comlab.ox.ac.uk]

Other Repositories/Bibliography

DBLP

by Jeremy Gibbons , Geraint Jones

Venue:	In Proceedings of the Third ACM SIGPLAN International Conference on Functional Programming
Citations:	43 - 10 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	The Under-Appreciated Unfold	user correction - Legacy Corrections
AUTHOR NAME	Jeremy Gibbons	SVM HeaderParse 0.1
AUTHOR AFFIL	School of Computing and Math. Sciences; Oxford Brookes University	SVM HeaderParse 0.2
AUTHOR ADDR	Gipsy Lane, Headington,; Oxford OX3 0BP, UK.	SVM HeaderParse 0.1
AUTHOR NAME	Geraint Jones	SVM HeaderParse 0.1
AUTHOR AFFIL	Oxford University Computing Lab	SVM HeaderParse 0.2
AUTHOR ADDR	Wolfson Building, Parks Road; Oxford OX1 3QD, UK.	SVM HeaderParse 0.1
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 longer a fold. We calculate a characterization as an unfold from the characterization as a fold; this unfold is equally clear, but more efficient. We also calculate a characterization of breadth-first traversal directly as an unfold; this turns out to be the `standard' queue-based algorithm.	user correction - Legacy Corrections
YEAR	1998	INFERENCE
VENUE	In Proceedings of the Third ACM SIGPLAN International Conference on Functional Programming	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	273--279	INFERENCE
CITATIONS	26 found	ParsCit 1.0