Theoretical Computer Science Volume 269, Issues 1-2 , 28 October 2001, Pages 135-162

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.

(PDF, PS)

BIBTEX:

           @article{tcs01moor, 
           author = "Oege de Moor and
                         Ganesh Sittampalam", 
           title = "Higher-order matching for program transformation", 
           journal = "Theoretical computer science",
           volume = "269",
           number = "1-2",
           pages = "135--162",
           year = "2001"}