Higher-order matching for program transformation

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

Full description

Saved in:
Bibliographic Details
Published inTheoretical computer science Vol. 269; no. 1; pp. 135 - 162
Main Authors de Moor, Oege, Sittampalam, Ganesh
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 28.10.2001
Elsevier
Subjects
Algebra
Algorithmics. Computability. Computer arithmetics
Applied sciences
Associative rings and algebras
Category theory, homological algebra
Computer science; control theory; systems
Exact sciences and technology
Language theory and syntactical analysis
Mathematics
Sciences and techniques of general use
Theoretical computing
Redundancy
Rewriting
Program transformation
Beta reduction
Specification
Algorithm
N order
Huet algorithm
Substitution
Expression
Viability
Comparative study
Rewriting rule
Adaptation
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0304-3975
1879-2294
DOI:10.1016/S0304-3975(00)00402-3