Data movement optimisation in point-free form

Authors:
Brad Alexander;Andrew Wendelborn
Affiliations:
School of Computer Science, University of Adelaide, Adelaide, SA, Australia;School of Computer Science, University of Adelaide, Adelaide, SA, Australia
Venue:
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
Year:
2006

Citing 9
Cited 1

Centaur: the system

SDE 3 Proceedings of the third ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments
An equational language for data-parallelism

PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
A data-parallel FP compiler

Journal of Parallel and Distributed Computing
Total correctness by local improvement in the transformation of functional programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
A calculational fusion system HYLO

Proceedings of the IFIP TC 2 WG 2.1 international workshop on Algorithmic languages and calculi
Implementing functional languages in the Categorical Abstract Machine

LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs

Communications of the ACM
Grammers as Contracts

GCSE '00 Proceedings of the Second International Symposium on Generative and Component-Based Software Engineering-Revised Papers
Stratego: A Language for Program Transformation Based on Rewriting Strategies

RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications

Constructing an optimisation phase using grammatical evolution

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Programs written in point-free form express computation purely in terms of functions. Such programs are especially amenable to local transformation. In this paper, we describe a process for optimising the transport of data through point-free programs. This process systematically applies local transformations to achieve effective global optimisation. We describe the strategies we employ to ensure this process is tractable. This process has been implemented as an intermediate stage of a compiler. The optimiser is shown to be highly effective, producing code of comparable efficiency to hand-written code.