Higher-Order Pattern Matching for Automatically Applying Fusion Transformations

Authors:
Ganesh Sittampalam;Oege de Moor
Affiliations:
-;-
Venue:
PADO '01 Proceedings of the Second Symposium on Programs as Data Objects
Year:
2001

Citing 12
Cited 0

The promotion and accumulation strategies in transformational programming

ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
The alpha-beta algorithm: an exercise in program transformation

Information Processing Letters
Higher-order abstract syntax

PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
KIDS: A Semiautomatic Program Development System

IEEE Transactions on Software Engineering
The clausal theory of types

The clausal theory of types
A short cut to deforestation

FPCA '93 Proceedings of the conference on Functional programming languages and computer architecture
A calculational fusion system HYLO

Proceedings of the IFIP TC 2 WG 2.1 international workshop on Algorithmic languages and calculi
A transformation-based optimiser for Haskell

Science of Computer Programming - Special issue on the 6th European symposium on programming
Introduction to Functional Programming

Introduction to Functional Programming
Towards Correct, Efficient and Reusable Transformational Developments

KORSO - Methods, Languages, and Tools for the Construction of Correct Software
Higher-Order Matching and Tree Automata

CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
Type-Inference Based Short Cut Deforestation (Nearly) without Inlining

IFL '99 Selected Papers from the 11th International Workshop on Implementation of Functional Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give an algorithm for higher-order pattern matching in the context of automatic program transformation. In particular, we show how accumulating parameter optimisations of functional programs can be automatically derived with the aid of programmer annotations. These techniques have been successfully applied to some complex manual derivations in the literature, such as Bird's "longest path-sequence".