Learn More
In this appendix to the article " Composition of functions with accumulating parameters " we prove Theorem 5.2 of that paper, showing that Construction 5.1 produces an mtt that is equivalent to the composition of the two given ones. Firstly, we will formalise the idea of " walking upwards " in the intermediate result to obtain the context parameters of(More)
Many functional programs with accumulating parameters are contained in the class of macro tree transducers. We present a program transformation technique 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. In order(More)
We compare transformations for the elimination of intermediate results in rst-order functional programs. We choose the well known deforestation technique of Wadler and composition techniques from the theory of tree transducers, of which the implementation of functional programs yet does not take advantage. We identify syntactic classes of function(More)
The concept of attributed tree transducer is a formal model for studying properties of attribute grammars. In this paper, for output languages of noncircular, producing, and visiting attributed tree transducers, we i n troduce and prove a pumping lemma. We apply this pumping lemma to gain two results: (1) there is no noncircular, producing, and visiting(More)
We study the problem to transform functional programs, which intensively use append functions (like inefficient list reversal), into programs, which use accumulating parameters instead (like efficient list reversal). We give an (automatic) transformation algorithm for our problem and identify a class of functional programs, namely restricted 2-modular tree(More)