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

  title={Syntactic composition of top-down tree transducers is short cut fusion},
  author={Claus J{\"u}rgensen and Heiko Vogler},
  journal={Mathematical Structures in Computer Science},
  pages={215 - 282}
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… 
Using monads to fuse recursive programs
We try to combine the ‘syntactic composition of tree transducers’ [FV98, KV01] on the one hand side and ‘short cut fusion’ [GLP93] on the other hand side. Short cut fusion is based on the
Programming macro tree transducers
This paper shows how macro tree transducers can be concisely represented in Haskell, and demonstrates the benefits of utilising such an approach with a number of examples.
Postcondition-preserving fusion of postorder tree transformations
This work uses postconditions to define a more useful formal notion of successful fusion, namely postcondition-preserving fusion, and presents criteria that are sufficient to ensure post condition-preservation and facilitate modular reasoning about the success of fusion.
Composition of functions with accumulating parameters
A program transformation technique is presented that can be used to solve the efficiency problems due to creation and consumption of intermediate data structures in compositions of such functions, where classical deforestation techniques fail.
An Abstract Monadic Semantics for Value Recursion
This paper proposes an operational semantics for value recursion in the context of monadic metalanguages and defines a different semantics for the continuation monad, adding to the evidence that this axiom is problematic in the presence of continuations.
Explicit Binds: Effortless Efficiency with and without Trees
We demonstrate a simple and robust program transformation technique that can improve asymptotic time complexity of data-manipulating programs (e.g., produce a linear-time list reversal function from
Yet Another Implementation of Attribute Evaluation
The algorithm consists in computing attributes by reductions to normal forms using a transducer operating on tree encodings of a cyclic representation of zippers of attribute grammars as zipper transformers.


Composition of Top-Down and Bottom-Up Tree Transductions
  • B. Baker
  • Computer Science
    Inf. Control.
  • 1979
Short Cut Fusion: Proved and Improved
This paper uses Pitts' recent demonstration that contextual equivalence in such languages is relationally parametric to prove that programs in them which have undergone short cut fusion are contextually equivalent to their unfused counterparts.
Characterization of High Level Tree Transducers
It is shown in this paper that "high" level tree transducers can perform the composition closure of the class of t ranslat ions of tree-valued a t t r ibu te grammars [Kn] and characterized the n-level S transducers for an arb i t ra ry storage type, which allows us to prove the results level by leve l.
Tree Transducers with External Functions
Tree transducers with external
The main result of this paper is the characterization of macro tree transducers with external function calls in terms of attributed tree transProducers with external functions during the usual rewriting process.
Modular Tree Transducers
Bottom-up and top-down tree transformations— a comparison
A new tree transformation model is introduced which generalizes both the top-down and the bottom-up tree transducer, and is used to give simple proofs of composition results concerning bottom- up tree transformations.
Symbolic Composition
Symbolic composition, completely dedicated to the declarative and descriptional features of attribute grammars is intrinsically more powerful than categorical-avored transformations, whose recursion schemes are set by functors.
The Universality of Higher-Order Attributed Tree Transducers
It is proved the universality of this formalism by showing that the class of functions described by higher-order attributed tree transducers coincides with theclass of (partial) recursive tree functions.
Macro Tree Transducers