DDC.Type.Equiv

Documentation

equivT :: Ord n => Type n -> Type n -> Bool

Check equivalence of types.

Checks equivalence up to alpha-renaming, as well as crushing of effects and trimming of closures.

• Return False if we find any free variables.
• We assume the types are well-kinded, so that the type annotations on bound variables match the binders. If this is not the case then you get an indeterminate result.

equivWithBindsT :: Ord n => [Bind n] -> [Bind n] -> Type n -> Type n -> Bool

Like equivT but take the initial stacks of type binders.

equivTyCon :: Eq n => TyCon n -> TyCon n -> Bool

Check if two TyCons are equivalent. We need to handle TyConBound specially incase it's kind isn't attached,

crushSomeT :: Ord n => TypeEnv n -> Type n -> Type n

Crush compound effects and closure terms. We check for a crushable term before calling crushT because that function will recursively crush the components. As equivT is already recursive, we don't want a doubly-recursive function that tries to re-crush the same non-crushable type over and over.

crushEffect

Arguments

:: Ord n

=> TypeEnv n

Globally available capabilities.

-> Effect n

Type to crush.

-> Effect n

Crush compound effect terms into their components.

For example, crushing DeepRead (List r1 (Int r2)) yields (Read r1 + Read r2).