Awesome

Tree automata on Compositional Data Types

This library extends the compdata package with advanced recursion schemes derived from tree automata. These recursion schemes allow for a higher degree of modularity and make it possible to apply fusion. See Modular Tree Automata (Mathematics of Program Construction, 263-299, 2012) and Programming Macro Tree Transducers (Workshop on Generic Programming, 61-72, 2013).