Results 1 
3 of
3
Benchmarking implementations of functional languages with “pseudoknot” a floatintensive benchmark
 Sandra Loosemore, Niklas Röjemo, Manuel Serrano, JeanPierre Talpin, Jon Thackray, Stephen Thomas, Pum
, 1996
"... Over 25 implementations of di erent functional languages are benchmarked using the same program, a oatingpoint ..."
Abstract

Cited by 18 (9 self)
 Add to MetaCart
Over 25 implementations of di erent functional languages are benchmarked using the same program, a oatingpoint
Higherorder Matching for Program Transformation
, 1999
"... 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 tr ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
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. 1 Background and motivation 1.1 Program transformation Many program transformations are conveniently expressed as higher order rewrite rules. For example, consider the wellknown transformation that turns a tail recursive function into an imperative loop. The pattern f x = if p x then g x else f (h x ) is rewritten to the term f x = j[ var r ; r := x ; while :(p r) do r := h r ; r := g r ; return r ]j Carefully consider the pattern in this rule: it involves two bound variables, namely f and x , and ...
Within ARM's Reach: Compilation of LeftLinear Rewrite Systems via Minimal Rewrite Systems
, 1997
"... A new compilation technique for leftlinear term rewriting systems is presented, where rewrite rules are transformed into socalled minimal rewrite rules. These minimal rules have such a simple form that they can be viewed as instructions for an abstract rewriting machine (ARM). ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
A new compilation technique for leftlinear term rewriting systems is presented, where rewrite rules are transformed into socalled minimal rewrite rules. These minimal rules have such a simple form that they can be viewed as instructions for an abstract rewriting machine (ARM).