Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
A trivial simplification that merges adjacent non-recursive let terms.
Synopsis
- letMerge ∷ Term tyname name uni fun a → Term tyname name uni fun a
- letMergePass ∷ (Typecheckable uni fun, GEq uni, Applicative m) ⇒ PirTCConfig uni fun → Pass m TyName Name uni fun a
Documentation
letMerge ∷ Term tyname name uni fun a → Term tyname name uni fun a Source #
Recursively apply let merging cancellation.
letMergePass ∷ (Typecheckable uni fun, GEq uni, Applicative m) ⇒ PirTCConfig uni fun → Pass m TyName Name uni fun a Source #