Description

The Traversal Library is a collection of algorithms and function object combinators for building generic functions that operate over hierarchical data structures. The library can automatically generate a rich variety of different traversal schemes for these data structures, allowing developers to concentrate on the core parts of the algorithm they are implementing, without getting bogged down in the large amounts of repetitive code typically required to manipulate such structures.

Influences and Related Work

The approach is modelled upon techniques developed in the Haskell community, amongst them, the Scrap Your Boilerplate approach described by Lammel and Peyton-Jones, Strafunski described by Lammel and Visser, and the data structure driven behaviour of Generic Haskell. Many of the naming conventions and the choice of traversal strategies is heavily influence by the work in A generic recursion toolbox for Haskell or: scrap your boilerplate systematically by Ren and Erwig.