From High Level Programming Model to FPGA Machines - Banâtre, Lavenier..(Correct)
terms of multiset rewrites. As an example, the transmuter, the reducer and the expander can be expressed
expander can be expressed in the following way: transmuter T (C f) x !f(x) C(x) reducer R(Cf) x
E(c f1 f2) x !f1(x)f2(x) C(x) The transmuter applies the same operation to all the elements ftp.inria.fr/INRIA/publication/publi-ps-gz/RR/RR-2240.ps.gz