Higher-order matching for program transformation
In: Aart Middeldorp and Taisuke Sato (editors), Fuji International Symposium on Functional and Logic Programming (FLOPS), Lecture Notes in Computer Science 1722, pp. 209-224, 1999.
Authors: Oege de Moor and Ganesh Sittampalam
>
Abstract
We present a simple, practical algorithm for higher-order matching in the context of automatic program transformation. Our algorithm finds more matches than the standard second-order matching algorithm of Huet and Lang, but it has an equally simple specification, and it is better suited to the transformation of programs in modern programming languages such as Haskell or ML. The algorithm has been implemented as part of the MAG system for transforming functional programs.
(PS)
BIBTEX:
@inproceedings{MoorS99,
author = {Oege de Moor and
Ganesh Sittampalam},
title = {Higher Order Matching for Program Transformation.},
booktitle = {Fuji International Symposium on Functional and Logic Programming},
year = {1999},
pages = {209-224},
series = {Lecture Notes in Computer Science},
editor = {Aart Middeldorp and Taisuke Sato},
volume = {1722}}
}