On the universality of higher-order attributed tree transducers

In this paper we present higher-order attributed tree transducers as a formal computational model for higher-order attribute grammars. The latter is a generalization of the classical concept of attribute grammars in the sense that during attribute evaluation, the input tree can be enlarged by inserting subtrees which were computed during attribute evaluation. We prove the universality of this formalism by showing that the class of functions described by higher-order attributed tree transducers coincides with the class of (partial) recursive tree functions. (orig.)SIGLEAvailable from TIB Hannover: RR 7739(99-05) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekDEGerman