Breadth-First Traversals
- Rose Trees, Breadth-First - March 17, 2018
- Breadth-First Rose Trees: Traversals and the Cofree Comonad - June 1, 2018
- Breadth-First Traversals in Far Too Much Detail - June 3, 2018
- Scheduling Effects - June 23, 2018
- Pure and Lazy Breadth-First Traversals of Graphs in Haskell - December 18, 2018
- Implicit Corecursive Queues - May 14, 2019
- Deriving a Linear-Time Applicative Traversal of a Rose Tree - May 28, 2019
- Terminating Tricky Traversals - January 29, 2020
- Another Breadth-First Traversal - February 20, 2020
- A Queue for Effectful Breadth-First Traversals - November 23, 2020