Library to support lightweight generic traversals through treestructured data. See here for a description of the library.
Author: Sebastian Fischer
Version: December 2020
noChildren
:: a > ([b],[b] > a)
Traversal function for constructors without children. 
children
:: (a > ([b],[b] > a)) > a > [b]
Yields the children of a value. 
replaceChildren
:: (a > ([b],[b] > a)) > a > [b] > a
Replaces the children of a value. 
mapChildren
:: (a > ([b],[b] > a)) > (b > b) > a > a
Applies the given function to each child of a value. 
family
:: (a > ([a],[a] > a)) > a > [a]
Computes a list of the given value, its children, those children, etc. 
childFamilies
:: (a > ([b],[b] > a)) > (b > ([b],[b] > b)) > a > [b]
Computes a list of family members of the children of a value. 
mapFamily
:: (a > ([a],[a] > a)) > (a > a) > a > a
Applies the given function to each member of the family of a value. 
mapChildFamilies
:: (a > ([b],[b] > a)) > (b > ([b],[b] > b)) > (b > b) > a > a
Applies the given function to each member of the families of the children of a value. 
evalFamily
:: (a > ([a],[a] > a)) > (a > Maybe a) > a > a
Applies the given function to each member of the family of a value as long as possible. 
evalChildFamilies
:: (a > ([b],[b] > a)) > (b > ([b],[b] > b)) > (b > Maybe b) > a > a
Applies the given function to each member of the families of the children of a value as long as possible. 
fold
:: (a > ([a],[a] > a)) > (a > [b] > b) > a > b
Implements a traversal similar to a fold with possible default cases. 
foldChildren
:: (a > ([b],[b] > a)) > (b > ([b],[b] > b)) > (a > [c] > d) > (b > [c] > c) > a > d
Fold the children and combine the results. 
replaceChildrenM
:: Monad a => (b > ([c],[c] > b)) > b > a [c] > a b
Monadic version of replaceChildren 
mapChildrenM
:: Monad a => (b > ([c],[c] > b)) > (c > a c) > b > a b
Monadic version of mapChildren 
mapFamilyM
:: Monad a => (b > ([b],[b] > b)) > (b > a b) > b > a b
Monadic version of mapFamily 
mapChildFamiliesM
:: Monad a => (b > ([c],[c] > b)) > (c > ([c],[c] > c)) > (c > a c) > b > a b
Monadic version of mapChildFamilies 
evalFamilyM
:: Monad a => (b > ([b],[b] > b)) > (b > a (Maybe b)) > b > a b
Monadic version of evalFamily 
evalChildFamiliesM
:: Monad a => (b > ([c],[c] > b)) > (c > ([c],[c] > c)) > (c > a (Maybe c)) > b > a b
Monadic version of evalChildFamilies 
A datatype is Traversable
if it defines a function
that can decompose a value into a list of children of the same type
and recombine new children to a new value of the original type.
Type synonym: Traversable a b = a > ([b],[b] > a)
Traversal function for constructors without children.

Yields the children of a value. 
Replaces the children of a value. 
Applies the given function to each child of a value. 
Computes a list of the given value, its children, those children, etc. 
Computes a list of family members of the children of a value. The value and its children can have different types. 
Applies the given function to each member of the family of a value. Proceeds bottomup. 
Applies the given function to each member of the families of the children of a value. The value and its children can have different types. Proceeds bottomup. 
Applies the given function to each member of the family of a value
as long as possible. On each member of the family of the result the given
function will yield 
Applies the given function to each member of the families of the children
of a value as long as possible.
Similar to 
Implements a traversal similar to a fold with possible default cases. 
Fold the children and combine the results. 
Monadic version of replaceChildren 
Monadic version of mapChildren 
Monadic version of mapFamily 
Monadic version of mapChildFamilies 
Monadic version of evalFamily 
Monadic version of evalChildFamilies 