CLaSH.Normalize.Transformations

Transformations of the Normalization process

Documentation

appProp :: NormRewrite

Propagate arguments of application inwards; except for Lam where the argument becomes let-bound.

bindNonRep :: NormRewrite

Inline non-recursive, non-representable let-bindings

liftNonRep :: NormRewrite

Lift recursive, non-representable let-bindings

caseLet :: NormRewrite

Lift the let-bindings out of the subject of a Case-decomposition

caseCon :: NormRewrite

Specialize a Case-decomposition (replace by the RHS of an alternative) if the subject is (an application of) a DataCon; or if there is only a single alternative that doesn't reference variables bound by the pattern.

caseCase :: NormRewrite

Move a Case-decomposition from the subject of a Case-decomposition to the alternatives

inlineNonRep :: NormRewrite

Inline function with a non-representable result if it's the subject of a Case-decomposition

typeSpec :: NormRewrite

Specialize functions on their type

nonRepSpec :: NormRewrite

Specialize functions on their non-representable argument

etaExpansionTL :: NormRewrite

Eta-expand top-level lambda's (DON'T use in a traversal!)

inlineClosedTerm :: String -> NormRewrite -> NormRewrite

Inline nullary/closed functions

nonRepANF :: NormRewrite

Bring an application of a DataCon or Primitive in ANF, when the argument is is considered non-representable

bindConstantVar :: NormRewrite

Inline let-bindings when the RHS is either a local variable reference or is constant

constantSpec :: NormRewrite

Specialise functions on arguments which are constant

makeANF :: NormRewrite

Turn an expression into a modified ANF-form. As opposed to standard ANF, constants do not become let-bound.

deadCode :: NormRewrite

Remove unused let-bindings

topLet :: NormRewrite

Ensure that top-level lambda's eventually bind a let-expression of which the body is a variable-reference.

inlineWrapper :: NormRewrite

Inline functions which simply "wrap" another function

recToLetRec :: NormRewrite

Turn a normalized recursive function, where the recursive calls only pass along the unchanged original arguments, into let-recursive function. This means that all recursive calls are replaced by the same variable reference as found in the body of the top-level let-expression.