Tree automata are traditionally used to study properties of tree languages and tree transformations. In this paper, we consider tree automata as the basis for modular and extensible recursion schemes. We show, using well-known techniques, how to derive from standard tree automata highly modular recursion schemes. Functions that are defined in terms of these recursion schemes can be combined, reused and transformed in many ways. This flexibility facilitates the specification of complex transformations in a concise manner, which is illustrated with a number of examples.
|Title of host publication
|Mathematics of Program Construction
|Jeremy Gibbons, Pablo Nogueira
|Number of pages
|Springer Berlin Heidelberg
|1 Jun 2012
|Published - 1 Jun 2012