论文信息 - Breadth-first numbering: lessons from a small exercise in algorithm design

Breadth-first numbering: lessons from a small exercise in algorithm design

Every programmer has blind spots. Breadth-first numbering is an interesting toy problem that exposes a blind spot common to many---perhaps most---functional programmers.

Chris Okasaki | Chris Okasaki

[1] Robin Milner,et al. Definition of standard ML , 1990 .

[2] Robert HOOD,et al. Real-Time Queue Operation in Pure LISP , 1980, Inf. Process. Lett..

[3] Chris Okasaki,et al. Simple and efficient purely functional queues and deques , 1995, Journal of Functional Programming.

[4] Philip Wadler,et al. Views: a way for pattern matching to cohabit with data abstraction , 1987, POPL '87.

[5] F. Warren Burton,et al. An Efficient Functional Implementation of FIFO Queues , 1982, Information Processing Letters.

[6] Rob R. Hoogerwoord,et al. Functional Pearls A symmetric set of efficient list operations , 1992, Journal of Functional Programming.

[7] Jeremy Gibbons,et al. Linear−time Breadth−first Tree Algorithms: An Exercise in the Arithmetic of Folds and Zips , 1993 .

[8] David Gries,et al. The Science of Programming , 1981, Text and Monographs in Computer Science.

[9] Chris Okasaki,et al. Purely functional data structures , 1998 .