Composition of functions with accumulating parameters

Authors:
Janis Voigtländer;Armin Kühnemann
Affiliations:
Department of Computer Science, Dresden University of Technology, D-01062 Dresden, Germany (e-mail: voigt@tcs.inf.tu-dresden.de);Department of Computer Science, Dresden University of Technology, D-01062 Dresden, Germany (e-mail: kuehne@tcs.inf.tu-dresden.de
Venue:
Journal of Functional Programming
Year:
2004

Citing 24
Cited 7

The concept of a supercompiler

ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
Composition and evaluation of attribute coupled grammars

Acta Informatica
Deforestation: transforming programs to eliminate trees

Proceedings of the Second European Symposium on Programming
Rewrite systems

Handbook of theoretical computer science (vol. B)
Functional programming with bananas, lenses, envelopes and barbed wire

Proceedings of the 5th ACM conference on Functional programming languages and computer architecture
A short cut to deforestation

FPCA '93 Proceedings of the conference on Functional programming languages and computer architecture
A fold for all seasons

FPCA '93 Proceedings of the conference on Functional programming languages and computer architecture
Deriving structural hylomorphisms from recursive definitions

Proceedings of the first ACM SIGPLAN international conference on Functional programming
Algebra of programming

Algebra of programming
Term rewriting and all that

Term rewriting and all that
Macro tree transducers, attribute grammars, and MSO definable tree translations

Information and Computation
A Transformation System for Developing Recursive Programs

Journal of the ACM (JACM)
Attribute coupled grammars

SIGPLAN '84 Proceedings of the 1984 SIGPLAN symposium on Compiler construction
Using circular programs to deforest in accumulating parameters

ASIA-PEPM '02 Proceedings of the ASIAN symposium on Partial evaluation and semantics-based program manipulation
Shortcut fusion for accumulating parameters & zip-like functions

Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
Declarative Program Transformation: A Deforestation Case-Study

PPDP '99 Proceedings of the International Conference PPDP'99 on Principles and Practice of Declarative Programming
Comparison of Deforestation Techniques for Functional Programs and for Tree Transducers

FLOPS '99 Proceedings of the 4th Fuji International Symposium on Functional and Logic Programming
Benefits of Tree Transducers for Optimizing Functional Programs

Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
On Deforesting Parameters of Accumulating Maps

LOPSTR '01 Selected papers from the 11th International Workshop on Logic Based Program Synthesis and Transformation
Conditions for Efficiency Improvement by Tree Transducer Composition

RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Extending Deforestation for First Order functional Programs

Proceedings of the 1991 Glasgow Workshop on Functional Programming
Homomorphisms and Promotability

Proceedings of the International Conference on Mathematics of Program Construction, 375th Anniversary of the Groningen University
Composition of functions with accumulating parameters

Journal of Functional Programming
Short cut fusion: proved and improved

SAIG'01 Proceedings of the 2nd international conference on Semantics, applications, and implementation of program generation

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

Mathematical Structures in Computer Science
Composition of functions with accumulating parameters

Journal of Functional Programming
Incomparability results for classes of polynomial tree series transformations

Journal of Automata, Languages and Combinatorics
Algebraic fusion of functions with an accumulating parameter and its improvement

Journal of Functional Programming
Polynomial-time inverse computation for accumulative functions with multiple data traversals

PEPM '12 Proceedings of the ACM SIGPLAN 2012 workshop on Partial evaluation and program manipulation
Attribute grammars as tree transducers over cyclic representations of infinite trees and their descriptional composition

Theoretical Computer Science
A shortcut fusion approach to accumulations

Science of Computer Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

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. To do so, given two macro tree transducers under appropriate restrictions, we construct a single macro tree transducer that implements the composition of the two original ones. The imposed restrictions are more liberal than those in the literature on macro tree transducer composition, thus generalising previous results.