AbstractWe 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
In current implementations of higher-order logics higher-orderunification is used to lift the resolu...
SIGLEAvailable from British Library Document Supply Centre- DSC:8053.4153(RAL--90-067) / BLDSC - Bri...
We present a generic Haskell library for expressing rewrite rules with a safe treatment of variables...
We present a simple, practical algorithm for higher-order matching in the context of automatic progr...
AbstractWe present a simple, practical algorithm for higher-order matching in the context of automat...
AbstractThis paper shows how the Improvement Theorem — a semantic condition for establishing the tot...
Abstract. Matching is a basic operation extensively used in computation. Second-order matching, in p...
© 2019, Springer Nature Switzerland AG. Program transformation is a process in which an input progra...
This paper derives a hierarchy of algorithms for pattern matching on arrays in the Bird-Meertens cal...
Abstract: Motivated by the promotion of rewriting techniques and their use in major industrial appli...
In this paper we present a new compilation method based on program transformation. The principle is ...
Functional programs often define functions by pattern matching where patterns may inadvertedly overl...
In this paper we describe a higher-order associative commutative pattern matching algorithm. We are ...
Program specialization is a program transformation methodology which improves program efficiency by ...
We introduce rewriting of meta-expressions which stem from a meta-language that uses higher-order ab...
In current implementations of higher-order logics higher-orderunification is used to lift the resolu...
SIGLEAvailable from British Library Document Supply Centre- DSC:8053.4153(RAL--90-067) / BLDSC - Bri...
We present a generic Haskell library for expressing rewrite rules with a safe treatment of variables...
We present a simple, practical algorithm for higher-order matching in the context of automatic progr...
AbstractWe present a simple, practical algorithm for higher-order matching in the context of automat...
AbstractThis paper shows how the Improvement Theorem — a semantic condition for establishing the tot...
Abstract. Matching is a basic operation extensively used in computation. Second-order matching, in p...
© 2019, Springer Nature Switzerland AG. Program transformation is a process in which an input progra...
This paper derives a hierarchy of algorithms for pattern matching on arrays in the Bird-Meertens cal...
Abstract: Motivated by the promotion of rewriting techniques and their use in major industrial appli...
In this paper we present a new compilation method based on program transformation. The principle is ...
Functional programs often define functions by pattern matching where patterns may inadvertedly overl...
In this paper we describe a higher-order associative commutative pattern matching algorithm. We are ...
Program specialization is a program transformation methodology which improves program efficiency by ...
We introduce rewriting of meta-expressions which stem from a meta-language that uses higher-order ab...
In current implementations of higher-order logics higher-orderunification is used to lift the resolu...
SIGLEAvailable from British Library Document Supply Centre- DSC:8053.4153(RAL--90-067) / BLDSC - Bri...
We present a generic Haskell library for expressing rewrite rules with a safe treatment of variables...
DOI
Add to ORKG