typelevel-rewrite-rules-1.0: Solve type equalities using custom type-level rewrite rules
Safe HaskellNone
LanguageHaskell2010

TypeLevel.Rewrite.Internal.ApplyRules

Documentation

type Subst = Map TyVar (Term TypeNode TypeEq) Source #

applyRules :: Traversable t => TypeSubst -> [TypeRule] -> t TypeTerm -> Maybe (TypeRule, t TypeTerm) Source #

multiRewrite :: TypeSubst -> [TypeRule] -> TypeTerm -> Maybe (TypeRule, TypeTerm) Source #

singleRewrite :: TypeSubst -> TypeRule -> TypeTerm -> Maybe TypeTerm Source #

topLevelRewrite :: TypeSubst -> TypeRule -> TypeTerm -> Maybe TypeTerm Source #

traverseFirst :: Traversable t => (a -> Maybe a) -> t a -> Maybe (t a) Source #

annotatedTraverseFirst :: Traversable t => (a -> Maybe (annotation, a)) -> t a -> Maybe (annotation, t a) Source #

traverseAll :: Traversable t => (a -> Maybe a) -> t a -> [t a] Source #

annotatedTraverseAll :: Traversable t => (a -> Maybe (annotation, a)) -> t a -> [(annotation, t a)] Source #