Safe Haskell | None |
---|---|
Language | GHC2021 |
Synopsis
- data FamInst = FamInst {}
- data FamFlavor
- famInstAxiom :: FamInst -> CoAxiom Unbranched
- famInstTyCon :: FamInst -> TyCon
- famInstRHS :: FamInst -> Type
- famInstsRepTyCons :: [FamInst] -> [TyCon]
- famInstRepTyCon_maybe :: FamInst -> Maybe TyCon
- dataFamInstRepTyCon :: FamInst -> TyCon
- pprFamInst :: FamInst -> SDoc
- pprFamInsts :: [FamInst] -> SDoc
- orphNamesOfFamInst :: FamInst -> NameSet
- mkImportedFamInst :: Name -> [RoughMatchTc] -> CoAxiom Unbranched -> IsOrphan -> FamInst
- mkLocalFamInst :: FamFlavor -> CoAxiom Unbranched -> [TyVar] -> [CoVar] -> [Type] -> Type -> FamInst
- type FamInstEnvs = (FamInstEnv, FamInstEnv)
- data FamInstEnv
- emptyFamInstEnv :: FamInstEnv
- emptyFamInstEnvs :: (FamInstEnv, FamInstEnv)
- unionFamInstEnv :: FamInstEnv -> FamInstEnv -> FamInstEnv
- extendFamInstEnv :: FamInstEnv -> FamInst -> FamInstEnv
- extendFamInstEnvList :: FamInstEnv -> [FamInst] -> FamInstEnv
- famInstEnvElts :: FamInstEnv -> [FamInst]
- famInstEnvSize :: FamInstEnv -> Int
- familyInstances :: (FamInstEnv, FamInstEnv) -> TyCon -> [FamInst]
- familyNameInstances :: (FamInstEnv, FamInstEnv) -> Name -> [FamInst]
- mkCoAxBranch :: [TyVar] -> [TyVar] -> [CoVar] -> [Type] -> Type -> [Role] -> SrcSpan -> CoAxBranch
- mkBranchedCoAxiom :: Name -> TyCon -> [CoAxBranch] -> CoAxiom Branched
- mkUnbranchedCoAxiom :: Name -> TyCon -> CoAxBranch -> CoAxiom Unbranched
- mkSingleCoAxiom :: Role -> Name -> [TyVar] -> [TyVar] -> [CoVar] -> TyCon -> [Type] -> Type -> CoAxiom Unbranched
- mkNewTypeCoAxiom :: Name -> TyCon -> [TyVar] -> [Role] -> Type -> CoAxiom Unbranched
- data FamInstMatch = FamInstMatch {}
- lookupFamInstEnv :: FamInstEnvs -> TyCon -> [Type] -> [FamInstMatch]
- lookupFamInstEnvConflicts :: FamInstEnvs -> FamInst -> [FamInst]
- lookupFamInstEnvByTyCon :: FamInstEnvs -> TyCon -> [FamInst]
- isDominatedBy :: CoAxBranch -> [CoAxBranch] -> Bool
- apartnessCheck :: [Type] -> CoAxBranch -> Bool
- compatibleBranches :: CoAxBranch -> CoAxBranch -> Bool
- data InjectivityCheckResult
- lookupFamInstEnvInjectivityConflicts :: [Bool] -> FamInstEnvs -> FamInst -> [CoAxBranch]
- injectiveBranches :: [Bool] -> CoAxBranch -> CoAxBranch -> InjectivityCheckResult
- topNormaliseType :: FamInstEnvs -> Type -> Type
- topNormaliseType_maybe :: FamInstEnvs -> Type -> Maybe Reduction
- normaliseType :: FamInstEnvs -> Role -> Type -> Reduction
- normaliseTcApp :: FamInstEnvs -> Role -> TyCon -> [Type] -> Reduction
- topReduceTyFamApp_maybe :: FamInstEnvs -> TyCon -> [Type] -> Maybe HetReduction
- reduceTyFamApp_maybe :: FamInstEnvs -> Role -> TyCon -> [Type] -> Maybe Reduction
Documentation
Instances
famInstAxiom :: FamInst -> CoAxiom Unbranched Source #
famInstTyCon :: FamInst -> TyCon Source #
famInstRHS :: FamInst -> Type Source #
famInstsRepTyCons :: [FamInst] -> [TyCon] Source #
dataFamInstRepTyCon :: FamInst -> TyCon Source #
pprFamInst :: FamInst -> SDoc Source #
pprFamInsts :: [FamInst] -> SDoc Source #
orphNamesOfFamInst :: FamInst -> NameSet Source #
mkImportedFamInst :: Name -> [RoughMatchTc] -> CoAxiom Unbranched -> IsOrphan -> FamInst Source #
mkLocalFamInst :: FamFlavor -> CoAxiom Unbranched -> [TyVar] -> [CoVar] -> [Type] -> Type -> FamInst Source #
type FamInstEnvs = (FamInstEnv, FamInstEnv) Source #
data FamInstEnv Source #
Instances
Outputable FamInstEnv Source # | |
Defined in GHC.Core.FamInstEnv ppr :: FamInstEnv -> SDoc Source # |
emptyFamInstEnvs :: (FamInstEnv, FamInstEnv) Source #
Create a FamInstEnv
from Name
indices.
INVARIANTS:
* The fs_tvs are distinct in each FamInst
of a range value of the map (so we can safely unify them)
unionFamInstEnv :: FamInstEnv -> FamInstEnv -> FamInstEnv Source #
Makes no particular effort to detect conflicts.
extendFamInstEnv :: FamInstEnv -> FamInst -> FamInstEnv Source #
extendFamInstEnvList :: FamInstEnv -> [FamInst] -> FamInstEnv Source #
famInstEnvElts :: FamInstEnv -> [FamInst] Source #
famInstEnvSize :: FamInstEnv -> Int Source #
familyInstances :: (FamInstEnv, FamInstEnv) -> TyCon -> [FamInst] Source #
familyNameInstances :: (FamInstEnv, FamInstEnv) -> Name -> [FamInst] Source #
CoAxioms
mkCoAxBranch :: [TyVar] -> [TyVar] -> [CoVar] -> [Type] -> Type -> [Role] -> SrcSpan -> CoAxBranch Source #
mkBranchedCoAxiom :: Name -> TyCon -> [CoAxBranch] -> CoAxiom Branched Source #
mkUnbranchedCoAxiom :: Name -> TyCon -> CoAxBranch -> CoAxiom Unbranched Source #
mkSingleCoAxiom :: Role -> Name -> [TyVar] -> [TyVar] -> [CoVar] -> TyCon -> [Type] -> Type -> CoAxiom Unbranched Source #
mkNewTypeCoAxiom :: Name -> TyCon -> [TyVar] -> [Role] -> Type -> CoAxiom Unbranched Source #
data FamInstMatch Source #
Instances
Outputable FamInstMatch Source # | |
Defined in GHC.Core.FamInstEnv ppr :: FamInstMatch -> SDoc Source # |
lookupFamInstEnv :: FamInstEnvs -> TyCon -> [Type] -> [FamInstMatch] Source #
lookupFamInstEnvConflicts :: FamInstEnvs -> FamInst -> [FamInst] Source #
lookupFamInstEnvByTyCon :: FamInstEnvs -> TyCon -> [FamInst] Source #
isDominatedBy :: CoAxBranch -> [CoAxBranch] -> Bool Source #
:: [Type] | flattened target arguments. Make sure they're flattened! See Note [Flattening type-family applications when matching instances] in GHC.Core.Unify. |
-> CoAxBranch | the candidate equation we wish to use Precondition: this matches the target |
-> Bool | True = equation can fire |
Do an apartness check, as described in the "Closed Type Families" paper
(POPL '14). This should be used when determining if an equation
(CoAxBranch
) of a closed type family can be used to reduce a certain target
type family application.
compatibleBranches :: CoAxBranch -> CoAxBranch -> Bool Source #
data InjectivityCheckResult Source #
Result of testing two type family equations for injectiviy.
InjectivityAccepted | Either RHSs are distinct or unification of RHSs leads to unification of LHSs |
InjectivityUnified CoAxBranch CoAxBranch | RHSs unify but LHSs don't unify under that substitution. Relevant for closed type families where equation after unification might be overlapped (in which case it is OK if they don't unify). Constructor stores axioms after unification. |
lookupFamInstEnvInjectivityConflicts :: [Bool] -> FamInstEnvs -> FamInst -> [CoAxBranch] Source #
Check whether an open type family equation can be added to already existing instance environment without causing conflicts with supplied injectivity annotations. Returns list of conflicting axioms (type instance declarations).
injectiveBranches :: [Bool] -> CoAxBranch -> CoAxBranch -> InjectivityCheckResult Source #
Check whether two type family axioms don't violate injectivity annotation.
topNormaliseType :: FamInstEnvs -> Type -> Type Source #
topNormaliseType_maybe :: FamInstEnvs -> Type -> Maybe Reduction Source #
Get rid of *outermost* (or toplevel) * type function redex * data family redex * newtypes returning an appropriate Representational coercion. Specifically, if topNormaliseType_maybe env ty = Just (co, ty') then (a) co :: ty ~R ty' (b) ty' is not a newtype, and is not a type-family or data-family redex
However, ty' can be something like (Maybe (F ty)), where (F ty) is a redex.
Always operates homogeneously: the returned type has the same kind as the original type, and the returned coercion is always homogeneous.
normaliseType :: FamInstEnvs -> Role -> Type -> Reduction Source #
normaliseTcApp :: FamInstEnvs -> Role -> TyCon -> [Type] -> Reduction Source #
topReduceTyFamApp_maybe :: FamInstEnvs -> TyCon -> [Type] -> Maybe HetReduction Source #
Try to simplify a type-family application, by *one* step If topReduceTyFamApp_maybe env r F tys = Just (HetReduction (Reduction co rhs) res_co) then co :: F tys ~R# rhs res_co :: typeKind(F tys) ~ typeKind(rhs) Type families and data families; always Representational role
reduceTyFamApp_maybe :: FamInstEnvs -> Role -> TyCon -> [Type] -> Maybe Reduction Source #