Hostname: page-component-7b7567c8c-tnzcf Total loading time: 0 Render date: 2026-11-14T10:07:58.860Z Has data issue: false hasContentIssue false

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

Published online by Cambridge University Press:  17 March 2004

CLAUS JÜRGENSEN
Affiliation:
Faculty of Computer Science, Dresden University of Technology, Germany E-mail: Claus.Juergensen@Inf.TU-Dresden.DE
HEIKO VOGLER
Affiliation:
Faculty of Computer Science, Dresden University of Technology, Germany E-mail: Vogler@TCS.Inf.TU-Dresden.DE
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Paper
Copyright
2004 Cambridge University Press