Hydra.Rewriting

Documentation

expandLambdas :: Ord m => Term m -> GraphFlow m (Term m)

Turn arbitrary terms like 'compareTo 42' into terms like 'x.compareTo 42 x', whose arity (in the absences of application terms) is equal to the depth of nested lambdas. This function leaves application terms intact, simply rewriting their left and right subterms.

foldOverTerm :: TraversalOrder -> (a -> Term m -> a) -> a -> Term m -> a

foldOverType :: TraversalOrder -> (a -> Type m -> a) -> a -> Type m -> a

freeVariablesInScheme :: Show m => TypeScheme m -> Set VariableType

freeVariablesInTerm :: Term m -> Set Variable

freeVariablesInType :: Type m -> Set VariableType

moduleDependencyNamespaces :: Bool -> Bool -> Bool -> Module m -> Set Namespace

isFreeIn :: Variable -> Term m -> Bool

removeTermAnnotations :: Ord m => Term m -> Term m

Recursively remove term annotations, including within subterms

removeTypeAnnotations :: Ord m => Type m -> Type m

Recursively remove type annotations, including within subtypes

replaceFreeVariableType :: Ord m => VariableType -> Type m -> Type m -> Type m

rewrite :: ((a -> b) -> a -> b) -> ((a -> b) -> a -> b) -> a -> b

rewriteTerm :: Ord b => ((Term a -> Term b) -> Term a -> Term b) -> (a -> b) -> Term a -> Term b

rewriteTermM :: Ord b => ((Term a -> Flow s (Term b)) -> Term a -> Flow s (Term b)) -> (a -> Flow s b) -> Term a -> Flow s (Term b)

rewriteTermMeta :: Ord b => (a -> b) -> Term a -> Term b

rewriteType :: ((Type a -> Type b) -> Type a -> Type b) -> (a -> b) -> Type a -> Type b

rewriteTypeMeta :: (a -> b) -> Type a -> Type b

simplifyTerm :: Ord m => Term m -> Term m

substituteVariable :: Ord m => Variable -> Variable -> Term m -> Term m

subterms :: Term m -> [Term m]

subtypes :: Type m -> [Type m]

termDependencyNames :: Bool -> Bool -> Bool -> Term m -> Set Name

topologicalSortElements :: [Element m] -> Maybe [Name]