| Safe Haskell | Safe-Inferred |
|---|---|
| Language | Haskell2010 |
Unison.KindInference.Constraint.Pretty
Description
Synopsis
- prettyUVarKind :: Var v => PrettyPrintEnv -> ConstraintMap v loc -> UVar v loc -> Pretty ColorText
- prettySolvedConstraint :: Var v => PrettyPrintEnv -> ConstraintMap v loc -> Constraint (UVar v loc) v loc -> Pretty ColorText
- prettyCyclicUVarKind :: Var v => PrettyPrintEnv -> ConstraintMap v loc -> UVar v loc -> (Pretty ColorText -> Pretty ColorText) -> (Pretty ColorText, Pretty ColorText)
Documentation
prettyUVarKind :: Var v => PrettyPrintEnv -> ConstraintMap v loc -> UVar v loc -> Pretty ColorText Source #
Pretty print the kind constraint on the given UVar.
Precondition: The ConstraintMap is acyclic.
prettySolvedConstraint :: Var v => PrettyPrintEnv -> ConstraintMap v loc -> Constraint (UVar v loc) v loc -> Pretty ColorText Source #
Pretty print a Constraint
Precondition: The ConstraintMap is acyclic.
Arguments
| :: Var v | |
| => PrettyPrintEnv | |
| -> ConstraintMap v loc | |
| -> UVar v loc | |
| -> (Pretty ColorText -> Pretty ColorText) | A function to style the cyclic |
| -> (Pretty ColorText, Pretty ColorText) | (the pretty |
A pretty printer for cyclic kind constraints on a
UVar. Expresses the infinite kind by a generating equation.
Precondition: The UVar has a cyclic constraint.