In: Olivier Danvy and Andrzej Filinski (editors), Programs as Data Objects, Lecture Notes in Computer Science 2053, pp. 218-237, 2001.

Authors: Ganesh Sittampalam and Oege de Moor
>

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”.

(PDF, PS)

BIBTEX:

@inproceedings{SittampalamM01,
  author    = {Ganesh Sittampalam and
               Oege de Moor},
  title     = {Higher-Order Pattern Matching for Automatically Applying
               Fusion Transformations},
  editor = "O. Danvy and A. Filinski",
  booktitle = {PADO},
  year      = {2001},
  pages     = {218-237},
  series = {Lecture Notes in Computer Science},
  volume = {2053}
}