Deforestation: transforming programs to eliminate trees
Proceedings of the Second European Symposium on Programming
Attribute grammar paradigms—a high-level methodology in language implementation
ACM Computing Surveys (CSUR)
Implicit parameters: dynamic scoping with static types
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Generic downwards accumulations
Science of Computer Programming - Special issue on mathematics of program construction
Syntax-Directed Semantics: Formal Models Based on Tree Transducers
Syntax-Directed Semantics: Formal Models Based on Tree Transducers
Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire
Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture
Benefits of Tree Transducers for Optimizing Functional Programs
Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
Upwards and Downwards Accumulations on Trees
Proceedings of the Second International Conference on Mathematics of Program Construction
Polytypic Downwards Accumulations
MPC '98 Proceedings of the Mathematics of Program Construction
Strongly typed heterogeneous collections
Haskell '04 Proceedings of the 2004 ACM SIGPLAN workshop on Haskell
Scrap your boilerplate with class: extensible generic functions
Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
Uniform boilerplate and list processing
Haskell '07 Proceedings of the ACM SIGPLAN workshop on Haskell workshop
Formal Efficiency Analysis for Tree Transducer Composition
Theory of Computing Systems
Journal of Functional Programming
Generic programming with fixed points for mutually recursive datatypes
Proceedings of the 14th ACM SIGPLAN international conference on Functional programming
Attribute grammars fly first-class: how to do aspect oriented programming in Haskell
Proceedings of the 14th ACM SIGPLAN international conference on Functional programming
Proceedings of the seventh ACM SIGPLAN workshop on Generic programming
“Scrap your boilerplate” reloaded
FLOPS'06 Proceedings of the 8th international conference on Functional and Logic Programming
“Scrap your boilerplate” revolutions
MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction
Towards modular compilers for effects
TFP'11 Proceedings of the 12th international conference on Trends in Functional Programming
Categorical views on computations on trees
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Programming macro tree transducers
Proceedings of the 9th ACM SIGPLAN workshop on Generic programming
| Hi-index | 0.00 |
Tree automata are traditionally used to study properties of tree languages and tree transformations. In this paper, we consider tree automata as the basis for modular and extensible recursion schemes. We show, using well-known techniques, how to derive from standard tree automata highly modular recursion schemes. Functions that are defined in terms of these recursion schemes can be combined, reused and transformed in many ways. This flexibility facilitates the specification of complex transformations in a concise manner, which is illustrated with a number of examples.