Views: a way for pattern matching to cohabit with data abstraction
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Purely functional data structures
Purely functional data structures
The Science of Programming
The Definition of Standard ML
A simple implementation technique for priority search queues
Proceedings of the sixth ACM SIGPLAN international conference on Functional programming
MPC '02 Proceedings of the 6th International Conference on Mathematics of Program Construction
Inductive graphs and functional graph algorithms
Journal of Functional Programming
Theory and applications of inverting functions as folds
Science of Computer Programming - Special issue on mathematics of program construction (MPC 2002)
Pretty printing with lazy dequeues
ACM Transactions on Programming Languages and Systems (TOPLAS)
On the dynamic extent of delimited continuations
Information Processing Letters
Finger trees: a simple general-purpose data structure
Journal of Functional Programming
On the static and dynamic extents of delimited continuations
Science of Computer Programming
Proceedings of the 2006 workshop on ML
Tools and libraries to model and manipulate circular programs
Proceedings of the 2007 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
A shortcut fusion rule for circular program calculation
Haskell '07 Proceedings of the ACM SIGPLAN workshop on Haskell workshop
On the dynamic extent of delimited continuations
Information Processing Letters
Strictification of circular programs
Proceedings of the 20th ACM SIGPLAN workshop on Partial evaluation and program manipulation
Shortcut fusion rules for the derivation of circular and higher-order programs
Higher-Order and Symbolic Computation
| Hi-index | 0.00 |
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.