Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Synopsis
- recSplit ∷ ∀ uni fun a name tyname. (HasUnique tyname TypeUnique, HasUnique name TermUnique) ⇒ Term tyname name uni fun a → Term tyname name uni fun a
- recSplitPass ∷ (Typecheckable uni fun, GEq uni, Applicative m) ⇒ PirTCConfig uni fun → Pass m TyName Name uni fun a
Documentation
recSplit ∷ ∀ uni fun a name tyname. (HasUnique tyname TypeUnique, HasUnique name TermUnique) ⇒ Term tyname name uni fun a → Term tyname name uni fun a Source #
Apply letrec splitting, recursively in bottom-up fashion.
recSplitPass ∷ (Typecheckable uni fun, GEq uni, Applicative m) ⇒ PirTCConfig uni fun → Pass m TyName Name uni fun a Source #