Takayuki Muranushi

Commutative Operations

1

You can set input edges for commutative arithmetic operators as unordered from later on. thus increasing the opportunity of common subexpression elimination.

Vectors are made typeable now. instance (Typeable a, Typeable (n a)) => Typeable (n :~ a) where typeOf (vx :~ x) = mkTyConApp (mkTyCon "Language.Paraiso.Tensor.:~") [typeOf vx, typeOf x] Tensor...

this is almost be a MUST for testing optimizations!

Strategy is a kind of annotation they will be separate objects We have freedom to add new Strategies Generator has the freedom to choose strategy

Dead codes are automatically removed thanks to lazy evaluation. However, manually removing them will shrink the size of the dataflow graph and ease the other optimizations as well as code...

this Riemann solver is necessary in implementing MHD solver

implement shifts with rational numbers. Arithmetic operations are allowed only between orthotopes with integer relative shift.

These kind of repeated terms may be eliminated anyway by common subexpression eliminator, but is ugly, so let us unify them manually. ``` cpp const int a5_0_0 = a1[((((i) %...

At the moment, a Context is created to update a single array, thus in one context only one array is written to. But in fact, multiple writes are possible as...