Fusion with stacks and accumulating parameters

Authors:
Susumu Nishimura
Affiliations:
Kyoto University, Kyoto, Japan
Venue:
Proceedings of the 2004 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Year:
2004

Citing 18
Cited 6

Deforestation: transforming programs to eliminate trees

Proceedings of the Second European Symposium on Programming
Theorems for free!

FPCA '89 Proceedings of the fourth international 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
Composing tree attributions

POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Shortcut deforestation in calculational form

FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
Warm fusion: deriving build-catas from recursive definitions

FPCA '95 Proceedings of the seventh international 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
Typer inference builds a short cut to deforestation

Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
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
Introduction to Automata Theory, Languages and Computability

Introduction to Automata Theory, Languages and Computability
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
Optimising Recursive Functions Yielding Multiple Results in Tuples in a Lazy Functional Language

IFL '99 Selected Papers from the 11th International Workshop on Implementation of Functional Languages
Parametric polymorphism and operational equivalence

Mathematical Structures in Computer Science
Short cut fusion is correct

Journal of Functional Programming
Using Circular Programs to Deforest in Accumulating Parameters

Higher-Order and Symbolic Computation

XML stream transformer generation through program composition and dependency analysis

Science of Computer Programming
Algebraic fusion of functions with an accumulating parameter and its improvement

Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming
Algebraic fusion of functions with an accumulating parameter and its improvement

Journal of Functional Programming
Swapping arguments and results of recursive functions

MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction
A pushdown machine for recursive XML processing

APLAS'06 Proceedings of the 4th Asian conference on Programming Languages and Systems
A shortcut fusion approach to accumulations

Science of Computer Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a new algorithm for fusion transformation that allows both stacks and accumulating parameters. The new algorithm can fuse programs that cannot be handled by existing fusion techniques, eg, XML transformations. The algorithm is formulated in a modular, type-directed style where the transformation process is comprised of several transformation steps that change types but preserve the observational behavior of programs. We identify a class of functions to which our new fusion method successfully applies and show that a closure property holds for that class.