Macro tree transducers

Aho, 1969, Nested stack automata, J. Assoc. Comput. Mach., 16, 383, 10.1145/321526.321529 Aho, 1971, Translations on a context-free grammar, Inform. and Control, 19, 439, 10.1016/S0019-9958(71)90706-6 Aho, 1973, Vols I, II Baker, 1979, Composition of top-down and bottom-up tree transductions, Inform. and Control, 41, 186, 10.1016/S0019-9958(79)90561-8 Baker, 1978, Generalized syntax directed translation, tree transducers, and linear space, SIAM J. Comput., 7, 376, 10.1137/0207030 Chirica, 1979, An order-algebraic definition of Knuthian semantics, Math. Systems Theory, 13, 1, 10.1007/BF01744285 Courcelle, 1981, Attribute grammars: Theory and applications, Vol. 107, 75 Courcelle, 1982, Attribute grammars and recursive program schemes I, II, Theoret. Comput. Sci., 17, 163, 10.1016/0304-3975(82)90003-2 Courcelle, 1982, Attribute grammars and recursive program schemes I, II, Theoret. Comput. Sci., 17, 235, 10.1016/0304-3975(82)90024-X Damm, 1982, The IO- and OI-hierarchies, Theoret. Comput. Sci., 20, 95, 10.1016/0304-3975(82)90009-3 W. Damm and J. Engelfriet, Higher level tree transducers, in preparation. Downey, 1974, Formal languages and recursion schemes Engelfriet, 1975, Bottom-up and top-down tree transformations — A comparison, Math. Systems Theory, 9, 198, 10.1007/BF01704020 Engelfriet, 1975, Tree Automata and Tree Grammars Engelfriet, 1977, Top-down tree transducers with regular look-ahead, Math. Systems Theory, 10, 289, 10.1007/BF01683280 Engelfriet, 1980, Some open questions and recent results on tree transducers and tree languages Engelfriet, 1981, Tree Transducers and Syntax-Directed Semantics Engelfriet, 1982, Three hierarchies of transducers, Math. Systems Theory, 15, 95, 10.1007/BF01786975 Engelfriet, 1981, The formal power of one visit attribute grammars, Acta Inform., 16, 275, 10.1007/BF00289307 Engelfriet, 1980, Tree transducers L-systems, and two-way machines, J. Comput. System Sci., 20, 150, 10.1016/0022-0000(80)90058-6 Engelfriet, 1977, IO and OI, J. Comput. System Sci., 15, 328, 10.1016/S0022-0000(77)80034-2 Engelfriet, 1978, IO and OI, J. Comput. System Sci., 16, 67, 10.1016/0022-0000(78)90051-X Engelfriet, 1982, The copying power of one-state tree transducers, J. Comput. System Sci., 25, 418, 10.1016/0022-0000(82)90019-8 G. Filè, personal communication, 1982. Fischer, 1968, Grammars with Macro like Productions, 10.1109/SWAT.1968.12 Fischer, 1968, 131 Franchi-Zannettacci, 1982, Attributs semantiques et schemes de programmes Ginsburg, 1966, A characterization of machine mappings, Canad. J. Math., 18, 381, 10.4153/CJM-1966-040-3 Gordon, 1979 Goguen, 1977, Initial algebra semantics and continuous algebras, J. Assoc. Comput. Mach., 24, 68, 10.1145/321992.321997 Irons, 1961, A syntax directed compiler for ALGOL 60, Comm. ACM, 4, 51, 10.1145/366062.366083 Knuth, 1968, Semantics of context-free languages, Math. Systems Theory, 2, 127, 10.1007/BF01692511 Knuth, 1971, Correction, Math. Systems Theory, 5, 95, 10.1007/BF01702865 Maibaum, 1974, A generalized approach to formal languages, J. Comput. System Sci., 8, 409, 10.1016/S0022-0000(74)80031-0 Mezei, 1967, Algebraic automata and context-free sets, Inform. and Control, 11, 3, 10.1016/S0019-9958(67)90353-1 Nivat, 1975, On the interpretation of recursive program schemes, 15, 255 Rayward-Smith, 1977, Hypergrammars: An extension to macro grammars, J. Comput. System Sci., 14, 130, 10.1016/S0022-0000(77)80043-3 Rounds, 1970, Mappings and grammars on trees, Math. Systems Theory, 4, 257, 10.1007/BF01695769 Rounds, 1970, Tree-oriented proofs of some theorems on context-free and indexed languages Thatcher, 1970, Generalized2 sequential machine maps, J. Comput. System Sci., 4, 339, 10.1016/S0022-0000(70)80017-4 Thatcher, 1973, Tree automata: An informal survey, 143 Thatcher, 1968, Generalized finite automata theory with an application to a decision problem of second-order logic, Math. Systems Theory, 2, 57, 10.1007/BF01691346 Engelfriet, 1979, Bounded nesting in macro grammars, Inform. and Control, 42, 157, 10.1016/S0019-9958(79)90635-1