Abstract A class of recursive functions with accumulating parameters can be modeled bymacro tree transducers. We present a program transformation technique that can be used to solve the efficiency problems due to creation and consumption of intermedi-ate data structures in compositions of such functions, where classical deforestation techniques fail. In order to do so, we construct for two given macro tree transducers, under appro-priate restrictions, a single macro tree transducer that implements the compositio
We present a methodology for the inductive synthesis of recursive functions based upon the theoretic...
Compositions of tree-walking tree transducers form a hierarchy with respect to the number of transdu...
Several induction theorem provers were developed to verify functional programs mechanically. Unfortu...
We study the problem to transform functional programs, which intensively use append functions (like ...
Abstract. We study the problem to transform functional programs, which intensively use append functi...
AbstractIn this paper we investigate the computational power of particular tree transducers, viz., m...
The macro tree transducer can be considered as a system of recursive function procedures with parame...
We study the question of efficiency improvement or deterioration for a semantic-preserving program t...
Abstract. The macro tree transducer can be considered as a system of recursive function procedures w...
Abstract. Deforestation is a well-known program transformation tech-nique which eliminates intermedi...
We present a technique to prevent the construction of intermediate data structures in functional pro...
AbstractA new tree transducer, called a modular tree transducer, is introduced. This device specifie...
In this thesis we see two new approaches to compose tree transducers and more general to fuse functi...
Projet OSCARSoftware engineering has to reconcile modularity with efficiency. One way to grapple wit...
Macro tree transducers are a combination of top-down tree transducers and macro grammars. They serve...
We present a methodology for the inductive synthesis of recursive functions based upon the theoretic...
Compositions of tree-walking tree transducers form a hierarchy with respect to the number of transdu...
Several induction theorem provers were developed to verify functional programs mechanically. Unfortu...
We study the problem to transform functional programs, which intensively use append functions (like ...
Abstract. We study the problem to transform functional programs, which intensively use append functi...
AbstractIn this paper we investigate the computational power of particular tree transducers, viz., m...
The macro tree transducer can be considered as a system of recursive function procedures with parame...
We study the question of efficiency improvement or deterioration for a semantic-preserving program t...
Abstract. The macro tree transducer can be considered as a system of recursive function procedures w...
Abstract. Deforestation is a well-known program transformation tech-nique which eliminates intermedi...
We present a technique to prevent the construction of intermediate data structures in functional pro...
AbstractA new tree transducer, called a modular tree transducer, is introduced. This device specifie...
In this thesis we see two new approaches to compose tree transducers and more general to fuse functi...
Projet OSCARSoftware engineering has to reconcile modularity with efficiency. One way to grapple wit...
Macro tree transducers are a combination of top-down tree transducers and macro grammars. They serve...
We present a methodology for the inductive synthesis of recursive functions based upon the theoretic...
Compositions of tree-walking tree transducers form a hierarchy with respect to the number of transdu...
Several induction theorem provers were developed to verify functional programs mechanically. Unfortu...