Safe Haskell	None
Language	Haskell2010

FamInstEnv (signature^[?])

Contents

CoAxioms

Synopsis

Documentation

data FamInst Source #

Constructors

FamInst
Fields fi_axiom :: CoAxiom Unbranched fi_flavor :: FamFlavor fi_fam :: Name fi_tcs :: [Maybe Name] fi_tvs :: [TyVar] fi_cvs :: [CoVar] fi_tys :: [Type] fi_rhs :: Type

Instances

Outputable FamInst #
Methods ppr :: FamInst -> SDoc Source # pprPrec :: Rational -> FamInst -> SDoc Source #
NamedThing FamInst #
Methods getOccName :: FamInst -> OccName Source # getName :: FamInst -> Name Source #

data FamFlavor Source #

Constructors

SynFamilyInst
DataFamilyInst TyCon

famInstAxiom :: FamInst -> CoAxiom Unbranched Source #

famInstTyCon :: FamInst -> TyCon Source #

famInstRHS :: FamInst -> Type Source #

famInstsRepTyCons :: [FamInst] -> [TyCon] Source #

famInstRepTyCon_maybe :: FamInst -> Maybe TyCon Source #

dataFamInstRepTyCon :: FamInst -> TyCon Source #

pprFamInst :: FamInst -> SDoc Source #

pprFamInsts :: [FamInst] -> SDoc Source #

mkImportedFamInst :: Name -> [Maybe Name] -> CoAxiom Unbranched -> FamInst Source #

type FamInstEnvs = (FamInstEnv, FamInstEnv) Source #

type FamInstEnv = UniqDFM FamilyInstEnv Source #

emptyFamInstEnv :: FamInstEnv Source #

emptyFamInstEnvs :: (FamInstEnv, FamInstEnv) Source #

extendFamInstEnv :: FamInstEnv -> FamInst -> FamInstEnv Source #

extendFamInstEnvList :: FamInstEnv -> [FamInst] -> FamInstEnv Source #

famInstEnvElts :: FamInstEnv -> [FamInst] Source #

famInstEnvSize :: FamInstEnv -> Int Source #

familyInstances :: (FamInstEnv, FamInstEnv) -> TyCon -> [FamInst] Source #

CoAxioms

mkCoAxBranch :: [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] -> [CoVar] -> TyCon -> [Type] -> Type -> CoAxiom Unbranched Source #

mkNewTypeCoAxiom :: Name -> TyCon -> [TyVar] -> [Role] -> Type -> CoAxiom Unbranched Source #

Create a coercion constructor (axiom) suitable for the given newtype TyCon. The Name should be that of a new coercion CoAxiom, the TyVars the arguments expected by the newtype and the type the appropriate right hand side of the newtype, with the free variables a subset of those TyVars.

data FamInstMatch Source #

Constructors

FamInstMatch
Fields fim_instance :: FamInst fim_tys :: [Type] fim_cos :: [Coercion]

Instances

Outputable FamInstMatch #
Methods ppr :: FamInstMatch -> SDoc Source # pprPrec :: Rational -> FamInstMatch -> SDoc Source #

lookupFamInstEnv :: FamInstEnvs -> TyCon -> [Type] -> [FamInstMatch] Source #

lookupFamInstEnvConflicts :: FamInstEnvs -> FamInst -> [FamInstMatch] Source #

lookupFamInstEnvByTyCon :: FamInstEnvs -> TyCon -> [FamInst] Source #

isDominatedBy :: CoAxBranch -> [CoAxBranch] -> Bool Source #

apartnessCheck Source #

Arguments

:: [Type]	flattened target arguments. Make sure they're flattened! See Note [Flattening]. (NB: This "flat" is a different "flat" than is used in TcFlatten.)
-> 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.

data InjectivityCheckResult Source #

Result of testing two type family equations for injectiviy.

Constructors

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 overlpapped (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 (Coercion, Type) 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.

normaliseType :: FamInstEnvs -> Role -> Type -> (Coercion, Type) Source #

normaliseTcApp :: FamInstEnvs -> Role -> TyCon -> [Type] -> (Coercion, Type) Source #

reduceTyFamApp_maybe :: FamInstEnvs -> Role -> TyCon -> [Type] -> Maybe (Coercion, Type) Source #

pmTopNormaliseType_maybe :: FamInstEnvs -> Type -> Maybe (Type, [DataCon], Type) Source #

Get rid of *outermost* (or toplevel) * type function redex * data family redex * newtypes

Behaves exactly like topNormaliseType_maybe, but instead of returning a coercion, it returns useful information for issuing pattern matching warnings. See Note [Type normalisation for EmptyCase] for details.

flattenTys :: InScopeSet -> [Type] -> [Type] Source #