Syntactic composition of top-down tree transducers is short cut fusion

被引:2
作者
Jürgensen, C [1 ]
Vogler, H [1 ]
机构
[1] Tech Univ Dresden, Fac Comp Sci, D-8027 Dresden, Germany
关键词
D O I
10.1017/S0960129503004109
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We compare two deforestation techniques: short cut fusion formalised in category theory and the syntactic composition of tree transducers. The former strongly depends on types and uses the parametricity property or free theorem, whereas the latter makes no use of types at all and allows more general compositions. We introduce the notion of a categorical transducer, which is a generalisation of a catamorphism, and show a corresponding fusion result, which is a generalisation of the 'acid rain theorem'. We prove the following main theorems: (i) The class of all categorical transducers builds a category where composition is fusion; (ii) The semantics of categorical transducers is a functor. (iii) The subclass of top-down categorical transducers is a subcategory. (iv) Syntactic composition of top-down tree transducers is equivalent to the fusion of top-down categorical transducers.
引用
收藏
页码:215 / 282
页数:68
相关论文
共 56 条
[1]  
Adamek J., 1990, ABSTRACT CONCRETE CA
[2]   COMPOSITION OF TOP-DOWN AND BOTTOM-UP TREE TRANSDUCTIONS [J].
BAKER, BS .
INFORMATION AND CONTROL, 1979, 41 (02) :186-213
[3]  
Bird R., 1997, Algebra of Programming
[4]  
BOURCEUX F, 1994, HDB CATEGORICAL ALGR, V50
[5]  
BUDACH L, 1975, AUTOMATEN FUNKTOREN, V35
[6]  
CORRENSON L, 1997, 3348 INRIA
[7]  
CORRENSON L, 1997, 4 INT STAT ANAL S
[8]   ATTRIBUTE GRAMMARS AND RECURSIVE PROGRAM SCHEMES I [J].
COURCELLE, B ;
FRANCHIZANNETTACCI, P .
THEORETICAL COMPUTER SCIENCE, 1982, 17 (02) :163-191
[9]   FUNDAMENTAL-STUDIES - THE IO-HIERARCHIES AND OI-HIERARCHIES [J].
DAMM, W .
THEORETICAL COMPUTER SCIENCE, 1982, 20 (02) :95-207
[10]  
DEBRUIN PJ, 1989, CS8916