Modular Tree Automata

Publikation: Konference artikel i Proceeding eller bog/rapport kapitelBidrag til bog/antologiForskningpeer review

Abstrakt

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.
OriginalsprogUdefineret/Ukendt
TitelMathematics of Program Construction
RedaktørerJeremy Gibbons, Pablo Nogueira
Antal sider37
Vol/bind7342
ForlagSpringer Berlin Heidelberg
Publikationsdato1 jun. 2012
Sider263-299
ISBN (Trykt)978-3-642-31112-3
DOI
StatusUdgivet - 1 jun. 2012

Citationsformater