packages feed

intrinsic-superclasses 0.3.0.0 → 0.4.0.0

raw patch · 6 files changed

+60/−46 lines, 6 filesPVP ok

version bump matches the API change (PVP)

API changes (from Hackage documentation)

- Language.Haskell.TH.Instances: defaulting :: Name -> Q Exp -> Q [Dec]
- Language.Haskell.TH.Instances.Defaults: defaulting :: Name -> Q Exp -> Q [Dec]
- Language.Haskell.TH.Instances.Internal.Defaults: defaults# :: MVar (Map Name Exp)
- Language.Haskell.TH.Instances.Internal.Defaults: getDefault :: Name -> Q (Maybe Dec)
+ Language.Haskell.TH.Instances: Defaults :: Name -> Name -> Defaults
+ Language.Haskell.TH.Instances: [defining] :: Defaults -> Name
+ Language.Haskell.TH.Instances: [definition] :: Defaults -> Name
+ Language.Haskell.TH.Instances: data Defaults
+ Language.Haskell.TH.Instances.Defaults: Defaults :: Name -> Name -> Defaults
+ Language.Haskell.TH.Instances.Defaults: [defining] :: Defaults -> Name
+ Language.Haskell.TH.Instances.Defaults: [definition] :: Defaults -> Name
+ Language.Haskell.TH.Instances.Defaults: data Defaults
+ Language.Haskell.TH.Instances.Defaults: instance Data.Data.Data Language.Haskell.TH.Instances.Defaults.Defaults
+ Language.Haskell.TH.Instances.Defaults: instance GHC.Show.Show Language.Haskell.TH.Instances.Defaults.Defaults
+ Language.Haskell.TH.Instances.Internal: (<$!>) :: Monad m => a -> b -> m a -> m b
+ Language.Haskell.TH.Instances.Internal: (<&>) :: Functor f => f a -> (a -> b) -> f b
+ Language.Haskell.TH.Instances.Internal: (<=<) :: Monad m => b -> m c -> a -> m b -> a -> m c
+ Language.Haskell.TH.Instances.Internal: (<>) :: Semigroup a => a -> a -> a
+ Language.Haskell.TH.Instances.Internal: (=<<) :: Monad m => a -> m b -> m a -> m b
+ Language.Haskell.TH.Instances.Internal: (>=>) :: Monad m => a -> m b -> b -> m c -> a -> m c
+ Language.Haskell.TH.Instances.Internal: (>>) :: Monad m => m a -> m b -> m b
+ Language.Haskell.TH.Instances.Internal: (>>=) :: Monad m => m a -> a -> m b -> m b
+ Language.Haskell.TH.Instances.Internal: All :: Bool -> All
+ Language.Haskell.TH.Instances.Internal: AllPhases :: Phases
+ Language.Haskell.TH.Instances.Internal: AllowAmbiguousTypes :: Extension
+ Language.Haskell.TH.Instances.Internal: Alone :: NameIs
+ Language.Haskell.TH.Instances.Internal: Alt :: f a -> Alt
+ Language.Haskell.TH.Instances.Internal: AlternativeLayoutRule :: Extension
+ Language.Haskell.TH.Instances.Internal: AlternativeLayoutRuleTransitional :: Extension
+ Language.Haskell.TH.Instances.Internal: AnnLookupModule :: Module -> AnnLookup
+ Language.Haskell.TH.Instances.Internal: AnnLookupName :: Name -> AnnLookup
+ Language.Haskell.TH.Instances.Internal: AnnP :: AnnTarget -> Exp -> Pragma
+ Language.Haskell.TH.Instances.Internal: Any :: Bool -> Any
+ Language.Haskell.TH.Instances.Internal: AnyclassStrategy :: DerivStrategy
+ Language.Haskell.TH.Instances.Internal: AppE :: Exp -> Exp -> Exp
+ Language.Haskell.TH.Instances.Internal: AppT :: Type -> Type -> Type
+ Language.Haskell.TH.Instances.Internal: AppTypeE :: Exp -> Type -> Exp
+ Language.Haskell.TH.Instances.Internal: ApplicativeDo :: Extension
+ Language.Haskell.TH.Instances.Internal: Applied :: NameIs
+ Language.Haskell.TH.Instances.Internal: ArithSeqE :: Range -> Exp
+ Language.Haskell.TH.Instances.Internal: ArrowT :: Type
+ Language.Haskell.TH.Instances.Internal: Arrows :: Extension
+ Language.Haskell.TH.Instances.Internal: AsP :: Name -> Pat -> Pat
+ Language.Haskell.TH.Instances.Internal: AutoDeriveTypeable :: Extension
+ Language.Haskell.TH.Instances.Internal: Bang :: SourceUnpackedness -> SourceStrictness -> Bang
+ Language.Haskell.TH.Instances.Internal: BangP :: Pat -> Pat
+ Language.Haskell.TH.Instances.Internal: BangPatterns :: Extension
+ Language.Haskell.TH.Instances.Internal: BeforePhase :: Int -> Phases
+ Language.Haskell.TH.Instances.Internal: BinaryLiterals :: Extension
+ Language.Haskell.TH.Instances.Internal: BindS :: Pat -> Exp -> Stmt
+ Language.Haskell.TH.Instances.Internal: CApi :: Callconv
+ Language.Haskell.TH.Instances.Internal: CApiFFI :: Extension
+ Language.Haskell.TH.Instances.Internal: CCall :: Callconv
+ Language.Haskell.TH.Instances.Internal: CaseE :: Exp -> [Match] -> Exp
+ Language.Haskell.TH.Instances.Internal: CharL :: Char -> Lit
+ Language.Haskell.TH.Instances.Internal: CharPrimL :: Char -> Lit
+ Language.Haskell.TH.Instances.Internal: ClassD :: Cxt -> Name -> [TyVarBndr] -> [FunDep] -> [Dec] -> Dec
+ Language.Haskell.TH.Instances.Internal: ClassI :: Dec -> [InstanceDec] -> Info
+ Language.Haskell.TH.Instances.Internal: ClassOpI :: Name -> Type -> ParentName -> Info
+ Language.Haskell.TH.Instances.Internal: Clause :: [Pat] -> Body -> [Dec] -> Clause
+ Language.Haskell.TH.Instances.Internal: ClosedTypeFamilyD :: TypeFamilyHead -> [TySynEqn] -> Dec
+ Language.Haskell.TH.Instances.Internal: CompE :: [Stmt] -> Exp
+ Language.Haskell.TH.Instances.Internal: CompleteP :: [Name] -> Maybe Name -> Pragma
+ Language.Haskell.TH.Instances.Internal: ConE :: Name -> Exp
+ Language.Haskell.TH.Instances.Internal: ConLike :: RuleMatch
+ Language.Haskell.TH.Instances.Internal: ConP :: Name -> [Pat] -> Pat
+ Language.Haskell.TH.Instances.Internal: ConT :: Name -> Type
+ Language.Haskell.TH.Instances.Internal: CondE :: Exp -> Exp -> Exp -> Exp
+ Language.Haskell.TH.Instances.Internal: ConstrainedClassMethods :: Extension
+ Language.Haskell.TH.Instances.Internal: ConstraintKinds :: Extension
+ Language.Haskell.TH.Instances.Internal: ConstraintT :: Type
+ Language.Haskell.TH.Instances.Internal: Cpp :: Extension
+ Language.Haskell.TH.Instances.Internal: DataConI :: Name -> Type -> ParentName -> Info
+ Language.Haskell.TH.Instances.Internal: DataD :: Cxt -> Name -> [TyVarBndr] -> Maybe Kind -> [Con] -> [DerivClause] -> Dec
+ Language.Haskell.TH.Instances.Internal: DataFamilyD :: Name -> [TyVarBndr] -> Maybe Kind -> Dec
+ Language.Haskell.TH.Instances.Internal: DataInstD :: Cxt -> Name -> [Type] -> Maybe Kind -> [Con] -> [DerivClause] -> Dec
+ Language.Haskell.TH.Instances.Internal: DataKinds :: Extension
+ Language.Haskell.TH.Instances.Internal: DataName :: NameSpace
+ Language.Haskell.TH.Instances.Internal: DatatypeContexts :: Extension
+ Language.Haskell.TH.Instances.Internal: DecidedLazy :: DecidedStrictness
+ Language.Haskell.TH.Instances.Internal: DecidedStrict :: DecidedStrictness
+ Language.Haskell.TH.Instances.Internal: DecidedUnpack :: DecidedStrictness
+ Language.Haskell.TH.Instances.Internal: DefaultSigD :: Name -> Type -> Dec
+ Language.Haskell.TH.Instances.Internal: DefaultSignatures :: Extension
+ Language.Haskell.TH.Instances.Internal: Defaults :: Name -> Name -> Defaults
+ Language.Haskell.TH.Instances.Internal: DerivClause :: Maybe DerivStrategy -> Cxt -> DerivClause
+ Language.Haskell.TH.Instances.Internal: DeriveAnyClass :: Extension
+ Language.Haskell.TH.Instances.Internal: DeriveDataTypeable :: Extension
+ Language.Haskell.TH.Instances.Internal: DeriveFoldable :: Extension
+ Language.Haskell.TH.Instances.Internal: DeriveFunctor :: Extension
+ Language.Haskell.TH.Instances.Internal: DeriveGeneric :: Extension
+ Language.Haskell.TH.Instances.Internal: DeriveLift :: Extension
+ Language.Haskell.TH.Instances.Internal: DeriveTraversable :: Extension
+ Language.Haskell.TH.Instances.Internal: DerivingStrategies :: Extension
+ Language.Haskell.TH.Instances.Internal: DisambiguateRecordFields :: Extension
+ Language.Haskell.TH.Instances.Internal: DoAndIfThenElse :: Extension
+ Language.Haskell.TH.Instances.Internal: DoE :: [Stmt] -> Exp
+ Language.Haskell.TH.Instances.Internal: DoublePrimL :: Rational -> Lit
+ Language.Haskell.TH.Instances.Internal: Dual :: a -> Dual a
+ Language.Haskell.TH.Instances.Internal: DuplicateRecordFields :: Extension
+ Language.Haskell.TH.Instances.Internal: EmptyCase :: Extension
+ Language.Haskell.TH.Instances.Internal: EmptyDataDecls :: Extension
+ Language.Haskell.TH.Instances.Internal: EmptyDataDeriving :: Extension
+ Language.Haskell.TH.Instances.Internal: Endo :: a -> a -> Endo a
+ Language.Haskell.TH.Instances.Internal: EqualityT :: Type
+ Language.Haskell.TH.Instances.Internal: ExistentialQuantification :: Extension
+ Language.Haskell.TH.Instances.Internal: ExplBidir :: [Clause] -> PatSynDir
+ Language.Haskell.TH.Instances.Internal: ExplicitForAll :: Extension
+ Language.Haskell.TH.Instances.Internal: ExplicitNamespaces :: Extension
+ Language.Haskell.TH.Instances.Internal: ExportF :: Callconv -> String -> Name -> Type -> Foreign
+ Language.Haskell.TH.Instances.Internal: ExtendedDefaultRules :: Extension
+ Language.Haskell.TH.Instances.Internal: FamilyI :: Dec -> [InstanceDec] -> Info
+ Language.Haskell.TH.Instances.Internal: First :: Maybe a -> First a
+ Language.Haskell.TH.Instances.Internal: Fixity :: Int -> FixityDirection -> Fixity
+ Language.Haskell.TH.Instances.Internal: FlexibleContexts :: Extension
+ Language.Haskell.TH.Instances.Internal: FlexibleInstances :: Extension
+ Language.Haskell.TH.Instances.Internal: FloatPrimL :: Rational -> Lit
+ Language.Haskell.TH.Instances.Internal: ForallC :: [TyVarBndr] -> Cxt -> Con -> Con
+ Language.Haskell.TH.Instances.Internal: ForallT :: [TyVarBndr] -> Cxt -> Type -> Type
+ Language.Haskell.TH.Instances.Internal: ForeignD :: Foreign -> Dec
+ Language.Haskell.TH.Instances.Internal: ForeignFunctionInterface :: Extension
+ Language.Haskell.TH.Instances.Internal: FromPhase :: Int -> Phases
+ Language.Haskell.TH.Instances.Internal: FromR :: Exp -> Range
+ Language.Haskell.TH.Instances.Internal: FromThenR :: Exp -> Exp -> Range
+ Language.Haskell.TH.Instances.Internal: FromThenToR :: Exp -> Exp -> Exp -> Range
+ Language.Haskell.TH.Instances.Internal: FromToR :: Exp -> Exp -> Range
+ Language.Haskell.TH.Instances.Internal: FunD :: Name -> [Clause] -> Dec
+ Language.Haskell.TH.Instances.Internal: FunDep :: [Name] -> [Name] -> FunDep
+ Language.Haskell.TH.Instances.Internal: FunLike :: RuleMatch
+ Language.Haskell.TH.Instances.Internal: FunctionalDependencies :: Extension
+ Language.Haskell.TH.Instances.Internal: GADTSyntax :: Extension
+ Language.Haskell.TH.Instances.Internal: GADTs :: Extension
+ Language.Haskell.TH.Instances.Internal: GHCForeignImportPrim :: Extension
+ Language.Haskell.TH.Instances.Internal: GadtC :: [Name] -> [BangType] -> Type -> Con
+ Language.Haskell.TH.Instances.Internal: GeneralizedNewtypeDeriving :: Extension
+ Language.Haskell.TH.Instances.Internal: GuardedB :: [(Guard, Exp)] -> Body
+ Language.Haskell.TH.Instances.Internal: HexFloatLiterals :: Extension
+ Language.Haskell.TH.Instances.Internal: ImplBidir :: PatSynDir
+ Language.Haskell.TH.Instances.Internal: ImplicitParams :: Extension
+ Language.Haskell.TH.Instances.Internal: ImplicitPrelude :: Extension
+ Language.Haskell.TH.Instances.Internal: ImportF :: Callconv -> Safety -> String -> Name -> Type -> Foreign
+ Language.Haskell.TH.Instances.Internal: ImpredicativeTypes :: Extension
+ Language.Haskell.TH.Instances.Internal: Incoherent :: Overlap
+ Language.Haskell.TH.Instances.Internal: IncoherentInstances :: Extension
+ Language.Haskell.TH.Instances.Internal: InferR :: Role
+ Language.Haskell.TH.Instances.Internal: Infix :: NameIs
+ Language.Haskell.TH.Instances.Internal: InfixC :: BangType -> Name -> BangType -> Con
+ Language.Haskell.TH.Instances.Internal: InfixD :: Fixity -> Name -> Dec
+ Language.Haskell.TH.Instances.Internal: InfixE :: Maybe Exp -> Exp -> Maybe Exp -> Exp
+ Language.Haskell.TH.Instances.Internal: InfixL :: FixityDirection
+ Language.Haskell.TH.Instances.Internal: InfixN :: FixityDirection
+ Language.Haskell.TH.Instances.Internal: InfixP :: Pat -> Name -> Pat -> Pat
+ Language.Haskell.TH.Instances.Internal: InfixPatSyn :: Name -> Name -> PatSynArgs
+ Language.Haskell.TH.Instances.Internal: InfixR :: FixityDirection
+ Language.Haskell.TH.Instances.Internal: InfixT :: Type -> Name -> Type -> Type
+ Language.Haskell.TH.Instances.Internal: InjectivityAnn :: Name -> [Name] -> InjectivityAnn
+ Language.Haskell.TH.Instances.Internal: Inlinable :: Inline
+ Language.Haskell.TH.Instances.Internal: Inline :: Inline
+ Language.Haskell.TH.Instances.Internal: InlineP :: Name -> Inline -> RuleMatch -> Phases -> Pragma
+ Language.Haskell.TH.Instances.Internal: InstanceD :: Maybe Overlap -> Cxt -> Type -> [Dec] -> Dec
+ Language.Haskell.TH.Instances.Internal: InstanceSigs :: Extension
+ Language.Haskell.TH.Instances.Internal: IntPrimL :: Integer -> Lit
+ Language.Haskell.TH.Instances.Internal: IntegerL :: Integer -> Lit
+ Language.Haskell.TH.Instances.Internal: Interruptible :: Safety
+ Language.Haskell.TH.Instances.Internal: InterruptibleFFI :: Extension
+ Language.Haskell.TH.Instances.Internal: JavaScript :: Callconv
+ Language.Haskell.TH.Instances.Internal: JavaScriptFFI :: Extension
+ Language.Haskell.TH.Instances.Internal: KindSig :: Kind -> FamilyResultSig
+ Language.Haskell.TH.Instances.Internal: KindSignatures :: Extension
+ Language.Haskell.TH.Instances.Internal: KindedTV :: Name -> Kind -> TyVarBndr
+ Language.Haskell.TH.Instances.Internal: LabelE :: String -> Exp
+ Language.Haskell.TH.Instances.Internal: LamCaseE :: [Match] -> Exp
+ Language.Haskell.TH.Instances.Internal: LamE :: [Pat] -> Exp -> Exp
+ Language.Haskell.TH.Instances.Internal: LambdaCase :: Extension
+ Language.Haskell.TH.Instances.Internal: LangC :: ForeignSrcLang
+ Language.Haskell.TH.Instances.Internal: LangCxx :: ForeignSrcLang
+ Language.Haskell.TH.Instances.Internal: LangObjc :: ForeignSrcLang
+ Language.Haskell.TH.Instances.Internal: LangObjcxx :: ForeignSrcLang
+ Language.Haskell.TH.Instances.Internal: Last :: Maybe a -> Last a
+ Language.Haskell.TH.Instances.Internal: LetE :: [Dec] -> Exp -> Exp
+ Language.Haskell.TH.Instances.Internal: LetS :: [Dec] -> Stmt
+ Language.Haskell.TH.Instances.Internal: LiberalTypeSynonyms :: Extension
+ Language.Haskell.TH.Instances.Internal: LineP :: Int -> String -> Pragma
+ Language.Haskell.TH.Instances.Internal: ListE :: [Exp] -> Exp
+ Language.Haskell.TH.Instances.Internal: ListP :: [Pat] -> Pat
+ Language.Haskell.TH.Instances.Internal: ListT :: Type
+ Language.Haskell.TH.Instances.Internal: LitE :: Lit -> Exp
+ Language.Haskell.TH.Instances.Internal: LitP :: Lit -> Pat
+ Language.Haskell.TH.Instances.Internal: LitT :: TyLit -> Type
+ Language.Haskell.TH.Instances.Internal: Loc :: String -> String -> String -> CharPos -> CharPos -> Loc
+ Language.Haskell.TH.Instances.Internal: MagicHash :: Extension
+ Language.Haskell.TH.Instances.Internal: Match :: Pat -> Body -> [Dec] -> Match
+ Language.Haskell.TH.Instances.Internal: ModName :: String -> ModName
+ Language.Haskell.TH.Instances.Internal: Module :: PkgName -> ModName -> Module
+ Language.Haskell.TH.Instances.Internal: ModuleAnnotation :: AnnTarget
+ Language.Haskell.TH.Instances.Internal: ModuleInfo :: [Module] -> ModuleInfo
+ Language.Haskell.TH.Instances.Internal: MonadComprehensions :: Extension
+ Language.Haskell.TH.Instances.Internal: MonadFailDesugaring :: Extension
+ Language.Haskell.TH.Instances.Internal: MonoLocalBinds :: Extension
+ Language.Haskell.TH.Instances.Internal: MonoPatBinds :: Extension
+ Language.Haskell.TH.Instances.Internal: MonomorphismRestriction :: Extension
+ Language.Haskell.TH.Instances.Internal: MultiIfE :: [(Guard, Exp)] -> Exp
+ Language.Haskell.TH.Instances.Internal: MultiParamTypeClasses :: Extension
+ Language.Haskell.TH.Instances.Internal: MultiWayIf :: Extension
+ Language.Haskell.TH.Instances.Internal: NPlusKPatterns :: Extension
+ Language.Haskell.TH.Instances.Internal: Name :: OccName -> NameFlavour -> Name
+ Language.Haskell.TH.Instances.Internal: NameG :: NameSpace -> PkgName -> ModName -> NameFlavour
+ Language.Haskell.TH.Instances.Internal: NameL :: !Int -> NameFlavour
+ Language.Haskell.TH.Instances.Internal: NameQ :: ModName -> NameFlavour
+ Language.Haskell.TH.Instances.Internal: NameS :: NameFlavour
+ Language.Haskell.TH.Instances.Internal: NameU :: !Int -> NameFlavour
+ Language.Haskell.TH.Instances.Internal: NamedWildCards :: Extension
+ Language.Haskell.TH.Instances.Internal: NegativeLiterals :: Extension
+ Language.Haskell.TH.Instances.Internal: NewtypeD :: Cxt -> Name -> [TyVarBndr] -> Maybe Kind -> Con -> [DerivClause] -> Dec
+ Language.Haskell.TH.Instances.Internal: NewtypeInstD :: Cxt -> Name -> [Type] -> Maybe Kind -> Con -> [DerivClause] -> Dec
+ Language.Haskell.TH.Instances.Internal: NewtypeStrategy :: DerivStrategy
+ Language.Haskell.TH.Instances.Internal: NoBindS :: Exp -> Stmt
+ Language.Haskell.TH.Instances.Internal: NoInline :: Inline
+ Language.Haskell.TH.Instances.Internal: NoSig :: FamilyResultSig
+ Language.Haskell.TH.Instances.Internal: NoSourceStrictness :: SourceStrictness
+ Language.Haskell.TH.Instances.Internal: NoSourceUnpackedness :: SourceUnpackedness
+ Language.Haskell.TH.Instances.Internal: NominalR :: Role
+ Language.Haskell.TH.Instances.Internal: NondecreasingIndentation :: Extension
+ Language.Haskell.TH.Instances.Internal: NormalB :: Exp -> Body
+ Language.Haskell.TH.Instances.Internal: NormalC :: Name -> [BangType] -> Con
+ Language.Haskell.TH.Instances.Internal: NormalG :: Exp -> Guard
+ Language.Haskell.TH.Instances.Internal: NullaryTypeClasses :: Extension
+ Language.Haskell.TH.Instances.Internal: NumDecimals :: Extension
+ Language.Haskell.TH.Instances.Internal: NumTyLit :: Integer -> TyLit
+ Language.Haskell.TH.Instances.Internal: OccName :: String -> OccName
+ Language.Haskell.TH.Instances.Internal: OpenTypeFamilyD :: TypeFamilyHead -> Dec
+ Language.Haskell.TH.Instances.Internal: Overlappable :: Overlap
+ Language.Haskell.TH.Instances.Internal: Overlapping :: Overlap
+ Language.Haskell.TH.Instances.Internal: OverlappingInstances :: Extension
+ Language.Haskell.TH.Instances.Internal: Overlaps :: Overlap
+ Language.Haskell.TH.Instances.Internal: OverloadedLabels :: Extension
+ Language.Haskell.TH.Instances.Internal: OverloadedLists :: Extension
+ Language.Haskell.TH.Instances.Internal: OverloadedStrings :: Extension
+ Language.Haskell.TH.Instances.Internal: PackageImports :: Extension
+ Language.Haskell.TH.Instances.Internal: ParS :: [[Stmt]] -> Stmt
+ Language.Haskell.TH.Instances.Internal: ParallelArrays :: Extension
+ Language.Haskell.TH.Instances.Internal: ParallelListComp :: Extension
+ Language.Haskell.TH.Instances.Internal: ParensE :: Exp -> Exp
+ Language.Haskell.TH.Instances.Internal: ParensP :: Pat -> Pat
+ Language.Haskell.TH.Instances.Internal: ParensT :: Type -> Type
+ Language.Haskell.TH.Instances.Internal: PartialTypeSignatures :: Extension
+ Language.Haskell.TH.Instances.Internal: PatG :: [Stmt] -> Guard
+ Language.Haskell.TH.Instances.Internal: PatSynD :: Name -> PatSynArgs -> PatSynDir -> Pat -> Dec
+ Language.Haskell.TH.Instances.Internal: PatSynI :: Name -> PatSynType -> Info
+ Language.Haskell.TH.Instances.Internal: PatSynSigD :: Name -> PatSynType -> Dec
+ Language.Haskell.TH.Instances.Internal: PatternGuards :: Extension
+ Language.Haskell.TH.Instances.Internal: PatternSynonyms :: Extension
+ Language.Haskell.TH.Instances.Internal: PhantomR :: Role
+ Language.Haskell.TH.Instances.Internal: PkgName :: String -> PkgName
+ Language.Haskell.TH.Instances.Internal: PlainTV :: Name -> TyVarBndr
+ Language.Haskell.TH.Instances.Internal: PolyKinds :: Extension
+ Language.Haskell.TH.Instances.Internal: PostfixOperators :: Extension
+ Language.Haskell.TH.Instances.Internal: PragmaD :: Pragma -> Dec
+ Language.Haskell.TH.Instances.Internal: PrefixPatSyn :: [Name] -> PatSynArgs
+ Language.Haskell.TH.Instances.Internal: Prim :: Callconv
+ Language.Haskell.TH.Instances.Internal: PrimTyConI :: Name -> Arity -> Unlifted -> Info
+ Language.Haskell.TH.Instances.Internal: Product :: a -> Product a
+ Language.Haskell.TH.Instances.Internal: PromotedConsT :: Type
+ Language.Haskell.TH.Instances.Internal: PromotedNilT :: Type
+ Language.Haskell.TH.Instances.Internal: PromotedT :: Name -> Type
+ Language.Haskell.TH.Instances.Internal: PromotedTupleT :: Int -> Type
+ Language.Haskell.TH.Instances.Internal: Q :: forall (m :: * -> *). Quasi m => m a -> Q a
+ Language.Haskell.TH.Instances.Internal: QuasiQuoter :: String -> Q Exp -> String -> Q Pat -> String -> Q Type -> String -> Q [Dec] -> QuasiQuoter
+ Language.Haskell.TH.Instances.Internal: QuasiQuotes :: Extension
+ Language.Haskell.TH.Instances.Internal: RankNTypes :: Extension
+ Language.Haskell.TH.Instances.Internal: RationalL :: Rational -> Lit
+ Language.Haskell.TH.Instances.Internal: RebindableSyntax :: Extension
+ Language.Haskell.TH.Instances.Internal: RecC :: Name -> [VarBangType] -> Con
+ Language.Haskell.TH.Instances.Internal: RecConE :: Name -> [FieldExp] -> Exp
+ Language.Haskell.TH.Instances.Internal: RecGadtC :: [Name] -> [VarBangType] -> Type -> Con
+ Language.Haskell.TH.Instances.Internal: RecP :: Name -> [FieldPat] -> Pat
+ Language.Haskell.TH.Instances.Internal: RecUpdE :: Exp -> [FieldExp] -> Exp
+ Language.Haskell.TH.Instances.Internal: RecordPatSyn :: [Name] -> PatSynArgs
+ Language.Haskell.TH.Instances.Internal: RecordPuns :: Extension
+ Language.Haskell.TH.Instances.Internal: RecordWildCards :: Extension
+ Language.Haskell.TH.Instances.Internal: RecursiveDo :: Extension
+ Language.Haskell.TH.Instances.Internal: RelaxedLayout :: Extension
+ Language.Haskell.TH.Instances.Internal: RelaxedPolyRec :: Extension
+ Language.Haskell.TH.Instances.Internal: RepresentationalR :: Role
+ Language.Haskell.TH.Instances.Internal: RoleAnnotD :: Name -> [Role] -> Dec
+ Language.Haskell.TH.Instances.Internal: RoleAnnotations :: Extension
+ Language.Haskell.TH.Instances.Internal: RuleP :: String -> [RuleBndr] -> Exp -> Exp -> Phases -> Pragma
+ Language.Haskell.TH.Instances.Internal: RuleVar :: Name -> RuleBndr
+ Language.Haskell.TH.Instances.Internal: Safe :: Safety
+ Language.Haskell.TH.Instances.Internal: ScopedTypeVariables :: Extension
+ Language.Haskell.TH.Instances.Internal: SigD :: Name -> Type -> Dec
+ Language.Haskell.TH.Instances.Internal: SigE :: Exp -> Type -> Exp
+ Language.Haskell.TH.Instances.Internal: SigP :: Pat -> Type -> Pat
+ Language.Haskell.TH.Instances.Internal: SigT :: Type -> Kind -> Type
+ Language.Haskell.TH.Instances.Internal: SourceLazy :: SourceStrictness
+ Language.Haskell.TH.Instances.Internal: SourceNoUnpack :: SourceUnpackedness
+ Language.Haskell.TH.Instances.Internal: SourceStrict :: SourceStrictness
+ Language.Haskell.TH.Instances.Internal: SourceUnpack :: SourceUnpackedness
+ Language.Haskell.TH.Instances.Internal: SpecialiseInstP :: Type -> Pragma
+ Language.Haskell.TH.Instances.Internal: SpecialiseP :: Name -> Type -> Maybe Inline -> Phases -> Pragma
+ Language.Haskell.TH.Instances.Internal: StandaloneDerivD :: Maybe DerivStrategy -> Cxt -> Type -> Dec
+ Language.Haskell.TH.Instances.Internal: StandaloneDeriving :: Extension
+ Language.Haskell.TH.Instances.Internal: StarT :: Type
+ Language.Haskell.TH.Instances.Internal: StaticE :: Exp -> Exp
+ Language.Haskell.TH.Instances.Internal: StaticPointers :: Extension
+ Language.Haskell.TH.Instances.Internal: StdCall :: Callconv
+ Language.Haskell.TH.Instances.Internal: StockStrategy :: DerivStrategy
+ Language.Haskell.TH.Instances.Internal: StrTyLit :: String -> TyLit
+ Language.Haskell.TH.Instances.Internal: Strict :: Extension
+ Language.Haskell.TH.Instances.Internal: StrictData :: Extension
+ Language.Haskell.TH.Instances.Internal: StringL :: String -> Lit
+ Language.Haskell.TH.Instances.Internal: StringPrimL :: [Word8] -> Lit
+ Language.Haskell.TH.Instances.Internal: Sum :: a -> Sum a
+ Language.Haskell.TH.Instances.Internal: TExp :: Exp -> TExp a
+ Language.Haskell.TH.Instances.Internal: TcClsName :: NameSpace
+ Language.Haskell.TH.Instances.Internal: TemplateHaskell :: Extension
+ Language.Haskell.TH.Instances.Internal: TemplateHaskellQuotes :: Extension
+ Language.Haskell.TH.Instances.Internal: TildeP :: Pat -> Pat
+ Language.Haskell.TH.Instances.Internal: TraditionalRecordSyntax :: Extension
+ Language.Haskell.TH.Instances.Internal: TransformListComp :: Extension
+ Language.Haskell.TH.Instances.Internal: TupE :: [Exp] -> Exp
+ Language.Haskell.TH.Instances.Internal: TupP :: [Pat] -> Pat
+ Language.Haskell.TH.Instances.Internal: TupleSections :: Extension
+ Language.Haskell.TH.Instances.Internal: TupleT :: Int -> Type
+ Language.Haskell.TH.Instances.Internal: TyConI :: Dec -> Info
+ Language.Haskell.TH.Instances.Internal: TySynD :: Name -> [TyVarBndr] -> Type -> Dec
+ Language.Haskell.TH.Instances.Internal: TySynEqn :: [Type] -> Type -> TySynEqn
+ Language.Haskell.TH.Instances.Internal: TySynInstD :: Name -> TySynEqn -> Dec
+ Language.Haskell.TH.Instances.Internal: TyVarI :: Name -> Type -> Info
+ Language.Haskell.TH.Instances.Internal: TyVarSig :: TyVarBndr -> FamilyResultSig
+ Language.Haskell.TH.Instances.Internal: TypeAnnotation :: Name -> AnnTarget
+ Language.Haskell.TH.Instances.Internal: TypeApplications :: Extension
+ Language.Haskell.TH.Instances.Internal: TypeFamilies :: Extension
+ Language.Haskell.TH.Instances.Internal: TypeFamilyDependencies :: Extension
+ Language.Haskell.TH.Instances.Internal: TypeFamilyHead :: Name -> [TyVarBndr] -> FamilyResultSig -> Maybe InjectivityAnn -> TypeFamilyHead
+ Language.Haskell.TH.Instances.Internal: TypeInType :: Extension
+ Language.Haskell.TH.Instances.Internal: TypeOperators :: Extension
+ Language.Haskell.TH.Instances.Internal: TypeSynonymInstances :: Extension
+ Language.Haskell.TH.Instances.Internal: TypedRuleVar :: Name -> Type -> RuleBndr
+ Language.Haskell.TH.Instances.Internal: UInfixE :: Exp -> Exp -> Exp -> Exp
+ Language.Haskell.TH.Instances.Internal: UInfixP :: Pat -> Name -> Pat -> Pat
+ Language.Haskell.TH.Instances.Internal: UInfixT :: Type -> Name -> Type -> Type
+ Language.Haskell.TH.Instances.Internal: UnboundVarE :: Name -> Exp
+ Language.Haskell.TH.Instances.Internal: UnboxedSumE :: Exp -> SumAlt -> SumArity -> Exp
+ Language.Haskell.TH.Instances.Internal: UnboxedSumP :: Pat -> SumAlt -> SumArity -> Pat
+ Language.Haskell.TH.Instances.Internal: UnboxedSumT :: SumArity -> Type
+ Language.Haskell.TH.Instances.Internal: UnboxedSums :: Extension
+ Language.Haskell.TH.Instances.Internal: UnboxedTupE :: [Exp] -> Exp
+ Language.Haskell.TH.Instances.Internal: UnboxedTupP :: [Pat] -> Pat
+ Language.Haskell.TH.Instances.Internal: UnboxedTupleT :: Int -> Type
+ Language.Haskell.TH.Instances.Internal: UnboxedTuples :: Extension
+ Language.Haskell.TH.Instances.Internal: UndecidableInstances :: Extension
+ Language.Haskell.TH.Instances.Internal: UndecidableSuperClasses :: Extension
+ Language.Haskell.TH.Instances.Internal: UnicodeSyntax :: Extension
+ Language.Haskell.TH.Instances.Internal: Unidir :: PatSynDir
+ Language.Haskell.TH.Instances.Internal: UnliftedFFITypes :: Extension
+ Language.Haskell.TH.Instances.Internal: Unsafe :: Safety
+ Language.Haskell.TH.Instances.Internal: ValD :: Pat -> Body -> [Dec] -> Dec
+ Language.Haskell.TH.Instances.Internal: ValueAnnotation :: Name -> AnnTarget
+ Language.Haskell.TH.Instances.Internal: VarE :: Name -> Exp
+ Language.Haskell.TH.Instances.Internal: VarI :: Name -> Type -> Maybe Dec -> Info
+ Language.Haskell.TH.Instances.Internal: VarName :: NameSpace
+ Language.Haskell.TH.Instances.Internal: VarP :: Name -> Pat
+ Language.Haskell.TH.Instances.Internal: VarT :: Name -> Type
+ Language.Haskell.TH.Instances.Internal: ViewP :: Exp -> Pat -> Pat
+ Language.Haskell.TH.Instances.Internal: ViewPatterns :: Extension
+ Language.Haskell.TH.Instances.Internal: WildCardT :: Type
+ Language.Haskell.TH.Instances.Internal: WildP :: Pat
+ Language.Haskell.TH.Instances.Internal: WordPrimL :: Integer -> Lit
+ Language.Haskell.TH.Instances.Internal: WriterT :: m (a, w) -> WriterT w a
+ Language.Haskell.TH.Instances.Internal: [appEndo] :: Endo a -> a -> a
+ Language.Haskell.TH.Instances.Internal: [defining] :: Defaults -> Name
+ Language.Haskell.TH.Instances.Internal: [definition] :: Defaults -> Name
+ Language.Haskell.TH.Instances.Internal: [getAll] :: All -> Bool
+ Language.Haskell.TH.Instances.Internal: [getAlt] :: Alt -> f a
+ Language.Haskell.TH.Instances.Internal: [getAny] :: Any -> Bool
+ Language.Haskell.TH.Instances.Internal: [getDual] :: Dual a -> a
+ Language.Haskell.TH.Instances.Internal: [getFirst] :: First a -> Maybe a
+ Language.Haskell.TH.Instances.Internal: [getLast] :: Last a -> Maybe a
+ Language.Haskell.TH.Instances.Internal: [getProduct] :: Product a -> a
+ Language.Haskell.TH.Instances.Internal: [getSum] :: Sum a -> a
+ Language.Haskell.TH.Instances.Internal: [loc_end] :: Loc -> CharPos
+ Language.Haskell.TH.Instances.Internal: [loc_filename] :: Loc -> String
+ Language.Haskell.TH.Instances.Internal: [loc_module] :: Loc -> String
+ Language.Haskell.TH.Instances.Internal: [loc_package] :: Loc -> String
+ Language.Haskell.TH.Instances.Internal: [loc_start] :: Loc -> CharPos
+ Language.Haskell.TH.Instances.Internal: [quoteDec] :: QuasiQuoter -> String -> Q [Dec]
+ Language.Haskell.TH.Instances.Internal: [quoteExp] :: QuasiQuoter -> String -> Q Exp
+ Language.Haskell.TH.Instances.Internal: [quotePat] :: QuasiQuoter -> String -> Q Pat
+ Language.Haskell.TH.Instances.Internal: [quoteType] :: QuasiQuoter -> String -> Q Type
+ Language.Haskell.TH.Instances.Internal: [runWriterT] :: WriterT w a -> m (a, w)
+ Language.Haskell.TH.Instances.Internal: [unQ] :: Q a -> forall (m :: * -> *). Quasi m => m a
+ Language.Haskell.TH.Instances.Internal: [unType] :: TExp a -> Exp
+ Language.Haskell.TH.Instances.Internal: addCorePlugin :: String -> Q ()
+ Language.Haskell.TH.Instances.Internal: addDependentFile :: FilePath -> Q ()
+ Language.Haskell.TH.Instances.Internal: addForeignFile :: ForeignSrcLang -> String -> Q ()
+ Language.Haskell.TH.Instances.Internal: addModFinalizer :: Q () -> Q ()
+ Language.Haskell.TH.Instances.Internal: addTopDecls :: [Dec] -> Q ()
+ Language.Haskell.TH.Instances.Internal: adjust :: Ord k => a -> a -> k -> Map k a -> Map k a
+ Language.Haskell.TH.Instances.Internal: adjustMany :: (Ord k, Foldable t) => (a -> as -> as) -> Map k as -> t (k, a) -> Map k as
+ Language.Haskell.TH.Instances.Internal: all :: Foldable t => a -> Bool -> t a -> Bool
+ Language.Haskell.TH.Instances.Internal: and :: Foldable t => t Bool -> Bool
+ Language.Haskell.TH.Instances.Internal: any :: Foldable t => a -> Bool -> t a -> Bool
+ Language.Haskell.TH.Instances.Internal: ap :: Monad m => m a -> b -> m a -> m b
+ Language.Haskell.TH.Instances.Internal: appE :: ExpQ -> ExpQ -> ExpQ
+ Language.Haskell.TH.Instances.Internal: appK :: Kind -> Kind -> Kind
+ Language.Haskell.TH.Instances.Internal: appT :: TypeQ -> TypeQ -> TypeQ
+ Language.Haskell.TH.Instances.Internal: appTypeE :: ExpQ -> TypeQ -> ExpQ
+ Language.Haskell.TH.Instances.Internal: appsE :: [ExpQ] -> ExpQ
+ Language.Haskell.TH.Instances.Internal: arithSeqE :: RangeQ -> ExpQ
+ Language.Haskell.TH.Instances.Internal: arrowK :: Kind
+ Language.Haskell.TH.Instances.Internal: arrowT :: TypeQ
+ Language.Haskell.TH.Instances.Internal: asP :: Name -> PatQ -> PatQ
+ Language.Haskell.TH.Instances.Internal: asum :: (Foldable t, Alternative f) => t f a -> f a
+ Language.Haskell.TH.Instances.Internal: badIO :: () => String -> IO a
+ Language.Haskell.TH.Instances.Internal: bang :: SourceUnpackednessQ -> SourceStrictnessQ -> BangQ
+ Language.Haskell.TH.Instances.Internal: bangP :: PatQ -> PatQ
+ Language.Haskell.TH.Instances.Internal: bangType :: BangQ -> TypeQ -> BangTypeQ
+ Language.Haskell.TH.Instances.Internal: bindQ :: () => Q a -> a -> Q b -> Q b
+ Language.Haskell.TH.Instances.Internal: bindS :: PatQ -> ExpQ -> StmtQ
+ Language.Haskell.TH.Instances.Internal: cApi :: Callconv
+ Language.Haskell.TH.Instances.Internal: cCall :: Callconv
+ Language.Haskell.TH.Instances.Internal: caseE :: ExpQ -> [MatchQ] -> ExpQ
+ Language.Haskell.TH.Instances.Internal: censor :: MonadWriter w m => w -> w -> m a -> m a
+ Language.Haskell.TH.Instances.Internal: charL :: Char -> Lit
+ Language.Haskell.TH.Instances.Internal: charPrimL :: Char -> Lit
+ Language.Haskell.TH.Instances.Internal: class Foldable (t :: * -> *)
+ Language.Haskell.TH.Instances.Internal: class Functor (f :: * -> *)
+ Language.Haskell.TH.Instances.Internal: class Lift t
+ Language.Haskell.TH.Instances.Internal: class Applicative m => Monad (m :: * -> *)
+ Language.Haskell.TH.Instances.Internal: class Monad m => MonadFix (m :: * -> *)
+ Language.Haskell.TH.Instances.Internal: class Monad m => MonadIO (m :: * -> *)
+ Language.Haskell.TH.Instances.Internal: class (Alternative m, Monad m) => MonadPlus (m :: * -> *)
+ Language.Haskell.TH.Instances.Internal: class MonadTrans (t :: * -> * -> * -> *)
+ Language.Haskell.TH.Instances.Internal: class (Monoid w, Monad m) => MonadWriter w (m :: * -> *) | m -> w
+ Language.Haskell.TH.Instances.Internal: class Semigroup a => Monoid a
+ Language.Haskell.TH.Instances.Internal: class Ppr a
+ Language.Haskell.TH.Instances.Internal: class (MonadIO m, MonadFail m) => Quasi (m :: * -> *)
+ Language.Haskell.TH.Instances.Internal: classD :: CxtQ -> Name -> [TyVarBndr] -> [FunDep] -> [DecQ] -> DecQ
+ Language.Haskell.TH.Instances.Internal: classP :: Name -> [Q Type] -> Q Pred
+ Language.Haskell.TH.Instances.Internal: clause :: [PatQ] -> BodyQ -> [DecQ] -> ClauseQ
+ Language.Haskell.TH.Instances.Internal: closedTypeFamilyD :: Name -> [TyVarBndr] -> FamilyResultSig -> Maybe InjectivityAnn -> [TySynEqnQ] -> DecQ
+ Language.Haskell.TH.Instances.Internal: cmpEq :: Ordering -> Bool
+ Language.Haskell.TH.Instances.Internal: compE :: [StmtQ] -> ExpQ
+ Language.Haskell.TH.Instances.Internal: conE :: Name -> ExpQ
+ Language.Haskell.TH.Instances.Internal: conK :: Name -> Kind
+ Language.Haskell.TH.Instances.Internal: conP :: Name -> [PatQ] -> PatQ
+ Language.Haskell.TH.Instances.Internal: conT :: Name -> TypeQ
+ Language.Haskell.TH.Instances.Internal: concat :: Foldable t => t [a] -> [a]
+ Language.Haskell.TH.Instances.Internal: concatMap :: Foldable t => a -> [b] -> t a -> [b]
+ Language.Haskell.TH.Instances.Internal: condE :: ExpQ -> ExpQ -> ExpQ -> ExpQ
+ Language.Haskell.TH.Instances.Internal: constraintK :: Kind
+ Language.Haskell.TH.Instances.Internal: counter :: IORef Int
+ Language.Haskell.TH.Instances.Internal: cxt :: [PredQ] -> CxtQ
+ Language.Haskell.TH.Instances.Internal: data AnnLookup
+ Language.Haskell.TH.Instances.Internal: data AnnTarget
+ Language.Haskell.TH.Instances.Internal: data Bang
+ Language.Haskell.TH.Instances.Internal: data Body
+ Language.Haskell.TH.Instances.Internal: data Callconv
+ Language.Haskell.TH.Instances.Internal: data Clause
+ Language.Haskell.TH.Instances.Internal: data Con
+ Language.Haskell.TH.Instances.Internal: data Dec
+ Language.Haskell.TH.Instances.Internal: data DecidedStrictness
+ Language.Haskell.TH.Instances.Internal: data Defaults
+ Language.Haskell.TH.Instances.Internal: data DerivClause
+ Language.Haskell.TH.Instances.Internal: data DerivStrategy
+ Language.Haskell.TH.Instances.Internal: data Exp
+ Language.Haskell.TH.Instances.Internal: data Extension
+ Language.Haskell.TH.Instances.Internal: data FamilyResultSig
+ Language.Haskell.TH.Instances.Internal: data Fixity
+ Language.Haskell.TH.Instances.Internal: data FixityDirection
+ Language.Haskell.TH.Instances.Internal: data Foreign
+ Language.Haskell.TH.Instances.Internal: data ForeignSrcLang
+ Language.Haskell.TH.Instances.Internal: data FunDep
+ Language.Haskell.TH.Instances.Internal: data Guard
+ Language.Haskell.TH.Instances.Internal: data Info
+ Language.Haskell.TH.Instances.Internal: data InjectivityAnn
+ Language.Haskell.TH.Instances.Internal: data Inline
+ Language.Haskell.TH.Instances.Internal: data Lit
+ Language.Haskell.TH.Instances.Internal: data Loc
+ Language.Haskell.TH.Instances.Internal: data Map k a
+ Language.Haskell.TH.Instances.Internal: data Match
+ Language.Haskell.TH.Instances.Internal: data Module
+ Language.Haskell.TH.Instances.Internal: data ModuleInfo
+ Language.Haskell.TH.Instances.Internal: data Name
+ Language.Haskell.TH.Instances.Internal: data NameFlavour
+ Language.Haskell.TH.Instances.Internal: data NameIs
+ Language.Haskell.TH.Instances.Internal: data NameSpace
+ Language.Haskell.TH.Instances.Internal: data Overlap
+ Language.Haskell.TH.Instances.Internal: data Pat
+ Language.Haskell.TH.Instances.Internal: data PatSynArgs
+ Language.Haskell.TH.Instances.Internal: data PatSynDir
+ Language.Haskell.TH.Instances.Internal: data Phases
+ Language.Haskell.TH.Instances.Internal: data Pragma
+ Language.Haskell.TH.Instances.Internal: data QuasiQuoter
+ Language.Haskell.TH.Instances.Internal: data Range
+ Language.Haskell.TH.Instances.Internal: data Role
+ Language.Haskell.TH.Instances.Internal: data RuleBndr
+ Language.Haskell.TH.Instances.Internal: data RuleMatch
+ Language.Haskell.TH.Instances.Internal: data Safety
+ Language.Haskell.TH.Instances.Internal: data SourceStrictness
+ Language.Haskell.TH.Instances.Internal: data SourceUnpackedness
+ Language.Haskell.TH.Instances.Internal: data Stmt
+ Language.Haskell.TH.Instances.Internal: data TyLit
+ Language.Haskell.TH.Instances.Internal: data TySynEqn
+ Language.Haskell.TH.Instances.Internal: data TyVarBndr
+ Language.Haskell.TH.Instances.Internal: data Type
+ Language.Haskell.TH.Instances.Internal: data TypeFamilyHead
+ Language.Haskell.TH.Instances.Internal: dataD :: CxtQ -> Name -> [TyVarBndr] -> Maybe Kind -> [ConQ] -> [DerivClauseQ] -> DecQ
+ Language.Haskell.TH.Instances.Internal: dataFamilyD :: Name -> [TyVarBndr] -> Maybe Kind -> DecQ
+ Language.Haskell.TH.Instances.Internal: dataInstD :: CxtQ -> Name -> [TypeQ] -> Maybe Kind -> [ConQ] -> [DerivClauseQ] -> DecQ
+ Language.Haskell.TH.Instances.Internal: dataToExpQ :: Data a => forall b. Data b => b -> Maybe Q Exp -> a -> Q Exp
+ Language.Haskell.TH.Instances.Internal: dataToPatQ :: Data a => forall b. Data b => b -> Maybe Q Pat -> a -> Q Pat
+ Language.Haskell.TH.Instances.Internal: dataToQa :: Data a => Name -> k -> Lit -> Q q -> k -> [Q q] -> Q q -> forall b. Data b => b -> Maybe Q q -> a -> Q q
+ Language.Haskell.TH.Instances.Internal: defaultFixity :: Fixity
+ Language.Haskell.TH.Instances.Internal: defaultSigD :: Name -> TypeQ -> DecQ
+ Language.Haskell.TH.Instances.Internal: derivClause :: Maybe DerivStrategy -> [PredQ] -> DerivClauseQ
+ Language.Haskell.TH.Instances.Internal: doE :: [StmtQ] -> ExpQ
+ Language.Haskell.TH.Instances.Internal: doublePrimL :: Rational -> Lit
+ Language.Haskell.TH.Instances.Internal: dyn :: String -> ExpQ
+ Language.Haskell.TH.Instances.Internal: elem :: (Foldable t, Eq a) => a -> t a -> Bool
+ Language.Haskell.TH.Instances.Internal: equalP :: TypeQ -> TypeQ -> PredQ
+ Language.Haskell.TH.Instances.Internal: equalityT :: TypeQ
+ Language.Haskell.TH.Instances.Internal: execWriter :: () => Writer w a -> w
+ Language.Haskell.TH.Instances.Internal: execWriterT :: Monad m => WriterT w m a -> m w
+ Language.Haskell.TH.Instances.Internal: explBidir :: [ClauseQ] -> PatSynDirQ
+ Language.Haskell.TH.Instances.Internal: extsEnabled :: Q [Extension]
+ Language.Haskell.TH.Instances.Internal: fail :: Monad m => String -> m a
+ Language.Haskell.TH.Instances.Internal: falseName :: Name
+ Language.Haskell.TH.Instances.Internal: fieldExp :: Name -> ExpQ -> Q (Name, Exp)
+ Language.Haskell.TH.Instances.Internal: fieldPat :: Name -> PatQ -> FieldPatQ
+ Language.Haskell.TH.Instances.Internal: filterM :: Applicative m => a -> m Bool -> [a] -> m [a]
+ Language.Haskell.TH.Instances.Internal: find :: Foldable t => a -> Bool -> t a -> Maybe a
+ Language.Haskell.TH.Instances.Internal: fix :: () => a -> a -> a
+ Language.Haskell.TH.Instances.Internal: floatPrimL :: Rational -> Lit
+ Language.Haskell.TH.Instances.Internal: fmap :: Functor f => a -> b -> f a -> f b
+ Language.Haskell.TH.Instances.Internal: fold :: (Foldable t, Monoid m) => t m -> m
+ Language.Haskell.TH.Instances.Internal: foldM :: (Foldable t, Monad m) => b -> a -> m b -> b -> t a -> m b
+ Language.Haskell.TH.Instances.Internal: foldM_ :: (Foldable t, Monad m) => b -> a -> m b -> b -> t a -> m ()
+ Language.Haskell.TH.Instances.Internal: foldMap :: (Foldable t, Monoid m) => a -> m -> t a -> m
+ Language.Haskell.TH.Instances.Internal: foldl :: Foldable t => b -> a -> b -> b -> t a -> b
+ Language.Haskell.TH.Instances.Internal: foldl' :: Foldable t => b -> a -> b -> b -> t a -> b
+ Language.Haskell.TH.Instances.Internal: foldl1 :: Foldable t => a -> a -> a -> t a -> a
+ Language.Haskell.TH.Instances.Internal: foldlM :: (Foldable t, Monad m) => b -> a -> m b -> b -> t a -> m b
+ Language.Haskell.TH.Instances.Internal: foldr :: Foldable t => a -> b -> b -> b -> t a -> b
+ Language.Haskell.TH.Instances.Internal: foldr' :: Foldable t => a -> b -> b -> b -> t a -> b
+ Language.Haskell.TH.Instances.Internal: foldr1 :: Foldable t => a -> a -> a -> t a -> a
+ Language.Haskell.TH.Instances.Internal: foldrM :: (Foldable t, Monad m) => a -> b -> m b -> b -> t a -> m b
+ Language.Haskell.TH.Instances.Internal: forImpD :: Callconv -> Safety -> String -> Name -> TypeQ -> DecQ
+ Language.Haskell.TH.Instances.Internal: forM :: (Traversable t, Monad m) => t a -> a -> m b -> m t b
+ Language.Haskell.TH.Instances.Internal: forM_ :: (Foldable t, Monad m) => t a -> a -> m b -> m ()
+ Language.Haskell.TH.Instances.Internal: for_ :: (Foldable t, Applicative f) => t a -> a -> f b -> f ()
+ Language.Haskell.TH.Instances.Internal: forallC :: [TyVarBndr] -> CxtQ -> ConQ -> ConQ
+ Language.Haskell.TH.Instances.Internal: forallT :: [TyVarBndr] -> CxtQ -> TypeQ -> TypeQ
+ Language.Haskell.TH.Instances.Internal: forever :: Applicative f => f a -> f b
+ Language.Haskell.TH.Instances.Internal: fromE :: ExpQ -> ExpQ
+ Language.Haskell.TH.Instances.Internal: fromKeys :: Ord k => v -> [k] -> Map k v
+ Language.Haskell.TH.Instances.Internal: fromList :: Ord k => [(k, a)] -> Map k a
+ Language.Haskell.TH.Instances.Internal: fromR :: ExpQ -> RangeQ
+ Language.Haskell.TH.Instances.Internal: fromThenE :: ExpQ -> ExpQ -> ExpQ
+ Language.Haskell.TH.Instances.Internal: fromThenR :: ExpQ -> ExpQ -> RangeQ
+ Language.Haskell.TH.Instances.Internal: fromThenToE :: ExpQ -> ExpQ -> ExpQ -> ExpQ
+ Language.Haskell.TH.Instances.Internal: fromThenToR :: ExpQ -> ExpQ -> ExpQ -> RangeQ
+ Language.Haskell.TH.Instances.Internal: fromToE :: ExpQ -> ExpQ -> ExpQ
+ Language.Haskell.TH.Instances.Internal: fromToR :: ExpQ -> ExpQ -> RangeQ
+ Language.Haskell.TH.Instances.Internal: funD :: Name -> [ClauseQ] -> DecQ
+ Language.Haskell.TH.Instances.Internal: funDep :: [Name] -> [Name] -> FunDep
+ Language.Haskell.TH.Instances.Internal: gadtC :: [Name] -> [StrictTypeQ] -> TypeQ -> ConQ
+ Language.Haskell.TH.Instances.Internal: getQ :: Typeable a => Q Maybe a
+ Language.Haskell.TH.Instances.Internal: getTransitiveSuperclassNames' :: Name -> Q (Map Name Int)
+ Language.Haskell.TH.Instances.Internal: guard :: Alternative f => Bool -> f ()
+ Language.Haskell.TH.Instances.Internal: guardedB :: [Q (Guard, Exp)] -> BodyQ
+ Language.Haskell.TH.Instances.Internal: implBidir :: PatSynDirQ
+ Language.Haskell.TH.Instances.Internal: inferR :: Role
+ Language.Haskell.TH.Instances.Internal: infix 4 `notElem`
+ Language.Haskell.TH.Instances.Internal: infixApp :: ExpQ -> ExpQ -> ExpQ -> ExpQ
+ Language.Haskell.TH.Instances.Internal: infixC :: Q (Bang, Type) -> Name -> Q (Bang, Type) -> ConQ
+ Language.Haskell.TH.Instances.Internal: infixE :: Maybe ExpQ -> ExpQ -> Maybe ExpQ -> ExpQ
+ Language.Haskell.TH.Instances.Internal: infixLD :: Int -> Name -> DecQ
+ Language.Haskell.TH.Instances.Internal: infixND :: Int -> Name -> DecQ
+ Language.Haskell.TH.Instances.Internal: infixP :: PatQ -> Name -> PatQ -> PatQ
+ Language.Haskell.TH.Instances.Internal: infixPatSyn :: Name -> Name -> PatSynArgsQ
+ Language.Haskell.TH.Instances.Internal: infixRD :: Int -> Name -> DecQ
+ Language.Haskell.TH.Instances.Internal: infixT :: TypeQ -> Name -> TypeQ -> TypeQ
+ Language.Haskell.TH.Instances.Internal: infixl 4 <$!>
+ Language.Haskell.TH.Instances.Internal: infixr 1 =<<
+ Language.Haskell.TH.Instances.Internal: infixr 6 <>
+ Language.Haskell.TH.Instances.Internal: injectivityAnn :: Name -> [Name] -> InjectivityAnn
+ Language.Haskell.TH.Instances.Internal: insert :: Ord k => k -> a -> Map k a -> Map k a
+ Language.Haskell.TH.Instances.Internal: instanceD :: CxtQ -> TypeQ -> [DecQ] -> DecQ
+ Language.Haskell.TH.Instances.Internal: instanceWithOverlapD :: Maybe Overlap -> CxtQ -> TypeQ -> [DecQ] -> DecQ
+ Language.Haskell.TH.Instances.Internal: intPrimL :: Integer -> Lit
+ Language.Haskell.TH.Instances.Internal: integerL :: Integer -> Lit
+ Language.Haskell.TH.Instances.Internal: interruptible :: Safety
+ Language.Haskell.TH.Instances.Internal: isExtEnabled :: Extension -> Q Bool
+ Language.Haskell.TH.Instances.Internal: isInstance :: Name -> [Type] -> Q Bool
+ Language.Haskell.TH.Instances.Internal: isStrict :: Q Strict
+ Language.Haskell.TH.Instances.Internal: javaScript :: Callconv
+ Language.Haskell.TH.Instances.Internal: join :: Monad m => m m a -> m a
+ Language.Haskell.TH.Instances.Internal: justName :: Name
+ Language.Haskell.TH.Instances.Internal: kindSig :: Kind -> FamilyResultSig
+ Language.Haskell.TH.Instances.Internal: kindedTV :: Name -> Kind -> TyVarBndr
+ Language.Haskell.TH.Instances.Internal: labelE :: String -> ExpQ
+ Language.Haskell.TH.Instances.Internal: lam1E :: PatQ -> ExpQ -> ExpQ
+ Language.Haskell.TH.Instances.Internal: lamCaseE :: [MatchQ] -> ExpQ
+ Language.Haskell.TH.Instances.Internal: lamE :: [PatQ] -> ExpQ -> ExpQ
+ Language.Haskell.TH.Instances.Internal: leftName :: Name
+ Language.Haskell.TH.Instances.Internal: length :: Foldable t => t a -> Int
+ Language.Haskell.TH.Instances.Internal: letE :: [DecQ] -> ExpQ -> ExpQ
+ Language.Haskell.TH.Instances.Internal: letS :: [DecQ] -> StmtQ
+ Language.Haskell.TH.Instances.Internal: lift :: (MonadTrans t, Monad m) => m a -> t m a
+ Language.Haskell.TH.Instances.Internal: liftData :: Data a => a -> Q Exp
+ Language.Haskell.TH.Instances.Internal: liftIO :: MonadIO m => IO a -> m a
+ Language.Haskell.TH.Instances.Internal: liftM :: Monad m => a1 -> r -> m a1 -> m r
+ Language.Haskell.TH.Instances.Internal: liftM2 :: Monad m => a1 -> a2 -> r -> m a1 -> m a2 -> m r
+ Language.Haskell.TH.Instances.Internal: liftM3 :: Monad m => a1 -> a2 -> a3 -> r -> m a1 -> m a2 -> m a3 -> m r
+ Language.Haskell.TH.Instances.Internal: liftM4 :: Monad m => a1 -> a2 -> a3 -> a4 -> r -> m a1 -> m a2 -> m a3 -> m a4 -> m r
+ Language.Haskell.TH.Instances.Internal: liftM5 :: Monad m => a1 -> a2 -> a3 -> a4 -> a5 -> r -> m a1 -> m a2 -> m a3 -> m a4 -> m a5 -> m r
+ Language.Haskell.TH.Instances.Internal: liftString :: String -> Q Exp
+ Language.Haskell.TH.Instances.Internal: listE :: [ExpQ] -> ExpQ
+ Language.Haskell.TH.Instances.Internal: listK :: Kind
+ Language.Haskell.TH.Instances.Internal: listP :: [PatQ] -> PatQ
+ Language.Haskell.TH.Instances.Internal: listT :: TypeQ
+ Language.Haskell.TH.Instances.Internal: listen :: MonadWriter w m => m a -> m (a, w)
+ Language.Haskell.TH.Instances.Internal: listens :: MonadWriter w m => w -> b -> m a -> m (a, b)
+ Language.Haskell.TH.Instances.Internal: litE :: Lit -> ExpQ
+ Language.Haskell.TH.Instances.Internal: litP :: Lit -> PatQ
+ Language.Haskell.TH.Instances.Internal: litT :: TyLitQ -> TypeQ
+ Language.Haskell.TH.Instances.Internal: location :: Q Loc
+ Language.Haskell.TH.Instances.Internal: lookup :: Ord k => k -> Map k a -> Maybe a
+ Language.Haskell.TH.Instances.Internal: lookupName :: Bool -> String -> Q Maybe Name
+ Language.Haskell.TH.Instances.Internal: lookupTypeName :: String -> Q Maybe Name
+ Language.Haskell.TH.Instances.Internal: lookupValueName :: String -> Q Maybe Name
+ Language.Haskell.TH.Instances.Internal: mapAndUnzipM :: Applicative m => a -> m (b, c) -> [a] -> m ([b], [c])
+ Language.Haskell.TH.Instances.Internal: mapLookup :: Ord k => k -> Map k v -> Maybe v
+ Language.Haskell.TH.Instances.Internal: mapM :: (Traversable t, Monad m) => a -> m b -> t a -> m t b
+ Language.Haskell.TH.Instances.Internal: mapM_ :: (Foldable t, Monad m) => a -> m b -> t a -> m ()
+ Language.Haskell.TH.Instances.Internal: mapMaybe :: () => a -> Maybe b -> [a] -> [b]
+ Language.Haskell.TH.Instances.Internal: mapWriter :: () => (a, w) -> (b, w') -> Writer w a -> Writer w' b
+ Language.Haskell.TH.Instances.Internal: mapWriterT :: () => m (a, w) -> n (b, w') -> WriterT w m a -> WriterT w' n b
+ Language.Haskell.TH.Instances.Internal: mappend :: Monoid a => a -> a -> a
+ Language.Haskell.TH.Instances.Internal: match :: PatQ -> BodyQ -> [DecQ] -> MatchQ
+ Language.Haskell.TH.Instances.Internal: maxPrecedence :: Int
+ Language.Haskell.TH.Instances.Internal: maximum :: (Foldable t, Ord a) => t a -> a
+ Language.Haskell.TH.Instances.Internal: maximumBy :: Foldable t => a -> a -> Ordering -> t a -> a
+ Language.Haskell.TH.Instances.Internal: mconcat :: Monoid a => [a] -> a
+ Language.Haskell.TH.Instances.Internal: mempty :: Monoid a => a
+ Language.Haskell.TH.Instances.Internal: mfilter :: MonadPlus m => a -> Bool -> m a -> m a
+ Language.Haskell.TH.Instances.Internal: mfix :: MonadFix m => a -> m a -> m a
+ Language.Haskell.TH.Instances.Internal: minimum :: (Foldable t, Ord a) => t a -> a
+ Language.Haskell.TH.Instances.Internal: minimumBy :: Foldable t => a -> a -> Ordering -> t a -> a
+ Language.Haskell.TH.Instances.Internal: mkModName :: String -> ModName
+ Language.Haskell.TH.Instances.Internal: mkName :: String -> Name
+ Language.Haskell.TH.Instances.Internal: mkNameG :: NameSpace -> String -> String -> String -> Name
+ Language.Haskell.TH.Instances.Internal: mkNameG_d :: String -> String -> String -> Name
+ Language.Haskell.TH.Instances.Internal: mkNameG_tc :: String -> String -> String -> Name
+ Language.Haskell.TH.Instances.Internal: mkNameG_v :: String -> String -> String -> Name
+ Language.Haskell.TH.Instances.Internal: mkNameL :: String -> Uniq -> Name
+ Language.Haskell.TH.Instances.Internal: mkNameS :: String -> Name
+ Language.Haskell.TH.Instances.Internal: mkNameU :: String -> Uniq -> Name
+ Language.Haskell.TH.Instances.Internal: mkOccName :: String -> OccName
+ Language.Haskell.TH.Instances.Internal: mkPkgName :: String -> PkgName
+ Language.Haskell.TH.Instances.Internal: mk_tup_name :: Int -> NameSpace -> Name
+ Language.Haskell.TH.Instances.Internal: mk_unboxed_tup_name :: Int -> NameSpace -> Name
+ Language.Haskell.TH.Instances.Internal: modString :: ModName -> String
+ Language.Haskell.TH.Instances.Internal: moduleAnnotation :: AnnTarget
+ Language.Haskell.TH.Instances.Internal: mplus :: MonadPlus m => m a -> m a -> m a
+ Language.Haskell.TH.Instances.Internal: msum :: (Foldable t, MonadPlus m) => t m a -> m a
+ Language.Haskell.TH.Instances.Internal: multiIfE :: [Q (Guard, Exp)] -> ExpQ
+ Language.Haskell.TH.Instances.Internal: mzero :: MonadPlus m => m a
+ Language.Haskell.TH.Instances.Internal: nameBase :: Name -> String
+ Language.Haskell.TH.Instances.Internal: nameModule :: Name -> Maybe String
+ Language.Haskell.TH.Instances.Internal: namePackage :: Name -> Maybe String
+ Language.Haskell.TH.Instances.Internal: nameSpace :: Name -> Maybe NameSpace
+ Language.Haskell.TH.Instances.Internal: newName :: String -> Q Name
+ Language.Haskell.TH.Instances.Internal: newtype All
+ Language.Haskell.TH.Instances.Internal: newtype Any
+ Language.Haskell.TH.Instances.Internal: newtype Dual a
+ Language.Haskell.TH.Instances.Internal: newtype Endo a
+ Language.Haskell.TH.Instances.Internal: newtype First a
+ Language.Haskell.TH.Instances.Internal: newtype Last a
+ Language.Haskell.TH.Instances.Internal: newtype ModName
+ Language.Haskell.TH.Instances.Internal: newtype OccName
+ Language.Haskell.TH.Instances.Internal: newtype PkgName
+ Language.Haskell.TH.Instances.Internal: newtype Product a
+ Language.Haskell.TH.Instances.Internal: newtype Q a
+ Language.Haskell.TH.Instances.Internal: newtype Sum a
+ Language.Haskell.TH.Instances.Internal: newtype TExp a
+ Language.Haskell.TH.Instances.Internal: newtype WriterT w (m :: * -> *) a
+ Language.Haskell.TH.Instances.Internal: newtype Alt (f :: k -> *) (a :: k) :: forall k. () => k -> * -> k -> *
+ Language.Haskell.TH.Instances.Internal: newtypeD :: CxtQ -> Name -> [TyVarBndr] -> Maybe Kind -> ConQ -> [DerivClauseQ] -> DecQ
+ Language.Haskell.TH.Instances.Internal: newtypeInstD :: CxtQ -> Name -> [TypeQ] -> Maybe Kind -> ConQ -> [DerivClauseQ] -> DecQ
+ Language.Haskell.TH.Instances.Internal: noBindS :: ExpQ -> StmtQ
+ Language.Haskell.TH.Instances.Internal: noSig :: FamilyResultSig
+ Language.Haskell.TH.Instances.Internal: noSourceStrictness :: SourceStrictnessQ
+ Language.Haskell.TH.Instances.Internal: noSourceUnpackedness :: SourceUnpackednessQ
+ Language.Haskell.TH.Instances.Internal: nominalR :: Role
+ Language.Haskell.TH.Instances.Internal: normalB :: ExpQ -> BodyQ
+ Language.Haskell.TH.Instances.Internal: normalC :: Name -> [BangTypeQ] -> ConQ
+ Language.Haskell.TH.Instances.Internal: normalG :: ExpQ -> GuardQ
+ Language.Haskell.TH.Instances.Internal: normalGE :: ExpQ -> ExpQ -> Q (Guard, Exp)
+ Language.Haskell.TH.Instances.Internal: notElem :: (Foldable t, Eq a) => a -> t a -> Bool
+ Language.Haskell.TH.Instances.Internal: notStrict :: Q Strict
+ Language.Haskell.TH.Instances.Internal: nothingName :: Name
+ Language.Haskell.TH.Instances.Internal: null :: Foldable t => t a -> Bool
+ Language.Haskell.TH.Instances.Internal: numTyLit :: Integer -> TyLitQ
+ Language.Haskell.TH.Instances.Internal: occString :: OccName -> String
+ Language.Haskell.TH.Instances.Internal: openTypeFamilyD :: Name -> [TyVarBndr] -> FamilyResultSig -> Maybe InjectivityAnn -> DecQ
+ Language.Haskell.TH.Instances.Internal: or :: Foldable t => t Bool -> Bool
+ Language.Haskell.TH.Instances.Internal: parS :: [[StmtQ]] -> StmtQ
+ Language.Haskell.TH.Instances.Internal: parensE :: ExpQ -> ExpQ
+ Language.Haskell.TH.Instances.Internal: parensP :: PatQ -> PatQ
+ Language.Haskell.TH.Instances.Internal: parensT :: TypeQ -> TypeQ
+ Language.Haskell.TH.Instances.Internal: parseDecs :: String -> Either String [Dec]
+ Language.Haskell.TH.Instances.Internal: pass :: MonadWriter w m => m (a, w -> w) -> m a
+ Language.Haskell.TH.Instances.Internal: patG :: [StmtQ] -> GuardQ
+ Language.Haskell.TH.Instances.Internal: patGE :: [StmtQ] -> ExpQ -> Q (Guard, Exp)
+ Language.Haskell.TH.Instances.Internal: patSynD :: Name -> PatSynArgsQ -> PatSynDirQ -> PatQ -> DecQ
+ Language.Haskell.TH.Instances.Internal: patSynSigD :: Name -> TypeQ -> DecQ
+ Language.Haskell.TH.Instances.Internal: phantomR :: Role
+ Language.Haskell.TH.Instances.Internal: pkgString :: PkgName -> String
+ Language.Haskell.TH.Instances.Internal: plainTV :: Name -> TyVarBndr
+ Language.Haskell.TH.Instances.Internal: ppr :: Ppr a => a -> Doc
+ Language.Haskell.TH.Instances.Internal: pprExp :: Precedence -> Exp -> Doc
+ Language.Haskell.TH.Instances.Internal: pprLit :: Precedence -> Lit -> Doc
+ Language.Haskell.TH.Instances.Internal: pprParendType :: Type -> Doc
+ Language.Haskell.TH.Instances.Internal: pprPat :: Precedence -> Pat -> Doc
+ Language.Haskell.TH.Instances.Internal: ppr_list :: Ppr a => [a] -> Doc
+ Language.Haskell.TH.Instances.Internal: pprint :: Ppr a => a -> String
+ Language.Haskell.TH.Instances.Internal: pragAnnD :: AnnTarget -> ExpQ -> DecQ
+ Language.Haskell.TH.Instances.Internal: pragCompleteD :: [Name] -> Maybe Name -> DecQ
+ Language.Haskell.TH.Instances.Internal: pragInlD :: Name -> Inline -> RuleMatch -> Phases -> DecQ
+ Language.Haskell.TH.Instances.Internal: pragLineD :: Int -> String -> DecQ
+ Language.Haskell.TH.Instances.Internal: pragRuleD :: String -> [RuleBndrQ] -> ExpQ -> ExpQ -> Phases -> DecQ
+ Language.Haskell.TH.Instances.Internal: pragSpecD :: Name -> TypeQ -> Phases -> DecQ
+ Language.Haskell.TH.Instances.Internal: pragSpecInlD :: Name -> TypeQ -> Inline -> Phases -> DecQ
+ Language.Haskell.TH.Instances.Internal: pragSpecInstD :: TypeQ -> DecQ
+ Language.Haskell.TH.Instances.Internal: prefixPatSyn :: [Name] -> PatSynArgsQ
+ Language.Haskell.TH.Instances.Internal: prim :: Callconv
+ Language.Haskell.TH.Instances.Internal: product :: (Foldable t, Num a) => t a -> a
+ Language.Haskell.TH.Instances.Internal: promotedConsT :: TypeQ
+ Language.Haskell.TH.Instances.Internal: promotedNilT :: TypeQ
+ Language.Haskell.TH.Instances.Internal: promotedT :: Name -> TypeQ
+ Language.Haskell.TH.Instances.Internal: promotedTupleT :: Int -> TypeQ
+ Language.Haskell.TH.Instances.Internal: providedDefaults :: Name -> Q (Map Name Name)
+ Language.Haskell.TH.Instances.Internal: putQ :: Typeable a => a -> Q ()
+ Language.Haskell.TH.Instances.Internal: qAddCorePlugin :: Quasi m => String -> m ()
+ Language.Haskell.TH.Instances.Internal: qAddDependentFile :: Quasi m => FilePath -> m ()
+ Language.Haskell.TH.Instances.Internal: qAddForeignFile :: Quasi m => ForeignSrcLang -> String -> m ()
+ Language.Haskell.TH.Instances.Internal: qAddModFinalizer :: Quasi m => Q () -> m ()
+ Language.Haskell.TH.Instances.Internal: qAddTopDecls :: Quasi m => [Dec] -> m ()
+ Language.Haskell.TH.Instances.Internal: qExtsEnabled :: Quasi m => m [Extension]
+ Language.Haskell.TH.Instances.Internal: qGetQ :: (Quasi m, Typeable a) => m Maybe a
+ Language.Haskell.TH.Instances.Internal: qIsExtEnabled :: Quasi m => Extension -> m Bool
+ Language.Haskell.TH.Instances.Internal: qLocation :: Quasi m => m Loc
+ Language.Haskell.TH.Instances.Internal: qLookupName :: Quasi m => Bool -> String -> m Maybe Name
+ Language.Haskell.TH.Instances.Internal: qNewName :: Quasi m => String -> m Name
+ Language.Haskell.TH.Instances.Internal: qPutQ :: (Quasi m, Typeable a) => a -> m ()
+ Language.Haskell.TH.Instances.Internal: qRecover :: Quasi m => m a -> m a -> m a
+ Language.Haskell.TH.Instances.Internal: qReify :: Quasi m => Name -> m Info
+ Language.Haskell.TH.Instances.Internal: qReifyAnnotations :: (Quasi m, Data a) => AnnLookup -> m [a]
+ Language.Haskell.TH.Instances.Internal: qReifyConStrictness :: Quasi m => Name -> m [DecidedStrictness]
+ Language.Haskell.TH.Instances.Internal: qReifyFixity :: Quasi m => Name -> m Maybe Fixity
+ Language.Haskell.TH.Instances.Internal: qReifyInstances :: Quasi m => Name -> [Type] -> m [Dec]
+ Language.Haskell.TH.Instances.Internal: qReifyModule :: Quasi m => Module -> m ModuleInfo
+ Language.Haskell.TH.Instances.Internal: qReifyRoles :: Quasi m => Name -> m [Role]
+ Language.Haskell.TH.Instances.Internal: qReport :: Quasi m => Bool -> String -> m ()
+ Language.Haskell.TH.Instances.Internal: qRunIO :: Quasi m => IO a -> m a
+ Language.Haskell.TH.Instances.Internal: rationalL :: Rational -> Lit
+ Language.Haskell.TH.Instances.Internal: recC :: Name -> [VarBangTypeQ] -> ConQ
+ Language.Haskell.TH.Instances.Internal: recConE :: Name -> [Q (Name, Exp)] -> ExpQ
+ Language.Haskell.TH.Instances.Internal: recGadtC :: [Name] -> [VarStrictTypeQ] -> TypeQ -> ConQ
+ Language.Haskell.TH.Instances.Internal: recP :: Name -> [FieldPatQ] -> PatQ
+ Language.Haskell.TH.Instances.Internal: recUpdE :: ExpQ -> [Q (Name, Exp)] -> ExpQ
+ Language.Haskell.TH.Instances.Internal: recordPatSyn :: [Name] -> PatSynArgsQ
+ Language.Haskell.TH.Instances.Internal: recover :: () => Q a -> Q a -> Q a
+ Language.Haskell.TH.Instances.Internal: reify :: Name -> Q Info
+ Language.Haskell.TH.Instances.Internal: reifyAnnotations :: Data a => AnnLookup -> Q [a]
+ Language.Haskell.TH.Instances.Internal: reifyConStrictness :: Name -> Q [DecidedStrictness]
+ Language.Haskell.TH.Instances.Internal: reifyFixity :: Name -> Q Maybe Fixity
+ Language.Haskell.TH.Instances.Internal: reifyInstances :: Name -> [Type] -> Q [InstanceDec]
+ Language.Haskell.TH.Instances.Internal: reifyModule :: Module -> Q ModuleInfo
+ Language.Haskell.TH.Instances.Internal: reifyRoles :: Name -> Q [Role]
+ Language.Haskell.TH.Instances.Internal: replicateM :: Applicative m => Int -> m a -> m [a]
+ Language.Haskell.TH.Instances.Internal: replicateM_ :: Applicative m => Int -> m a -> m ()
+ Language.Haskell.TH.Instances.Internal: report :: Bool -> String -> Q ()
+ Language.Haskell.TH.Instances.Internal: reportError :: String -> Q ()
+ Language.Haskell.TH.Instances.Internal: reportWarning :: String -> Q ()
+ Language.Haskell.TH.Instances.Internal: representationalR :: Role
+ Language.Haskell.TH.Instances.Internal: return :: Monad m => a -> m a
+ Language.Haskell.TH.Instances.Internal: returnQ :: () => a -> Q a
+ Language.Haskell.TH.Instances.Internal: rightName :: Name
+ Language.Haskell.TH.Instances.Internal: roleAnnotD :: Name -> [Role] -> DecQ
+ Language.Haskell.TH.Instances.Internal: ruleVar :: Name -> RuleBndrQ
+ Language.Haskell.TH.Instances.Internal: runIO :: () => IO a -> Q a
+ Language.Haskell.TH.Instances.Internal: runQ :: Quasi m => Q a -> m a
+ Language.Haskell.TH.Instances.Internal: runWriter :: () => Writer w a -> (a, w)
+ Language.Haskell.TH.Instances.Internal: safe :: Safety
+ Language.Haskell.TH.Instances.Internal: sectionL :: ExpQ -> ExpQ -> ExpQ
+ Language.Haskell.TH.Instances.Internal: sectionR :: ExpQ -> ExpQ -> ExpQ
+ Language.Haskell.TH.Instances.Internal: sequence :: (Traversable t, Monad m) => t m a -> m t a
+ Language.Haskell.TH.Instances.Internal: sequenceA_ :: (Foldable t, Applicative f) => t f a -> f ()
+ Language.Haskell.TH.Instances.Internal: sequenceQ :: () => [Q a] -> Q [a]
+ Language.Haskell.TH.Instances.Internal: sequence_ :: (Foldable t, Monad m) => t m a -> m ()
+ Language.Haskell.TH.Instances.Internal: showName :: Name -> String
+ Language.Haskell.TH.Instances.Internal: showName' :: NameIs -> Name -> String
+ Language.Haskell.TH.Instances.Internal: sigD :: Name -> TypeQ -> DecQ
+ Language.Haskell.TH.Instances.Internal: sigE :: ExpQ -> TypeQ -> ExpQ
+ Language.Haskell.TH.Instances.Internal: sigP :: PatQ -> TypeQ -> PatQ
+ Language.Haskell.TH.Instances.Internal: sigT :: TypeQ -> Kind -> TypeQ
+ Language.Haskell.TH.Instances.Internal: sourceLazy :: SourceStrictnessQ
+ Language.Haskell.TH.Instances.Internal: sourceNoUnpack :: SourceUnpackednessQ
+ Language.Haskell.TH.Instances.Internal: sourceStrict :: SourceStrictnessQ
+ Language.Haskell.TH.Instances.Internal: sourceUnpack :: SourceUnpackednessQ
+ Language.Haskell.TH.Instances.Internal: standaloneDerivD :: CxtQ -> TypeQ -> DecQ
+ Language.Haskell.TH.Instances.Internal: standaloneDerivWithStrategyD :: Maybe DerivStrategy -> CxtQ -> TypeQ -> DecQ
+ Language.Haskell.TH.Instances.Internal: starK :: Kind
+ Language.Haskell.TH.Instances.Internal: staticE :: ExpQ -> ExpQ
+ Language.Haskell.TH.Instances.Internal: stdCall :: Callconv
+ Language.Haskell.TH.Instances.Internal: strTyLit :: String -> TyLitQ
+ Language.Haskell.TH.Instances.Internal: strictType :: Q Strict -> TypeQ -> StrictTypeQ
+ Language.Haskell.TH.Instances.Internal: stringE :: String -> ExpQ
+ Language.Haskell.TH.Instances.Internal: stringL :: String -> Lit
+ Language.Haskell.TH.Instances.Internal: stringPrimL :: [Word8] -> Lit
+ Language.Haskell.TH.Instances.Internal: sum :: (Foldable t, Num a) => t a -> a
+ Language.Haskell.TH.Instances.Internal: tell :: MonadWriter w m => w -> m ()
+ Language.Haskell.TH.Instances.Internal: thenCmp :: Ordering -> Ordering -> Ordering
+ Language.Haskell.TH.Instances.Internal: thisModule :: Q Module
+ Language.Haskell.TH.Instances.Internal: tildeP :: PatQ -> PatQ
+ Language.Haskell.TH.Instances.Internal: toList :: Foldable t => t a -> [a]
+ Language.Haskell.TH.Instances.Internal: transitiveProvidedDefaults :: Name -> Q (Map Name Dec)
+ Language.Haskell.TH.Instances.Internal: traverseWithKey :: Applicative t => k -> a -> t b -> Map k a -> t Map k b
+ Language.Haskell.TH.Instances.Internal: traverse_ :: (Foldable t, Applicative f) => a -> f b -> t a -> f ()
+ Language.Haskell.TH.Instances.Internal: trueName :: Name
+ Language.Haskell.TH.Instances.Internal: tupE :: [ExpQ] -> ExpQ
+ Language.Haskell.TH.Instances.Internal: tupP :: [PatQ] -> PatQ
+ Language.Haskell.TH.Instances.Internal: tupleDataName :: Int -> Name
+ Language.Haskell.TH.Instances.Internal: tupleK :: Int -> Kind
+ Language.Haskell.TH.Instances.Internal: tupleT :: Int -> TypeQ
+ Language.Haskell.TH.Instances.Internal: tupleTypeName :: Int -> Name
+ Language.Haskell.TH.Instances.Internal: tySynD :: Name -> [TyVarBndr] -> TypeQ -> DecQ
+ Language.Haskell.TH.Instances.Internal: tySynEqn :: [TypeQ] -> TypeQ -> TySynEqnQ
+ Language.Haskell.TH.Instances.Internal: tySynInstD :: Name -> TySynEqnQ -> DecQ
+ Language.Haskell.TH.Instances.Internal: tyVarSig :: TyVarBndr -> FamilyResultSig
+ Language.Haskell.TH.Instances.Internal: type Arity = Int
+ Language.Haskell.TH.Instances.Internal: type BangQ = Q Bang
+ Language.Haskell.TH.Instances.Internal: type BangType = (Bang, Type)
+ Language.Haskell.TH.Instances.Internal: type BangTypeQ = Q BangType
+ Language.Haskell.TH.Instances.Internal: type BodyQ = Q Body
+ Language.Haskell.TH.Instances.Internal: type CharPos = (Int, Int)
+ Language.Haskell.TH.Instances.Internal: type ClauseQ = Q Clause
+ Language.Haskell.TH.Instances.Internal: type ConQ = Q Con
+ Language.Haskell.TH.Instances.Internal: type Cxt = [Pred]
+ Language.Haskell.TH.Instances.Internal: type CxtQ = Q Cxt
+ Language.Haskell.TH.Instances.Internal: type DecQ = Q Dec
+ Language.Haskell.TH.Instances.Internal: type DecsQ = Q [Dec]
+ Language.Haskell.TH.Instances.Internal: type DerivClauseQ = Q DerivClause
+ Language.Haskell.TH.Instances.Internal: type ExpQ = Q Exp
+ Language.Haskell.TH.Instances.Internal: type FamilyResultSigQ = Q FamilyResultSig
+ Language.Haskell.TH.Instances.Internal: type FieldExp = (Name, Exp)
+ Language.Haskell.TH.Instances.Internal: type FieldExpQ = Q FieldExp
+ Language.Haskell.TH.Instances.Internal: type FieldPat = (Name, Pat)
+ Language.Haskell.TH.Instances.Internal: type FieldPatQ = Q FieldPat
+ Language.Haskell.TH.Instances.Internal: type GuardQ = Q Guard
+ Language.Haskell.TH.Instances.Internal: type InfoQ = Q Info
+ Language.Haskell.TH.Instances.Internal: type InstanceDec = Dec
+ Language.Haskell.TH.Instances.Internal: type Kind = Type
+ Language.Haskell.TH.Instances.Internal: type KindQ = Q Kind
+ Language.Haskell.TH.Instances.Internal: type MatchQ = Q Match
+ Language.Haskell.TH.Instances.Internal: type ParentName = Name
+ Language.Haskell.TH.Instances.Internal: type PatQ = Q Pat
+ Language.Haskell.TH.Instances.Internal: type PatSynArgsQ = Q PatSynArgs
+ Language.Haskell.TH.Instances.Internal: type PatSynDirQ = Q PatSynDir
+ Language.Haskell.TH.Instances.Internal: type PatSynType = Type
+ Language.Haskell.TH.Instances.Internal: type Pred = Type
+ Language.Haskell.TH.Instances.Internal: type PredQ = Q Pred
+ Language.Haskell.TH.Instances.Internal: type RangeQ = Q Range
+ Language.Haskell.TH.Instances.Internal: type RuleBndrQ = Q RuleBndr
+ Language.Haskell.TH.Instances.Internal: type Set k = Map k ()
+ Language.Haskell.TH.Instances.Internal: type SourceStrictnessQ = Q SourceStrictness
+ Language.Haskell.TH.Instances.Internal: type SourceUnpackednessQ = Q SourceUnpackedness
+ Language.Haskell.TH.Instances.Internal: type StmtQ = Q Stmt
+ Language.Haskell.TH.Instances.Internal: type Strict = Bang
+ Language.Haskell.TH.Instances.Internal: type StrictType = BangType
+ Language.Haskell.TH.Instances.Internal: type StrictTypeQ = Q StrictType
+ Language.Haskell.TH.Instances.Internal: type SumAlt = Int
+ Language.Haskell.TH.Instances.Internal: type SumArity = Int
+ Language.Haskell.TH.Instances.Internal: type TExpQ a = Q TExp a
+ Language.Haskell.TH.Instances.Internal: type TyLitQ = Q TyLit
+ Language.Haskell.TH.Instances.Internal: type TySynEqnQ = Q TySynEqn
+ Language.Haskell.TH.Instances.Internal: type TyVarBndrQ = Q TyVarBndr
+ Language.Haskell.TH.Instances.Internal: type TypeQ = Q Type
+ Language.Haskell.TH.Instances.Internal: type Uniq = Int
+ Language.Haskell.TH.Instances.Internal: type Unlifted = Bool
+ Language.Haskell.TH.Instances.Internal: type VarBangType = (Name, Bang, Type)
+ Language.Haskell.TH.Instances.Internal: type VarBangTypeQ = Q VarBangType
+ Language.Haskell.TH.Instances.Internal: type VarStrictType = VarBangType
+ Language.Haskell.TH.Instances.Internal: type VarStrictTypeQ = Q VarStrictType
+ Language.Haskell.TH.Instances.Internal: type Writer w = WriterT w Identity
+ Language.Haskell.TH.Instances.Internal: typeAnnotation :: Name -> AnnTarget
+ Language.Haskell.TH.Instances.Internal: typedRuleVar :: Name -> TypeQ -> RuleBndrQ
+ Language.Haskell.TH.Instances.Internal: uInfixE :: ExpQ -> ExpQ -> ExpQ -> ExpQ
+ Language.Haskell.TH.Instances.Internal: uInfixP :: PatQ -> Name -> PatQ -> PatQ
+ Language.Haskell.TH.Instances.Internal: uInfixT :: TypeQ -> Name -> TypeQ -> TypeQ
+ Language.Haskell.TH.Instances.Internal: unTypeQ :: () => Q TExp a -> Q Exp
+ Language.Haskell.TH.Instances.Internal: unboundVarE :: Name -> ExpQ
+ Language.Haskell.TH.Instances.Internal: unboxedSumDataName :: SumAlt -> SumArity -> Name
+ Language.Haskell.TH.Instances.Internal: unboxedSumE :: ExpQ -> SumAlt -> SumArity -> ExpQ
+ Language.Haskell.TH.Instances.Internal: unboxedSumP :: PatQ -> SumAlt -> SumArity -> PatQ
+ Language.Haskell.TH.Instances.Internal: unboxedSumT :: SumArity -> TypeQ
+ Language.Haskell.TH.Instances.Internal: unboxedSumTypeName :: SumArity -> Name
+ Language.Haskell.TH.Instances.Internal: unboxedTupE :: [ExpQ] -> ExpQ
+ Language.Haskell.TH.Instances.Internal: unboxedTupP :: [PatQ] -> PatQ
+ Language.Haskell.TH.Instances.Internal: unboxedTupleDataName :: Int -> Name
+ Language.Haskell.TH.Instances.Internal: unboxedTupleT :: Int -> TypeQ
+ Language.Haskell.TH.Instances.Internal: unboxedTupleTypeName :: Int -> Name
+ Language.Haskell.TH.Instances.Internal: unidir :: PatSynDirQ
+ Language.Haskell.TH.Instances.Internal: unless :: Applicative f => Bool -> f () -> f ()
+ Language.Haskell.TH.Instances.Internal: unpacked :: Q Strict
+ Language.Haskell.TH.Instances.Internal: unsafe :: Safety
+ Language.Haskell.TH.Instances.Internal: unsafeTExpCoerce :: () => Q Exp -> Q TExp a
+ Language.Haskell.TH.Instances.Internal: valD :: PatQ -> BodyQ -> [DecQ] -> DecQ
+ Language.Haskell.TH.Instances.Internal: valueAnnotation :: Name -> AnnTarget
+ Language.Haskell.TH.Instances.Internal: varBangType :: Name -> BangTypeQ -> VarBangTypeQ
+ Language.Haskell.TH.Instances.Internal: varE :: Name -> ExpQ
+ Language.Haskell.TH.Instances.Internal: varK :: Name -> Kind
+ Language.Haskell.TH.Instances.Internal: varP :: Name -> PatQ
+ Language.Haskell.TH.Instances.Internal: varStrictType :: Name -> StrictTypeQ -> VarStrictTypeQ
+ Language.Haskell.TH.Instances.Internal: varT :: Name -> TypeQ
+ Language.Haskell.TH.Instances.Internal: viewP :: ExpQ -> PatQ -> PatQ
+ Language.Haskell.TH.Instances.Internal: void :: Functor f => f a -> f ()
+ Language.Haskell.TH.Instances.Internal: when :: Applicative f => Bool -> f () -> f ()
+ Language.Haskell.TH.Instances.Internal: wildCardT :: TypeQ
+ Language.Haskell.TH.Instances.Internal: wildP :: PatQ
+ Language.Haskell.TH.Instances.Internal: wordPrimL :: Integer -> Lit
+ Language.Haskell.TH.Instances.Internal: writer :: MonadWriter w m => (a, w) -> m a
+ Language.Haskell.TH.Instances.Internal: zipWithM :: Applicative m => a -> b -> m c -> [a] -> [b] -> m [c]
+ Language.Haskell.TH.Instances.Internal: zipWithM_ :: Applicative m => a -> b -> m c -> [a] -> [b] -> m ()
+ Language.Haskell.TH.Instances.Internal.Utils: AllPhases :: Phases
+ Language.Haskell.TH.Instances.Internal.Utils: AllowAmbiguousTypes :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: AlternativeLayoutRule :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: AlternativeLayoutRuleTransitional :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: AnnLookupModule :: Module -> AnnLookup
+ Language.Haskell.TH.Instances.Internal.Utils: AnnLookupName :: Name -> AnnLookup
+ Language.Haskell.TH.Instances.Internal.Utils: AnnP :: AnnTarget -> Exp -> Pragma
+ Language.Haskell.TH.Instances.Internal.Utils: AnyclassStrategy :: DerivStrategy
+ Language.Haskell.TH.Instances.Internal.Utils: AppE :: Exp -> Exp -> Exp
+ Language.Haskell.TH.Instances.Internal.Utils: AppT :: Type -> Type -> Type
+ Language.Haskell.TH.Instances.Internal.Utils: AppTypeE :: Exp -> Type -> Exp
+ Language.Haskell.TH.Instances.Internal.Utils: ApplicativeDo :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: ArithSeqE :: Range -> Exp
+ Language.Haskell.TH.Instances.Internal.Utils: ArrowT :: Type
+ Language.Haskell.TH.Instances.Internal.Utils: Arrows :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: AsP :: Name -> Pat -> Pat
+ Language.Haskell.TH.Instances.Internal.Utils: AutoDeriveTypeable :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: Bang :: SourceUnpackedness -> SourceStrictness -> Bang
+ Language.Haskell.TH.Instances.Internal.Utils: BangP :: Pat -> Pat
+ Language.Haskell.TH.Instances.Internal.Utils: BangPatterns :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: BeforePhase :: Int -> Phases
+ Language.Haskell.TH.Instances.Internal.Utils: BinaryLiterals :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: BindS :: Pat -> Exp -> Stmt
+ Language.Haskell.TH.Instances.Internal.Utils: CApi :: Callconv
+ Language.Haskell.TH.Instances.Internal.Utils: CApiFFI :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: CCall :: Callconv
+ Language.Haskell.TH.Instances.Internal.Utils: CaseE :: Exp -> [Match] -> Exp
+ Language.Haskell.TH.Instances.Internal.Utils: CharL :: Char -> Lit
+ Language.Haskell.TH.Instances.Internal.Utils: CharPrimL :: Char -> Lit
+ Language.Haskell.TH.Instances.Internal.Utils: ClassD :: Cxt -> Name -> [TyVarBndr] -> [FunDep] -> [Dec] -> Dec
+ Language.Haskell.TH.Instances.Internal.Utils: ClassI :: Dec -> [InstanceDec] -> Info
+ Language.Haskell.TH.Instances.Internal.Utils: ClassOpI :: Name -> Type -> ParentName -> Info
+ Language.Haskell.TH.Instances.Internal.Utils: Clause :: [Pat] -> Body -> [Dec] -> Clause
+ Language.Haskell.TH.Instances.Internal.Utils: ClosedTypeFamilyD :: TypeFamilyHead -> [TySynEqn] -> Dec
+ Language.Haskell.TH.Instances.Internal.Utils: CompE :: [Stmt] -> Exp
+ Language.Haskell.TH.Instances.Internal.Utils: CompleteP :: [Name] -> Maybe Name -> Pragma
+ Language.Haskell.TH.Instances.Internal.Utils: ConE :: Name -> Exp
+ Language.Haskell.TH.Instances.Internal.Utils: ConLike :: RuleMatch
+ Language.Haskell.TH.Instances.Internal.Utils: ConP :: Name -> [Pat] -> Pat
+ Language.Haskell.TH.Instances.Internal.Utils: ConT :: Name -> Type
+ Language.Haskell.TH.Instances.Internal.Utils: CondE :: Exp -> Exp -> Exp -> Exp
+ Language.Haskell.TH.Instances.Internal.Utils: ConstrainedClassMethods :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: ConstraintKinds :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: ConstraintT :: Type
+ Language.Haskell.TH.Instances.Internal.Utils: Cpp :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: DataConI :: Name -> Type -> ParentName -> Info
+ Language.Haskell.TH.Instances.Internal.Utils: DataD :: Cxt -> Name -> [TyVarBndr] -> Maybe Kind -> [Con] -> [DerivClause] -> Dec
+ Language.Haskell.TH.Instances.Internal.Utils: DataFamilyD :: Name -> [TyVarBndr] -> Maybe Kind -> Dec
+ Language.Haskell.TH.Instances.Internal.Utils: DataInstD :: Cxt -> Name -> [Type] -> Maybe Kind -> [Con] -> [DerivClause] -> Dec
+ Language.Haskell.TH.Instances.Internal.Utils: DataKinds :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: DatatypeContexts :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: DecidedLazy :: DecidedStrictness
+ Language.Haskell.TH.Instances.Internal.Utils: DecidedStrict :: DecidedStrictness
+ Language.Haskell.TH.Instances.Internal.Utils: DecidedUnpack :: DecidedStrictness
+ Language.Haskell.TH.Instances.Internal.Utils: DefaultSigD :: Name -> Type -> Dec
+ Language.Haskell.TH.Instances.Internal.Utils: DefaultSignatures :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: DerivClause :: Maybe DerivStrategy -> Cxt -> DerivClause
+ Language.Haskell.TH.Instances.Internal.Utils: DeriveAnyClass :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: DeriveDataTypeable :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: DeriveFoldable :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: DeriveFunctor :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: DeriveGeneric :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: DeriveLift :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: DeriveTraversable :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: DerivingStrategies :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: DisambiguateRecordFields :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: DoAndIfThenElse :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: DoE :: [Stmt] -> Exp
+ Language.Haskell.TH.Instances.Internal.Utils: DoublePrimL :: Rational -> Lit
+ Language.Haskell.TH.Instances.Internal.Utils: DuplicateRecordFields :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: EmptyCase :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: EmptyDataDecls :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: EmptyDataDeriving :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: EqualityT :: Type
+ Language.Haskell.TH.Instances.Internal.Utils: ExistentialQuantification :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: ExplBidir :: [Clause] -> PatSynDir
+ Language.Haskell.TH.Instances.Internal.Utils: ExplicitForAll :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: ExplicitNamespaces :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: ExportF :: Callconv -> String -> Name -> Type -> Foreign
+ Language.Haskell.TH.Instances.Internal.Utils: ExtendedDefaultRules :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: FamilyI :: Dec -> [InstanceDec] -> Info
+ Language.Haskell.TH.Instances.Internal.Utils: Fixity :: Int -> FixityDirection -> Fixity
+ Language.Haskell.TH.Instances.Internal.Utils: FlexibleContexts :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: FlexibleInstances :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: FloatPrimL :: Rational -> Lit
+ Language.Haskell.TH.Instances.Internal.Utils: ForallC :: [TyVarBndr] -> Cxt -> Con -> Con
+ Language.Haskell.TH.Instances.Internal.Utils: ForallT :: [TyVarBndr] -> Cxt -> Type -> Type
+ Language.Haskell.TH.Instances.Internal.Utils: ForeignD :: Foreign -> Dec
+ Language.Haskell.TH.Instances.Internal.Utils: ForeignFunctionInterface :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: FromPhase :: Int -> Phases
+ Language.Haskell.TH.Instances.Internal.Utils: FromR :: Exp -> Range
+ Language.Haskell.TH.Instances.Internal.Utils: FromThenR :: Exp -> Exp -> Range
+ Language.Haskell.TH.Instances.Internal.Utils: FromThenToR :: Exp -> Exp -> Exp -> Range
+ Language.Haskell.TH.Instances.Internal.Utils: FromToR :: Exp -> Exp -> Range
+ Language.Haskell.TH.Instances.Internal.Utils: FunD :: Name -> [Clause] -> Dec
+ Language.Haskell.TH.Instances.Internal.Utils: FunDep :: [Name] -> [Name] -> FunDep
+ Language.Haskell.TH.Instances.Internal.Utils: FunLike :: RuleMatch
+ Language.Haskell.TH.Instances.Internal.Utils: FunctionalDependencies :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: GADTSyntax :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: GADTs :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: GHCForeignImportPrim :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: GadtC :: [Name] -> [BangType] -> Type -> Con
+ Language.Haskell.TH.Instances.Internal.Utils: GeneralizedNewtypeDeriving :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: GuardedB :: [(Guard, Exp)] -> Body
+ Language.Haskell.TH.Instances.Internal.Utils: HexFloatLiterals :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: ImplBidir :: PatSynDir
+ Language.Haskell.TH.Instances.Internal.Utils: ImplicitParams :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: ImplicitPrelude :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: ImportF :: Callconv -> Safety -> String -> Name -> Type -> Foreign
+ Language.Haskell.TH.Instances.Internal.Utils: ImpredicativeTypes :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: Incoherent :: Overlap
+ Language.Haskell.TH.Instances.Internal.Utils: IncoherentInstances :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: InferR :: Role
+ Language.Haskell.TH.Instances.Internal.Utils: InfixC :: BangType -> Name -> BangType -> Con
+ Language.Haskell.TH.Instances.Internal.Utils: InfixD :: Fixity -> Name -> Dec
+ Language.Haskell.TH.Instances.Internal.Utils: InfixE :: Maybe Exp -> Exp -> Maybe Exp -> Exp
+ Language.Haskell.TH.Instances.Internal.Utils: InfixL :: FixityDirection
+ Language.Haskell.TH.Instances.Internal.Utils: InfixN :: FixityDirection
+ Language.Haskell.TH.Instances.Internal.Utils: InfixP :: Pat -> Name -> Pat -> Pat
+ Language.Haskell.TH.Instances.Internal.Utils: InfixPatSyn :: Name -> Name -> PatSynArgs
+ Language.Haskell.TH.Instances.Internal.Utils: InfixR :: FixityDirection
+ Language.Haskell.TH.Instances.Internal.Utils: InfixT :: Type -> Name -> Type -> Type
+ Language.Haskell.TH.Instances.Internal.Utils: InjectivityAnn :: Name -> [Name] -> InjectivityAnn
+ Language.Haskell.TH.Instances.Internal.Utils: Inlinable :: Inline
+ Language.Haskell.TH.Instances.Internal.Utils: Inline :: Inline
+ Language.Haskell.TH.Instances.Internal.Utils: InlineP :: Name -> Inline -> RuleMatch -> Phases -> Pragma
+ Language.Haskell.TH.Instances.Internal.Utils: InstanceD :: Maybe Overlap -> Cxt -> Type -> [Dec] -> Dec
+ Language.Haskell.TH.Instances.Internal.Utils: InstanceSigs :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: IntPrimL :: Integer -> Lit
+ Language.Haskell.TH.Instances.Internal.Utils: IntegerL :: Integer -> Lit
+ Language.Haskell.TH.Instances.Internal.Utils: Interruptible :: Safety
+ Language.Haskell.TH.Instances.Internal.Utils: InterruptibleFFI :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: JavaScript :: Callconv
+ Language.Haskell.TH.Instances.Internal.Utils: JavaScriptFFI :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: KindSig :: Kind -> FamilyResultSig
+ Language.Haskell.TH.Instances.Internal.Utils: KindSignatures :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: KindedTV :: Name -> Kind -> TyVarBndr
+ Language.Haskell.TH.Instances.Internal.Utils: LabelE :: String -> Exp
+ Language.Haskell.TH.Instances.Internal.Utils: LamCaseE :: [Match] -> Exp
+ Language.Haskell.TH.Instances.Internal.Utils: LamE :: [Pat] -> Exp -> Exp
+ Language.Haskell.TH.Instances.Internal.Utils: LambdaCase :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: LetE :: [Dec] -> Exp -> Exp
+ Language.Haskell.TH.Instances.Internal.Utils: LetS :: [Dec] -> Stmt
+ Language.Haskell.TH.Instances.Internal.Utils: LiberalTypeSynonyms :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: LineP :: Int -> String -> Pragma
+ Language.Haskell.TH.Instances.Internal.Utils: ListE :: [Exp] -> Exp
+ Language.Haskell.TH.Instances.Internal.Utils: ListP :: [Pat] -> Pat
+ Language.Haskell.TH.Instances.Internal.Utils: ListT :: Type
+ Language.Haskell.TH.Instances.Internal.Utils: LitE :: Lit -> Exp
+ Language.Haskell.TH.Instances.Internal.Utils: LitP :: Lit -> Pat
+ Language.Haskell.TH.Instances.Internal.Utils: LitT :: TyLit -> Type
+ Language.Haskell.TH.Instances.Internal.Utils: Loc :: String -> String -> String -> CharPos -> CharPos -> Loc
+ Language.Haskell.TH.Instances.Internal.Utils: MagicHash :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: Match :: Pat -> Body -> [Dec] -> Match
+ Language.Haskell.TH.Instances.Internal.Utils: ModuleAnnotation :: AnnTarget
+ Language.Haskell.TH.Instances.Internal.Utils: ModuleInfo :: [Module] -> ModuleInfo
+ Language.Haskell.TH.Instances.Internal.Utils: MonadComprehensions :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: MonadFailDesugaring :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: MonoLocalBinds :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: MonoPatBinds :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: MonomorphismRestriction :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: MultiIfE :: [(Guard, Exp)] -> Exp
+ Language.Haskell.TH.Instances.Internal.Utils: MultiParamTypeClasses :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: MultiWayIf :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: NPlusKPatterns :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: NamedWildCards :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: NegativeLiterals :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: NewtypeD :: Cxt -> Name -> [TyVarBndr] -> Maybe Kind -> Con -> [DerivClause] -> Dec
+ Language.Haskell.TH.Instances.Internal.Utils: NewtypeInstD :: Cxt -> Name -> [Type] -> Maybe Kind -> Con -> [DerivClause] -> Dec
+ Language.Haskell.TH.Instances.Internal.Utils: NewtypeStrategy :: DerivStrategy
+ Language.Haskell.TH.Instances.Internal.Utils: NoBindS :: Exp -> Stmt
+ Language.Haskell.TH.Instances.Internal.Utils: NoInline :: Inline
+ Language.Haskell.TH.Instances.Internal.Utils: NoSig :: FamilyResultSig
+ Language.Haskell.TH.Instances.Internal.Utils: NoSourceStrictness :: SourceStrictness
+ Language.Haskell.TH.Instances.Internal.Utils: NoSourceUnpackedness :: SourceUnpackedness
+ Language.Haskell.TH.Instances.Internal.Utils: NominalR :: Role
+ Language.Haskell.TH.Instances.Internal.Utils: NondecreasingIndentation :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: NormalB :: Exp -> Body
+ Language.Haskell.TH.Instances.Internal.Utils: NormalC :: Name -> [BangType] -> Con
+ Language.Haskell.TH.Instances.Internal.Utils: NormalG :: Exp -> Guard
+ Language.Haskell.TH.Instances.Internal.Utils: NullaryTypeClasses :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: NumDecimals :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: NumTyLit :: Integer -> TyLit
+ Language.Haskell.TH.Instances.Internal.Utils: OpenTypeFamilyD :: TypeFamilyHead -> Dec
+ Language.Haskell.TH.Instances.Internal.Utils: Overlappable :: Overlap
+ Language.Haskell.TH.Instances.Internal.Utils: Overlapping :: Overlap
+ Language.Haskell.TH.Instances.Internal.Utils: OverlappingInstances :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: Overlaps :: Overlap
+ Language.Haskell.TH.Instances.Internal.Utils: OverloadedLabels :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: OverloadedLists :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: OverloadedStrings :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: PackageImports :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: ParS :: [[Stmt]] -> Stmt
+ Language.Haskell.TH.Instances.Internal.Utils: ParallelArrays :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: ParallelListComp :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: ParensE :: Exp -> Exp
+ Language.Haskell.TH.Instances.Internal.Utils: ParensP :: Pat -> Pat
+ Language.Haskell.TH.Instances.Internal.Utils: ParensT :: Type -> Type
+ Language.Haskell.TH.Instances.Internal.Utils: PartialTypeSignatures :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: PatG :: [Stmt] -> Guard
+ Language.Haskell.TH.Instances.Internal.Utils: PatSynD :: Name -> PatSynArgs -> PatSynDir -> Pat -> Dec
+ Language.Haskell.TH.Instances.Internal.Utils: PatSynI :: Name -> PatSynType -> Info
+ Language.Haskell.TH.Instances.Internal.Utils: PatSynSigD :: Name -> PatSynType -> Dec
+ Language.Haskell.TH.Instances.Internal.Utils: PatternGuards :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: PatternSynonyms :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: PhantomR :: Role
+ Language.Haskell.TH.Instances.Internal.Utils: PlainTV :: Name -> TyVarBndr
+ Language.Haskell.TH.Instances.Internal.Utils: PolyKinds :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: PostfixOperators :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: PragmaD :: Pragma -> Dec
+ Language.Haskell.TH.Instances.Internal.Utils: PrefixPatSyn :: [Name] -> PatSynArgs
+ Language.Haskell.TH.Instances.Internal.Utils: Prim :: Callconv
+ Language.Haskell.TH.Instances.Internal.Utils: PrimTyConI :: Name -> Arity -> Unlifted -> Info
+ Language.Haskell.TH.Instances.Internal.Utils: PromotedConsT :: Type
+ Language.Haskell.TH.Instances.Internal.Utils: PromotedNilT :: Type
+ Language.Haskell.TH.Instances.Internal.Utils: PromotedT :: Name -> Type
+ Language.Haskell.TH.Instances.Internal.Utils: PromotedTupleT :: Int -> Type
+ Language.Haskell.TH.Instances.Internal.Utils: QuasiQuotes :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: RankNTypes :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: RationalL :: Rational -> Lit
+ Language.Haskell.TH.Instances.Internal.Utils: RebindableSyntax :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: RecC :: Name -> [VarBangType] -> Con
+ Language.Haskell.TH.Instances.Internal.Utils: RecConE :: Name -> [FieldExp] -> Exp
+ Language.Haskell.TH.Instances.Internal.Utils: RecGadtC :: [Name] -> [VarBangType] -> Type -> Con
+ Language.Haskell.TH.Instances.Internal.Utils: RecP :: Name -> [FieldPat] -> Pat
+ Language.Haskell.TH.Instances.Internal.Utils: RecUpdE :: Exp -> [FieldExp] -> Exp
+ Language.Haskell.TH.Instances.Internal.Utils: RecordPatSyn :: [Name] -> PatSynArgs
+ Language.Haskell.TH.Instances.Internal.Utils: RecordPuns :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: RecordWildCards :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: RecursiveDo :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: RelaxedLayout :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: RelaxedPolyRec :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: RepresentationalR :: Role
+ Language.Haskell.TH.Instances.Internal.Utils: RoleAnnotD :: Name -> [Role] -> Dec
+ Language.Haskell.TH.Instances.Internal.Utils: RoleAnnotations :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: RuleP :: String -> [RuleBndr] -> Exp -> Exp -> Phases -> Pragma
+ Language.Haskell.TH.Instances.Internal.Utils: RuleVar :: Name -> RuleBndr
+ Language.Haskell.TH.Instances.Internal.Utils: Safe :: Safety
+ Language.Haskell.TH.Instances.Internal.Utils: ScopedTypeVariables :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: SigD :: Name -> Type -> Dec
+ Language.Haskell.TH.Instances.Internal.Utils: SigE :: Exp -> Type -> Exp
+ Language.Haskell.TH.Instances.Internal.Utils: SigP :: Pat -> Type -> Pat
+ Language.Haskell.TH.Instances.Internal.Utils: SigT :: Type -> Kind -> Type
+ Language.Haskell.TH.Instances.Internal.Utils: SourceLazy :: SourceStrictness
+ Language.Haskell.TH.Instances.Internal.Utils: SourceNoUnpack :: SourceUnpackedness
+ Language.Haskell.TH.Instances.Internal.Utils: SourceStrict :: SourceStrictness
+ Language.Haskell.TH.Instances.Internal.Utils: SourceUnpack :: SourceUnpackedness
+ Language.Haskell.TH.Instances.Internal.Utils: SpecialiseInstP :: Type -> Pragma
+ Language.Haskell.TH.Instances.Internal.Utils: SpecialiseP :: Name -> Type -> Maybe Inline -> Phases -> Pragma
+ Language.Haskell.TH.Instances.Internal.Utils: StandaloneDerivD :: Maybe DerivStrategy -> Cxt -> Type -> Dec
+ Language.Haskell.TH.Instances.Internal.Utils: StandaloneDeriving :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: StarT :: Type
+ Language.Haskell.TH.Instances.Internal.Utils: StaticE :: Exp -> Exp
+ Language.Haskell.TH.Instances.Internal.Utils: StaticPointers :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: StdCall :: Callconv
+ Language.Haskell.TH.Instances.Internal.Utils: StockStrategy :: DerivStrategy
+ Language.Haskell.TH.Instances.Internal.Utils: StrTyLit :: String -> TyLit
+ Language.Haskell.TH.Instances.Internal.Utils: Strict :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: StrictData :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: StringL :: String -> Lit
+ Language.Haskell.TH.Instances.Internal.Utils: StringPrimL :: [Word8] -> Lit
+ Language.Haskell.TH.Instances.Internal.Utils: TemplateHaskell :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: TemplateHaskellQuotes :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: TildeP :: Pat -> Pat
+ Language.Haskell.TH.Instances.Internal.Utils: TraditionalRecordSyntax :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: TransformListComp :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: TupE :: [Exp] -> Exp
+ Language.Haskell.TH.Instances.Internal.Utils: TupP :: [Pat] -> Pat
+ Language.Haskell.TH.Instances.Internal.Utils: TupleSections :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: TupleT :: Int -> Type
+ Language.Haskell.TH.Instances.Internal.Utils: TyConI :: Dec -> Info
+ Language.Haskell.TH.Instances.Internal.Utils: TySynD :: Name -> [TyVarBndr] -> Type -> Dec
+ Language.Haskell.TH.Instances.Internal.Utils: TySynEqn :: [Type] -> Type -> TySynEqn
+ Language.Haskell.TH.Instances.Internal.Utils: TySynInstD :: Name -> TySynEqn -> Dec
+ Language.Haskell.TH.Instances.Internal.Utils: TyVarI :: Name -> Type -> Info
+ Language.Haskell.TH.Instances.Internal.Utils: TyVarSig :: TyVarBndr -> FamilyResultSig
+ Language.Haskell.TH.Instances.Internal.Utils: TypeAnnotation :: Name -> AnnTarget
+ Language.Haskell.TH.Instances.Internal.Utils: TypeApplications :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: TypeFamilies :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: TypeFamilyDependencies :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: TypeFamilyHead :: Name -> [TyVarBndr] -> FamilyResultSig -> Maybe InjectivityAnn -> TypeFamilyHead
+ Language.Haskell.TH.Instances.Internal.Utils: TypeInType :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: TypeOperators :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: TypeSynonymInstances :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: TypedRuleVar :: Name -> Type -> RuleBndr
+ Language.Haskell.TH.Instances.Internal.Utils: UInfixE :: Exp -> Exp -> Exp -> Exp
+ Language.Haskell.TH.Instances.Internal.Utils: UInfixP :: Pat -> Name -> Pat -> Pat
+ Language.Haskell.TH.Instances.Internal.Utils: UInfixT :: Type -> Name -> Type -> Type
+ Language.Haskell.TH.Instances.Internal.Utils: UnboundVarE :: Name -> Exp
+ Language.Haskell.TH.Instances.Internal.Utils: UnboxedSumE :: Exp -> SumAlt -> SumArity -> Exp
+ Language.Haskell.TH.Instances.Internal.Utils: UnboxedSumP :: Pat -> SumAlt -> SumArity -> Pat
+ Language.Haskell.TH.Instances.Internal.Utils: UnboxedSumT :: SumArity -> Type
+ Language.Haskell.TH.Instances.Internal.Utils: UnboxedSums :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: UnboxedTupE :: [Exp] -> Exp
+ Language.Haskell.TH.Instances.Internal.Utils: UnboxedTupP :: [Pat] -> Pat
+ Language.Haskell.TH.Instances.Internal.Utils: UnboxedTupleT :: Int -> Type
+ Language.Haskell.TH.Instances.Internal.Utils: UnboxedTuples :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: UndecidableInstances :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: UndecidableSuperClasses :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: UnicodeSyntax :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: Unidir :: PatSynDir
+ Language.Haskell.TH.Instances.Internal.Utils: UnliftedFFITypes :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: Unsafe :: Safety
+ Language.Haskell.TH.Instances.Internal.Utils: ValD :: Pat -> Body -> [Dec] -> Dec
+ Language.Haskell.TH.Instances.Internal.Utils: ValueAnnotation :: Name -> AnnTarget
+ Language.Haskell.TH.Instances.Internal.Utils: VarE :: Name -> Exp
+ Language.Haskell.TH.Instances.Internal.Utils: VarI :: Name -> Type -> Maybe Dec -> Info
+ Language.Haskell.TH.Instances.Internal.Utils: VarP :: Name -> Pat
+ Language.Haskell.TH.Instances.Internal.Utils: VarT :: Name -> Type
+ Language.Haskell.TH.Instances.Internal.Utils: ViewP :: Exp -> Pat -> Pat
+ Language.Haskell.TH.Instances.Internal.Utils: ViewPatterns :: Extension
+ Language.Haskell.TH.Instances.Internal.Utils: WildCardT :: Type
+ Language.Haskell.TH.Instances.Internal.Utils: WildP :: Pat
+ Language.Haskell.TH.Instances.Internal.Utils: WordPrimL :: Integer -> Lit
+ Language.Haskell.TH.Instances.Internal.Utils: [loc_end] :: Loc -> CharPos
+ Language.Haskell.TH.Instances.Internal.Utils: [loc_filename] :: Loc -> String
+ Language.Haskell.TH.Instances.Internal.Utils: [loc_module] :: Loc -> String
+ Language.Haskell.TH.Instances.Internal.Utils: [loc_package] :: Loc -> String
+ Language.Haskell.TH.Instances.Internal.Utils: [loc_start] :: Loc -> CharPos
+ Language.Haskell.TH.Instances.Internal.Utils: adjust :: Ord k => a -> a -> k -> Map k a -> Map k a
+ Language.Haskell.TH.Instances.Internal.Utils: appE :: ExpQ -> ExpQ -> ExpQ
+ Language.Haskell.TH.Instances.Internal.Utils: appK :: Kind -> Kind -> Kind
+ Language.Haskell.TH.Instances.Internal.Utils: appT :: TypeQ -> TypeQ -> TypeQ
+ Language.Haskell.TH.Instances.Internal.Utils: appTypeE :: ExpQ -> TypeQ -> ExpQ
+ Language.Haskell.TH.Instances.Internal.Utils: appsE :: [ExpQ] -> ExpQ
+ Language.Haskell.TH.Instances.Internal.Utils: arithSeqE :: RangeQ -> ExpQ
+ Language.Haskell.TH.Instances.Internal.Utils: arrowK :: Kind
+ Language.Haskell.TH.Instances.Internal.Utils: arrowT :: TypeQ
+ Language.Haskell.TH.Instances.Internal.Utils: asP :: Name -> PatQ -> PatQ
+ Language.Haskell.TH.Instances.Internal.Utils: bang :: SourceUnpackednessQ -> SourceStrictnessQ -> BangQ
+ Language.Haskell.TH.Instances.Internal.Utils: bangP :: PatQ -> PatQ
+ Language.Haskell.TH.Instances.Internal.Utils: bangType :: BangQ -> TypeQ -> BangTypeQ
+ Language.Haskell.TH.Instances.Internal.Utils: bindS :: PatQ -> ExpQ -> StmtQ
+ Language.Haskell.TH.Instances.Internal.Utils: cApi :: Callconv
+ Language.Haskell.TH.Instances.Internal.Utils: cCall :: Callconv
+ Language.Haskell.TH.Instances.Internal.Utils: caseE :: ExpQ -> [MatchQ] -> ExpQ
+ Language.Haskell.TH.Instances.Internal.Utils: charL :: Char -> Lit
+ Language.Haskell.TH.Instances.Internal.Utils: charPrimL :: Char -> Lit
+ Language.Haskell.TH.Instances.Internal.Utils: class Ppr a
+ Language.Haskell.TH.Instances.Internal.Utils: classD :: CxtQ -> Name -> [TyVarBndr] -> [FunDep] -> [DecQ] -> DecQ
+ Language.Haskell.TH.Instances.Internal.Utils: classP :: Name -> [Q Type] -> Q Pred
+ Language.Haskell.TH.Instances.Internal.Utils: clause :: [PatQ] -> BodyQ -> [DecQ] -> ClauseQ
+ Language.Haskell.TH.Instances.Internal.Utils: closedTypeFamilyD :: Name -> [TyVarBndr] -> FamilyResultSig -> Maybe InjectivityAnn -> [TySynEqnQ] -> DecQ
+ Language.Haskell.TH.Instances.Internal.Utils: compE :: [StmtQ] -> ExpQ
+ Language.Haskell.TH.Instances.Internal.Utils: conE :: Name -> ExpQ
+ Language.Haskell.TH.Instances.Internal.Utils: conK :: Name -> Kind
+ Language.Haskell.TH.Instances.Internal.Utils: conP :: Name -> [PatQ] -> PatQ
+ Language.Haskell.TH.Instances.Internal.Utils: conT :: Name -> TypeQ
+ Language.Haskell.TH.Instances.Internal.Utils: condE :: ExpQ -> ExpQ -> ExpQ -> ExpQ
+ Language.Haskell.TH.Instances.Internal.Utils: constraintK :: Kind
+ Language.Haskell.TH.Instances.Internal.Utils: cxt :: [PredQ] -> CxtQ
+ Language.Haskell.TH.Instances.Internal.Utils: data AnnLookup
+ Language.Haskell.TH.Instances.Internal.Utils: data AnnTarget
+ Language.Haskell.TH.Instances.Internal.Utils: data Bang
+ Language.Haskell.TH.Instances.Internal.Utils: data Body
+ Language.Haskell.TH.Instances.Internal.Utils: data Callconv
+ Language.Haskell.TH.Instances.Internal.Utils: data Clause
+ Language.Haskell.TH.Instances.Internal.Utils: data Con
+ Language.Haskell.TH.Instances.Internal.Utils: data Dec
+ Language.Haskell.TH.Instances.Internal.Utils: data DecidedStrictness
+ Language.Haskell.TH.Instances.Internal.Utils: data DerivClause
+ Language.Haskell.TH.Instances.Internal.Utils: data DerivStrategy
+ Language.Haskell.TH.Instances.Internal.Utils: data Exp
+ Language.Haskell.TH.Instances.Internal.Utils: data Extension
+ Language.Haskell.TH.Instances.Internal.Utils: data FamilyResultSig
+ Language.Haskell.TH.Instances.Internal.Utils: data Fixity
+ Language.Haskell.TH.Instances.Internal.Utils: data FixityDirection
+ Language.Haskell.TH.Instances.Internal.Utils: data Foreign
+ Language.Haskell.TH.Instances.Internal.Utils: data FunDep
+ Language.Haskell.TH.Instances.Internal.Utils: data Guard
+ Language.Haskell.TH.Instances.Internal.Utils: data Info
+ Language.Haskell.TH.Instances.Internal.Utils: data InjectivityAnn
+ Language.Haskell.TH.Instances.Internal.Utils: data Inline
+ Language.Haskell.TH.Instances.Internal.Utils: data Lit
+ Language.Haskell.TH.Instances.Internal.Utils: data Loc
+ Language.Haskell.TH.Instances.Internal.Utils: data Map k a
+ Language.Haskell.TH.Instances.Internal.Utils: data Match
+ Language.Haskell.TH.Instances.Internal.Utils: data ModuleInfo
+ Language.Haskell.TH.Instances.Internal.Utils: data Name
+ Language.Haskell.TH.Instances.Internal.Utils: data NameSpace
+ Language.Haskell.TH.Instances.Internal.Utils: data Overlap
+ Language.Haskell.TH.Instances.Internal.Utils: data Pat
+ Language.Haskell.TH.Instances.Internal.Utils: data PatSynArgs
+ Language.Haskell.TH.Instances.Internal.Utils: data PatSynDir
+ Language.Haskell.TH.Instances.Internal.Utils: data Phases
+ Language.Haskell.TH.Instances.Internal.Utils: data Pragma
+ Language.Haskell.TH.Instances.Internal.Utils: data Q a
+ Language.Haskell.TH.Instances.Internal.Utils: data Range
+ Language.Haskell.TH.Instances.Internal.Utils: data Role
+ Language.Haskell.TH.Instances.Internal.Utils: data RuleBndr
+ Language.Haskell.TH.Instances.Internal.Utils: data RuleMatch
+ Language.Haskell.TH.Instances.Internal.Utils: data Safety
+ Language.Haskell.TH.Instances.Internal.Utils: data SourceStrictness
+ Language.Haskell.TH.Instances.Internal.Utils: data SourceUnpackedness
+ Language.Haskell.TH.Instances.Internal.Utils: data Stmt
+ Language.Haskell.TH.Instances.Internal.Utils: data TExp a
+ Language.Haskell.TH.Instances.Internal.Utils: data TyLit
+ Language.Haskell.TH.Instances.Internal.Utils: data TySynEqn
+ Language.Haskell.TH.Instances.Internal.Utils: data TyVarBndr
+ Language.Haskell.TH.Instances.Internal.Utils: data Type
+ Language.Haskell.TH.Instances.Internal.Utils: data TypeFamilyHead
+ Language.Haskell.TH.Instances.Internal.Utils: dataD :: CxtQ -> Name -> [TyVarBndr] -> Maybe Kind -> [ConQ] -> [DerivClauseQ] -> DecQ
+ Language.Haskell.TH.Instances.Internal.Utils: dataFamilyD :: Name -> [TyVarBndr] -> Maybe Kind -> DecQ
+ Language.Haskell.TH.Instances.Internal.Utils: dataInstD :: CxtQ -> Name -> [TypeQ] -> Maybe Kind -> [ConQ] -> [DerivClauseQ] -> DecQ
+ Language.Haskell.TH.Instances.Internal.Utils: defaultFixity :: Fixity
+ Language.Haskell.TH.Instances.Internal.Utils: defaultSigD :: Name -> TypeQ -> DecQ
+ Language.Haskell.TH.Instances.Internal.Utils: derivClause :: Maybe DerivStrategy -> [PredQ] -> DerivClauseQ
+ Language.Haskell.TH.Instances.Internal.Utils: doE :: [StmtQ] -> ExpQ
+ Language.Haskell.TH.Instances.Internal.Utils: doublePrimL :: Rational -> Lit
+ Language.Haskell.TH.Instances.Internal.Utils: dyn :: String -> ExpQ
+ Language.Haskell.TH.Instances.Internal.Utils: equalP :: TypeQ -> TypeQ -> PredQ
+ Language.Haskell.TH.Instances.Internal.Utils: equalityT :: TypeQ
+ Language.Haskell.TH.Instances.Internal.Utils: explBidir :: [ClauseQ] -> PatSynDirQ
+ Language.Haskell.TH.Instances.Internal.Utils: extsEnabled :: Q [Extension]
+ Language.Haskell.TH.Instances.Internal.Utils: fieldExp :: Name -> ExpQ -> Q (Name, Exp)
+ Language.Haskell.TH.Instances.Internal.Utils: fieldPat :: Name -> PatQ -> FieldPatQ
+ Language.Haskell.TH.Instances.Internal.Utils: floatPrimL :: Rational -> Lit
+ Language.Haskell.TH.Instances.Internal.Utils: forImpD :: Callconv -> Safety -> String -> Name -> TypeQ -> DecQ
+ Language.Haskell.TH.Instances.Internal.Utils: forallC :: [TyVarBndr] -> CxtQ -> ConQ -> ConQ
+ Language.Haskell.TH.Instances.Internal.Utils: forallT :: [TyVarBndr] -> CxtQ -> TypeQ -> TypeQ
+ Language.Haskell.TH.Instances.Internal.Utils: fromE :: ExpQ -> ExpQ
+ Language.Haskell.TH.Instances.Internal.Utils: fromList :: Ord k => [(k, a)] -> Map k a
+ Language.Haskell.TH.Instances.Internal.Utils: fromR :: ExpQ -> RangeQ
+ Language.Haskell.TH.Instances.Internal.Utils: fromThenE :: ExpQ -> ExpQ -> ExpQ
+ Language.Haskell.TH.Instances.Internal.Utils: fromThenR :: ExpQ -> ExpQ -> RangeQ
+ Language.Haskell.TH.Instances.Internal.Utils: fromThenToE :: ExpQ -> ExpQ -> ExpQ -> ExpQ
+ Language.Haskell.TH.Instances.Internal.Utils: fromThenToR :: ExpQ -> ExpQ -> ExpQ -> RangeQ
+ Language.Haskell.TH.Instances.Internal.Utils: fromToE :: ExpQ -> ExpQ -> ExpQ
+ Language.Haskell.TH.Instances.Internal.Utils: fromToR :: ExpQ -> ExpQ -> RangeQ
+ Language.Haskell.TH.Instances.Internal.Utils: funD :: Name -> [ClauseQ] -> DecQ
+ Language.Haskell.TH.Instances.Internal.Utils: funDep :: [Name] -> [Name] -> FunDep
+ Language.Haskell.TH.Instances.Internal.Utils: gadtC :: [Name] -> [StrictTypeQ] -> TypeQ -> ConQ
+ Language.Haskell.TH.Instances.Internal.Utils: guardedB :: [Q (Guard, Exp)] -> BodyQ
+ Language.Haskell.TH.Instances.Internal.Utils: implBidir :: PatSynDirQ
+ Language.Haskell.TH.Instances.Internal.Utils: inferR :: Role
+ Language.Haskell.TH.Instances.Internal.Utils: infixApp :: ExpQ -> ExpQ -> ExpQ -> ExpQ
+ Language.Haskell.TH.Instances.Internal.Utils: infixC :: Q (Bang, Type) -> Name -> Q (Bang, Type) -> ConQ
+ Language.Haskell.TH.Instances.Internal.Utils: infixE :: Maybe ExpQ -> ExpQ -> Maybe ExpQ -> ExpQ
+ Language.Haskell.TH.Instances.Internal.Utils: infixLD :: Int -> Name -> DecQ
+ Language.Haskell.TH.Instances.Internal.Utils: infixND :: Int -> Name -> DecQ
+ Language.Haskell.TH.Instances.Internal.Utils: infixP :: PatQ -> Name -> PatQ -> PatQ
+ Language.Haskell.TH.Instances.Internal.Utils: infixPatSyn :: Name -> Name -> PatSynArgsQ
+ Language.Haskell.TH.Instances.Internal.Utils: infixRD :: Int -> Name -> DecQ
+ Language.Haskell.TH.Instances.Internal.Utils: infixT :: TypeQ -> Name -> TypeQ -> TypeQ
+ Language.Haskell.TH.Instances.Internal.Utils: injectivityAnn :: Name -> [Name] -> InjectivityAnn
+ Language.Haskell.TH.Instances.Internal.Utils: insert :: Ord k => k -> a -> Map k a -> Map k a
+ Language.Haskell.TH.Instances.Internal.Utils: instanceD :: CxtQ -> TypeQ -> [DecQ] -> DecQ
+ Language.Haskell.TH.Instances.Internal.Utils: instanceWithOverlapD :: Maybe Overlap -> CxtQ -> TypeQ -> [DecQ] -> DecQ
+ Language.Haskell.TH.Instances.Internal.Utils: intPrimL :: Integer -> Lit
+ Language.Haskell.TH.Instances.Internal.Utils: integerL :: Integer -> Lit
+ Language.Haskell.TH.Instances.Internal.Utils: interruptible :: Safety
+ Language.Haskell.TH.Instances.Internal.Utils: isExtEnabled :: Extension -> Q Bool
+ Language.Haskell.TH.Instances.Internal.Utils: isInstance :: Name -> [Type] -> Q Bool
+ Language.Haskell.TH.Instances.Internal.Utils: isStrict :: Q Strict
+ Language.Haskell.TH.Instances.Internal.Utils: javaScript :: Callconv
+ Language.Haskell.TH.Instances.Internal.Utils: kindSig :: Kind -> FamilyResultSig
+ Language.Haskell.TH.Instances.Internal.Utils: kindedTV :: Name -> Kind -> TyVarBndr
+ Language.Haskell.TH.Instances.Internal.Utils: labelE :: String -> ExpQ
+ Language.Haskell.TH.Instances.Internal.Utils: lam1E :: PatQ -> ExpQ -> ExpQ
+ Language.Haskell.TH.Instances.Internal.Utils: lamCaseE :: [MatchQ] -> ExpQ
+ Language.Haskell.TH.Instances.Internal.Utils: lamE :: [PatQ] -> ExpQ -> ExpQ
+ Language.Haskell.TH.Instances.Internal.Utils: letE :: [DecQ] -> ExpQ -> ExpQ
+ Language.Haskell.TH.Instances.Internal.Utils: letS :: [DecQ] -> StmtQ
+ Language.Haskell.TH.Instances.Internal.Utils: listE :: [ExpQ] -> ExpQ
+ Language.Haskell.TH.Instances.Internal.Utils: listK :: Kind
+ Language.Haskell.TH.Instances.Internal.Utils: listP :: [PatQ] -> PatQ
+ Language.Haskell.TH.Instances.Internal.Utils: listT :: TypeQ
+ Language.Haskell.TH.Instances.Internal.Utils: litE :: Lit -> ExpQ
+ Language.Haskell.TH.Instances.Internal.Utils: litP :: Lit -> PatQ
+ Language.Haskell.TH.Instances.Internal.Utils: litT :: TyLitQ -> TypeQ
+ Language.Haskell.TH.Instances.Internal.Utils: location :: Q Loc
+ Language.Haskell.TH.Instances.Internal.Utils: lookup :: Ord k => k -> Map k a -> Maybe a
+ Language.Haskell.TH.Instances.Internal.Utils: lookupTypeName :: String -> Q Maybe Name
+ Language.Haskell.TH.Instances.Internal.Utils: lookupValueName :: String -> Q Maybe Name
+ Language.Haskell.TH.Instances.Internal.Utils: match :: PatQ -> BodyQ -> [DecQ] -> MatchQ
+ Language.Haskell.TH.Instances.Internal.Utils: maxPrecedence :: Int
+ Language.Haskell.TH.Instances.Internal.Utils: mkName :: String -> Name
+ Language.Haskell.TH.Instances.Internal.Utils: moduleAnnotation :: AnnTarget
+ Language.Haskell.TH.Instances.Internal.Utils: multiIfE :: [Q (Guard, Exp)] -> ExpQ
+ Language.Haskell.TH.Instances.Internal.Utils: nameBase :: Name -> String
+ Language.Haskell.TH.Instances.Internal.Utils: nameModule :: Name -> Maybe String
+ Language.Haskell.TH.Instances.Internal.Utils: namePackage :: Name -> Maybe String
+ Language.Haskell.TH.Instances.Internal.Utils: nameSpace :: Name -> Maybe NameSpace
+ Language.Haskell.TH.Instances.Internal.Utils: newName :: String -> Q Name
+ Language.Haskell.TH.Instances.Internal.Utils: newtypeD :: CxtQ -> Name -> [TyVarBndr] -> Maybe Kind -> ConQ -> [DerivClauseQ] -> DecQ
+ Language.Haskell.TH.Instances.Internal.Utils: newtypeInstD :: CxtQ -> Name -> [TypeQ] -> Maybe Kind -> ConQ -> [DerivClauseQ] -> DecQ
+ Language.Haskell.TH.Instances.Internal.Utils: noBindS :: ExpQ -> StmtQ
+ Language.Haskell.TH.Instances.Internal.Utils: noSig :: FamilyResultSig
+ Language.Haskell.TH.Instances.Internal.Utils: noSourceStrictness :: SourceStrictnessQ
+ Language.Haskell.TH.Instances.Internal.Utils: noSourceUnpackedness :: SourceUnpackednessQ
+ Language.Haskell.TH.Instances.Internal.Utils: nominalR :: Role
+ Language.Haskell.TH.Instances.Internal.Utils: normalB :: ExpQ -> BodyQ
+ Language.Haskell.TH.Instances.Internal.Utils: normalC :: Name -> [BangTypeQ] -> ConQ
+ Language.Haskell.TH.Instances.Internal.Utils: normalG :: ExpQ -> GuardQ
+ Language.Haskell.TH.Instances.Internal.Utils: normalGE :: ExpQ -> ExpQ -> Q (Guard, Exp)
+ Language.Haskell.TH.Instances.Internal.Utils: notStrict :: Q Strict
+ Language.Haskell.TH.Instances.Internal.Utils: numTyLit :: Integer -> TyLitQ
+ Language.Haskell.TH.Instances.Internal.Utils: openTypeFamilyD :: Name -> [TyVarBndr] -> FamilyResultSig -> Maybe InjectivityAnn -> DecQ
+ Language.Haskell.TH.Instances.Internal.Utils: parS :: [[StmtQ]] -> StmtQ
+ Language.Haskell.TH.Instances.Internal.Utils: parensE :: ExpQ -> ExpQ
+ Language.Haskell.TH.Instances.Internal.Utils: parensP :: PatQ -> PatQ
+ Language.Haskell.TH.Instances.Internal.Utils: parensT :: TypeQ -> TypeQ
+ Language.Haskell.TH.Instances.Internal.Utils: patG :: [StmtQ] -> GuardQ
+ Language.Haskell.TH.Instances.Internal.Utils: patGE :: [StmtQ] -> ExpQ -> Q (Guard, Exp)
+ Language.Haskell.TH.Instances.Internal.Utils: patSynD :: Name -> PatSynArgsQ -> PatSynDirQ -> PatQ -> DecQ
+ Language.Haskell.TH.Instances.Internal.Utils: patSynSigD :: Name -> TypeQ -> DecQ
+ Language.Haskell.TH.Instances.Internal.Utils: phantomR :: Role
+ Language.Haskell.TH.Instances.Internal.Utils: plainTV :: Name -> TyVarBndr
+ Language.Haskell.TH.Instances.Internal.Utils: ppr :: Ppr a => a -> Doc
+ Language.Haskell.TH.Instances.Internal.Utils: pprExp :: Precedence -> Exp -> Doc
+ Language.Haskell.TH.Instances.Internal.Utils: pprLit :: Precedence -> Lit -> Doc
+ Language.Haskell.TH.Instances.Internal.Utils: pprParendType :: Type -> Doc
+ Language.Haskell.TH.Instances.Internal.Utils: pprPat :: Precedence -> Pat -> Doc
+ Language.Haskell.TH.Instances.Internal.Utils: ppr_list :: Ppr a => [a] -> Doc
+ Language.Haskell.TH.Instances.Internal.Utils: pprint :: Ppr a => a -> String
+ Language.Haskell.TH.Instances.Internal.Utils: pragAnnD :: AnnTarget -> ExpQ -> DecQ
+ Language.Haskell.TH.Instances.Internal.Utils: pragCompleteD :: [Name] -> Maybe Name -> DecQ
+ Language.Haskell.TH.Instances.Internal.Utils: pragInlD :: Name -> Inline -> RuleMatch -> Phases -> DecQ
+ Language.Haskell.TH.Instances.Internal.Utils: pragLineD :: Int -> String -> DecQ
+ Language.Haskell.TH.Instances.Internal.Utils: pragRuleD :: String -> [RuleBndrQ] -> ExpQ -> ExpQ -> Phases -> DecQ
+ Language.Haskell.TH.Instances.Internal.Utils: pragSpecD :: Name -> TypeQ -> Phases -> DecQ
+ Language.Haskell.TH.Instances.Internal.Utils: pragSpecInlD :: Name -> TypeQ -> Inline -> Phases -> DecQ
+ Language.Haskell.TH.Instances.Internal.Utils: pragSpecInstD :: TypeQ -> DecQ
+ Language.Haskell.TH.Instances.Internal.Utils: prefixPatSyn :: [Name] -> PatSynArgsQ
+ Language.Haskell.TH.Instances.Internal.Utils: prim :: Callconv
+ Language.Haskell.TH.Instances.Internal.Utils: promotedConsT :: TypeQ
+ Language.Haskell.TH.Instances.Internal.Utils: promotedNilT :: TypeQ
+ Language.Haskell.TH.Instances.Internal.Utils: promotedT :: Name -> TypeQ
+ Language.Haskell.TH.Instances.Internal.Utils: promotedTupleT :: Int -> TypeQ
+ Language.Haskell.TH.Instances.Internal.Utils: rationalL :: Rational -> Lit
+ Language.Haskell.TH.Instances.Internal.Utils: recC :: Name -> [VarBangTypeQ] -> ConQ
+ Language.Haskell.TH.Instances.Internal.Utils: recConE :: Name -> [Q (Name, Exp)] -> ExpQ
+ Language.Haskell.TH.Instances.Internal.Utils: recGadtC :: [Name] -> [VarStrictTypeQ] -> TypeQ -> ConQ
+ Language.Haskell.TH.Instances.Internal.Utils: recP :: Name -> [FieldPatQ] -> PatQ
+ Language.Haskell.TH.Instances.Internal.Utils: recUpdE :: ExpQ -> [Q (Name, Exp)] -> ExpQ
+ Language.Haskell.TH.Instances.Internal.Utils: recordPatSyn :: [Name] -> PatSynArgsQ
+ Language.Haskell.TH.Instances.Internal.Utils: recover :: () => Q a -> Q a -> Q a
+ Language.Haskell.TH.Instances.Internal.Utils: reify :: Name -> Q Info
+ Language.Haskell.TH.Instances.Internal.Utils: reifyAnnotations :: Data a => AnnLookup -> Q [a]
+ Language.Haskell.TH.Instances.Internal.Utils: reifyConStrictness :: Name -> Q [DecidedStrictness]
+ Language.Haskell.TH.Instances.Internal.Utils: reifyFixity :: Name -> Q Maybe Fixity
+ Language.Haskell.TH.Instances.Internal.Utils: reifyInstances :: Name -> [Type] -> Q [InstanceDec]
+ Language.Haskell.TH.Instances.Internal.Utils: reifyModule :: Module -> Q ModuleInfo
+ Language.Haskell.TH.Instances.Internal.Utils: reifyRoles :: Name -> Q [Role]
+ Language.Haskell.TH.Instances.Internal.Utils: report :: Bool -> String -> Q ()
+ Language.Haskell.TH.Instances.Internal.Utils: reportError :: String -> Q ()
+ Language.Haskell.TH.Instances.Internal.Utils: reportWarning :: String -> Q ()
+ Language.Haskell.TH.Instances.Internal.Utils: representationalR :: Role
+ Language.Haskell.TH.Instances.Internal.Utils: roleAnnotD :: Name -> [Role] -> DecQ
+ Language.Haskell.TH.Instances.Internal.Utils: ruleVar :: Name -> RuleBndrQ
+ Language.Haskell.TH.Instances.Internal.Utils: runIO :: () => IO a -> Q a
+ Language.Haskell.TH.Instances.Internal.Utils: runQ :: Quasi m => Q a -> m a
+ Language.Haskell.TH.Instances.Internal.Utils: safe :: Safety
+ Language.Haskell.TH.Instances.Internal.Utils: sectionL :: ExpQ -> ExpQ -> ExpQ
+ Language.Haskell.TH.Instances.Internal.Utils: sectionR :: ExpQ -> ExpQ -> ExpQ
+ Language.Haskell.TH.Instances.Internal.Utils: sigD :: Name -> TypeQ -> DecQ
+ Language.Haskell.TH.Instances.Internal.Utils: sigE :: ExpQ -> TypeQ -> ExpQ
+ Language.Haskell.TH.Instances.Internal.Utils: sigP :: PatQ -> TypeQ -> PatQ
+ Language.Haskell.TH.Instances.Internal.Utils: sigT :: TypeQ -> Kind -> TypeQ
+ Language.Haskell.TH.Instances.Internal.Utils: sourceLazy :: SourceStrictnessQ
+ Language.Haskell.TH.Instances.Internal.Utils: sourceNoUnpack :: SourceUnpackednessQ
+ Language.Haskell.TH.Instances.Internal.Utils: sourceStrict :: SourceStrictnessQ
+ Language.Haskell.TH.Instances.Internal.Utils: sourceUnpack :: SourceUnpackednessQ
+ Language.Haskell.TH.Instances.Internal.Utils: standaloneDerivD :: CxtQ -> TypeQ -> DecQ
+ Language.Haskell.TH.Instances.Internal.Utils: standaloneDerivWithStrategyD :: Maybe DerivStrategy -> CxtQ -> TypeQ -> DecQ
+ Language.Haskell.TH.Instances.Internal.Utils: starK :: Kind
+ Language.Haskell.TH.Instances.Internal.Utils: staticE :: ExpQ -> ExpQ
+ Language.Haskell.TH.Instances.Internal.Utils: stdCall :: Callconv
+ Language.Haskell.TH.Instances.Internal.Utils: strTyLit :: String -> TyLitQ
+ Language.Haskell.TH.Instances.Internal.Utils: strictType :: Q Strict -> TypeQ -> StrictTypeQ
+ Language.Haskell.TH.Instances.Internal.Utils: stringE :: String -> ExpQ
+ Language.Haskell.TH.Instances.Internal.Utils: stringL :: String -> Lit
+ Language.Haskell.TH.Instances.Internal.Utils: stringPrimL :: [Word8] -> Lit
+ Language.Haskell.TH.Instances.Internal.Utils: thisModule :: Q Module
+ Language.Haskell.TH.Instances.Internal.Utils: tildeP :: PatQ -> PatQ
+ Language.Haskell.TH.Instances.Internal.Utils: traverseWithKey :: Applicative t => k -> a -> t b -> Map k a -> t Map k b
+ Language.Haskell.TH.Instances.Internal.Utils: tupE :: [ExpQ] -> ExpQ
+ Language.Haskell.TH.Instances.Internal.Utils: tupP :: [PatQ] -> PatQ
+ Language.Haskell.TH.Instances.Internal.Utils: tupleDataName :: Int -> Name
+ Language.Haskell.TH.Instances.Internal.Utils: tupleK :: Int -> Kind
+ Language.Haskell.TH.Instances.Internal.Utils: tupleT :: Int -> TypeQ
+ Language.Haskell.TH.Instances.Internal.Utils: tupleTypeName :: Int -> Name
+ Language.Haskell.TH.Instances.Internal.Utils: tySynD :: Name -> [TyVarBndr] -> TypeQ -> DecQ
+ Language.Haskell.TH.Instances.Internal.Utils: tySynEqn :: [TypeQ] -> TypeQ -> TySynEqnQ
+ Language.Haskell.TH.Instances.Internal.Utils: tySynInstD :: Name -> TySynEqnQ -> DecQ
+ Language.Haskell.TH.Instances.Internal.Utils: tyVarSig :: TyVarBndr -> FamilyResultSig
+ Language.Haskell.TH.Instances.Internal.Utils: type Arity = Int
+ Language.Haskell.TH.Instances.Internal.Utils: type BangQ = Q Bang
+ Language.Haskell.TH.Instances.Internal.Utils: type BangTypeQ = Q BangType
+ Language.Haskell.TH.Instances.Internal.Utils: type BodyQ = Q Body
+ Language.Haskell.TH.Instances.Internal.Utils: type ClauseQ = Q Clause
+ Language.Haskell.TH.Instances.Internal.Utils: type ConQ = Q Con
+ Language.Haskell.TH.Instances.Internal.Utils: type Cxt = [Pred]
+ Language.Haskell.TH.Instances.Internal.Utils: type CxtQ = Q Cxt
+ Language.Haskell.TH.Instances.Internal.Utils: type DecQ = Q Dec
+ Language.Haskell.TH.Instances.Internal.Utils: type DecsQ = Q [Dec]
+ Language.Haskell.TH.Instances.Internal.Utils: type DerivClauseQ = Q DerivClause
+ Language.Haskell.TH.Instances.Internal.Utils: type ExpQ = Q Exp
+ Language.Haskell.TH.Instances.Internal.Utils: type FamilyResultSigQ = Q FamilyResultSig
+ Language.Haskell.TH.Instances.Internal.Utils: type FieldExp = (Name, Exp)
+ Language.Haskell.TH.Instances.Internal.Utils: type FieldExpQ = Q FieldExp
+ Language.Haskell.TH.Instances.Internal.Utils: type FieldPat = (Name, Pat)
+ Language.Haskell.TH.Instances.Internal.Utils: type FieldPatQ = Q FieldPat
+ Language.Haskell.TH.Instances.Internal.Utils: type GuardQ = Q Guard
+ Language.Haskell.TH.Instances.Internal.Utils: type InfoQ = Q Info
+ Language.Haskell.TH.Instances.Internal.Utils: type InstanceDec = Dec
+ Language.Haskell.TH.Instances.Internal.Utils: type Kind = Type
+ Language.Haskell.TH.Instances.Internal.Utils: type KindQ = Q Kind
+ Language.Haskell.TH.Instances.Internal.Utils: type MatchQ = Q Match
+ Language.Haskell.TH.Instances.Internal.Utils: type ParentName = Name
+ Language.Haskell.TH.Instances.Internal.Utils: type PatQ = Q Pat
+ Language.Haskell.TH.Instances.Internal.Utils: type PatSynArgsQ = Q PatSynArgs
+ Language.Haskell.TH.Instances.Internal.Utils: type PatSynDirQ = Q PatSynDir
+ Language.Haskell.TH.Instances.Internal.Utils: type PatSynType = Type
+ Language.Haskell.TH.Instances.Internal.Utils: type Pred = Type
+ Language.Haskell.TH.Instances.Internal.Utils: type PredQ = Q Pred
+ Language.Haskell.TH.Instances.Internal.Utils: type RangeQ = Q Range
+ Language.Haskell.TH.Instances.Internal.Utils: type RuleBndrQ = Q RuleBndr
+ Language.Haskell.TH.Instances.Internal.Utils: type SourceStrictnessQ = Q SourceStrictness
+ Language.Haskell.TH.Instances.Internal.Utils: type SourceUnpackednessQ = Q SourceUnpackedness
+ Language.Haskell.TH.Instances.Internal.Utils: type StmtQ = Q Stmt
+ Language.Haskell.TH.Instances.Internal.Utils: type Strict = Bang
+ Language.Haskell.TH.Instances.Internal.Utils: type StrictTypeQ = Q StrictType
+ Language.Haskell.TH.Instances.Internal.Utils: type SumAlt = Int
+ Language.Haskell.TH.Instances.Internal.Utils: type SumArity = Int
+ Language.Haskell.TH.Instances.Internal.Utils: type TExpQ a = Q TExp a
+ Language.Haskell.TH.Instances.Internal.Utils: type TyLitQ = Q TyLit
+ Language.Haskell.TH.Instances.Internal.Utils: type TySynEqnQ = Q TySynEqn
+ Language.Haskell.TH.Instances.Internal.Utils: type TyVarBndrQ = Q TyVarBndr
+ Language.Haskell.TH.Instances.Internal.Utils: type TypeQ = Q Type
+ Language.Haskell.TH.Instances.Internal.Utils: type Unlifted = Bool
+ Language.Haskell.TH.Instances.Internal.Utils: type VarBangTypeQ = Q VarBangType
+ Language.Haskell.TH.Instances.Internal.Utils: type VarStrictTypeQ = Q VarStrictType
+ Language.Haskell.TH.Instances.Internal.Utils: typeAnnotation :: Name -> AnnTarget
+ Language.Haskell.TH.Instances.Internal.Utils: typedRuleVar :: Name -> TypeQ -> RuleBndrQ
+ Language.Haskell.TH.Instances.Internal.Utils: uInfixE :: ExpQ -> ExpQ -> ExpQ -> ExpQ
+ Language.Haskell.TH.Instances.Internal.Utils: uInfixP :: PatQ -> Name -> PatQ -> PatQ
+ Language.Haskell.TH.Instances.Internal.Utils: uInfixT :: TypeQ -> Name -> TypeQ -> TypeQ
+ Language.Haskell.TH.Instances.Internal.Utils: unboundVarE :: Name -> ExpQ
+ Language.Haskell.TH.Instances.Internal.Utils: unboxedSumDataName :: SumAlt -> SumArity -> Name
+ Language.Haskell.TH.Instances.Internal.Utils: unboxedSumE :: ExpQ -> SumAlt -> SumArity -> ExpQ
+ Language.Haskell.TH.Instances.Internal.Utils: unboxedSumP :: PatQ -> SumAlt -> SumArity -> PatQ
+ Language.Haskell.TH.Instances.Internal.Utils: unboxedSumT :: SumArity -> TypeQ
+ Language.Haskell.TH.Instances.Internal.Utils: unboxedSumTypeName :: SumArity -> Name
+ Language.Haskell.TH.Instances.Internal.Utils: unboxedTupE :: [ExpQ] -> ExpQ
+ Language.Haskell.TH.Instances.Internal.Utils: unboxedTupP :: [PatQ] -> PatQ
+ Language.Haskell.TH.Instances.Internal.Utils: unboxedTupleDataName :: Int -> Name
+ Language.Haskell.TH.Instances.Internal.Utils: unboxedTupleT :: Int -> TypeQ
+ Language.Haskell.TH.Instances.Internal.Utils: unboxedTupleTypeName :: Int -> Name
+ Language.Haskell.TH.Instances.Internal.Utils: unidir :: PatSynDirQ
+ Language.Haskell.TH.Instances.Internal.Utils: unpacked :: Q Strict
+ Language.Haskell.TH.Instances.Internal.Utils: unsafe :: Safety
+ Language.Haskell.TH.Instances.Internal.Utils: valD :: PatQ -> BodyQ -> [DecQ] -> DecQ
+ Language.Haskell.TH.Instances.Internal.Utils: valueAnnotation :: Name -> AnnTarget
+ Language.Haskell.TH.Instances.Internal.Utils: varBangType :: Name -> BangTypeQ -> VarBangTypeQ
+ Language.Haskell.TH.Instances.Internal.Utils: varE :: Name -> ExpQ
+ Language.Haskell.TH.Instances.Internal.Utils: varK :: Name -> Kind
+ Language.Haskell.TH.Instances.Internal.Utils: varP :: Name -> PatQ
+ Language.Haskell.TH.Instances.Internal.Utils: varStrictType :: Name -> StrictTypeQ -> VarStrictTypeQ
+ Language.Haskell.TH.Instances.Internal.Utils: varT :: Name -> TypeQ
+ Language.Haskell.TH.Instances.Internal.Utils: viewP :: ExpQ -> PatQ -> PatQ
+ Language.Haskell.TH.Instances.Internal.Utils: wildCardT :: TypeQ
+ Language.Haskell.TH.Instances.Internal.Utils: wildP :: PatQ
+ Language.Haskell.TH.Instances.Internal.Utils: wordPrimL :: Integer -> Lit

Files

intrinsic-superclasses.cabal view
@@ -2,10 +2,10 @@ -- -- see: https://github.com/sol/hpack ----- hash: 32460428f2e391d6d2ae71ef71c376c5316fc2eff4c82315199e39cb10e902e5+-- hash: 8943068b544ca8d720e42dbdc781092d3cb7df39118c00c6e64d2f4979fcd8f9  name:           intrinsic-superclasses-version:        0.3.0.0+version:        0.4.0.0 synopsis:       A quasiquoter for better instance deriving and default methods description:    A template haskell utility inspired by the                 <https://ghc.haskell.org/trac/ghc/wiki/IntrinsicSuperclasses Intrinsic Superclasses Proposal>,@@ -46,7 +46,6 @@       Language.Haskell.TH.Instances       Language.Haskell.TH.Instances.Defaults       Language.Haskell.TH.Instances.Internal-      Language.Haskell.TH.Instances.Internal.Defaults       Language.Haskell.TH.Instances.Internal.Utils   other-modules:       Paths_intrinsic_superclasses
src/Language/Haskell/TH/Instances.hs view
@@ -1,3 +1,2 @@-module Language.Haskell.TH.Instances (instances, defaulting) where+module Language.Haskell.TH.Instances (instances, Defaults(..)) where import Language.Haskell.TH.Instances.Internal-import Language.Haskell.TH.Instances.Defaults
src/Language/Haskell/TH/Instances/Defaults.hs view
@@ -1,33 +1,37 @@-{-# language MagicHash #-}+{-# language DeriveDataTypeable #-} module Language.Haskell.TH.Instances.Defaults where-import Language.Haskell.TH.Instances.Internal.Defaults-import Control.Concurrent.MVar (modifyMVar)+import Data.Data+import Language.Haskell.TH --- | Give a default for a typeclass method that will be utilized by the @instances@ quasiquoter.--- The default will be implicitly brought into scope when the module is imported, like typeclass instances.+-- | Give a default for a typeclass method that will be utilized by the 'instances' quasiquoter.+-- Defaults are declared by giving an [annotation](https://downloads.haskell.org/~ghc/latest/docs/html/users_guide/extending_ghc.html#annotating-types) like: ----- Example:+-- > {-# ann type MySubClass (Defaults 'mySuperclassMethod 'myDefaultDefinition) #-} ----- > module Data.Traversable.Defaults (module X) where--- > import Data.Traversable as X--- > import Data.Functor.Identity as X--- > import Data.Functor.Const as X--- > defaultMethod 'fmap [|\f -> runIdentity . traverse (Identity . f)|]--- > defaultMethod 'foldmap [|\f -> getConst . traverse (Const . f)|]+-- For example, we could modify "Data.Traversable" to work with 'instances' like so: --+-- > {-# language TemplateHaskell #-}+-- > module Data.Traversable where+-- > {- ... normal imports ... -}+-- > import Language.Haskell.TH.Instances.Defaults+-- >+-- > class (Functor t, Foldable t) => Traversable t where ...  -- Same as normal+-- > {-# ANN type Traversable (Defaults 'fmap 'fmapDefault) #-}+-- > {-# ANN type Traversable (Defaults 'foldMap 'foldMapDefault) #-}+-- -- > module MyData where--- > import Data.Traversable.Defaults+-- > import Data.Traversable -- > -- > data Foo a = Foo a a -- > [instances| Travesable Foo where traverse f (Foo a a') = Foo <$> f a <*> f a'|] -- -- will generate ----- > instance Functor Foo where fmap = \f -> runIdentity . traverse (Identity . f)--- > instance Foldable Foo where foldMap = \f -> getConst . traverse (Const . f)+-- > instance Functor Foo where fmap = fmapDefault+-- > instance Foldable Foo where foldMap = foldMapDefault -- > instance Travesable Foo where traverse f (Foo a a') = Foo <$> f a <*> f a'-defaulting :: Name -> Q Exp -> Q [Dec]-defaulting n qe = do-  e <- qe-  runIO $ modifyMVar defaults# (\m -> return (insert n e m,()))-  return []+data Defaults = Defaults+  {defining :: Name -- ^ The name of the superclass method being provided+  ,definition :: Name -- ^ The name of a function implementing the superclass method+  }+  deriving (Data,Typeable,Show)
src/Language/Haskell/TH/Instances/Internal.hs view
@@ -1,4 +1,5 @@ {-# language ScopedTypeVariables #-}+{-# language RecordWildCards #-} {-# language TupleSections #-} {-# language FlexibleInstances #-} {-# language MultiParamTypeClasses #-}@@ -12,7 +13,7 @@  import Language.Haskell.TH as X import Language.Haskell.TH.Instances.Internal.Utils as X-import Language.Haskell.TH.Instances.Internal.Defaults as X+import Language.Haskell.TH.Instances.Defaults as X import Language.Haskell.TH.Syntax as X hiding (lift) import Language.Haskell.Meta.Parse as X (parseDecs) import Language.Haskell.TH.Quote as X (QuasiQuoter(..))@@ -26,11 +27,16 @@ -- -- Example: --+-- >  {-# language TemplateHaskell,QuasiQuotes,FlexibleInstances,UndecidableInstances #-}+-- >  import Prelude hiding (Monoid(..))+-- >  import Language.Haskell.TH.Instances+-- > -- >  class Semigroup a where mappend :: a -> a -> a -- >  class Semigroup a => Commutative a -- >  class Semigroup a => Monoid a where mempty :: a -- >  class Monoid a => Group a where inverse :: a -> a -- >  class (Commutative a, Group a) => CommutativeGroup a+-- >  $(return []) -- Only needed if classes are defined in the same module, to make sure they're in scope below -- >  [instances| Num a => CommutativeGroup a where -- >      mempty = fromInteger 0 -- >      mappend a b = a + b@@ -61,13 +67,14 @@     declaredMethods' <- M.fromList <$> traverse globalizeDef declaredMethods     superclasses <- getTransitiveSuperclassNames className -    requiredMethods <- fold <$> M.traverseWithKey (\k _ -> getClassMethods k) superclasses+    requiredMethods <- fold <$> M.traverseWithKey (\k _ -> getClassMethods k) superclasses -- Methods that will eventually need to be filled in     let badMethods = filter (\x -> not $ M.member x requiredMethods) $ M.keys declaredMethods'     unless (null badMethods) $       error $ "splitInstances: Trying to declare methods not in the superclass heirarchy\n"            ++ unlines (map show badMethods) -    defaultMethods <- M.traverseMaybeWithKey (\k _ -> getDefault k)  requiredMethods+    defaultMethods <- (`M.intersection` requiredMethods) <$> transitiveProvidedDefaults className+    {-defaultMethods <- M.traverseMaybeWithKey (\k _ -> getDefault k)  requiredMethods-}     let declaredMethods'' = declaredMethods' `M.union` defaultMethods      superclassHasInstance <- M.traverseWithKey (\k _ -> isInstance k [instancesFor]) superclasses@@ -150,3 +157,25 @@ -- > occName ''Show === "Show" occName :: Name -> String occName (Name (OccName s) _) = s++-- | reify the names of all transitive superclasses for a class name, including itself+getTransitiveSuperclassNames' :: Name -> Q (Map Name Int)+getTransitiveSuperclassNames' = execWriterT . go 0 where+  go i n = do+    tell $ M.singleton n i+    traverse_ (go (i+1)) =<< lift (getSuperclassNames n)++transitiveProvidedDefaults :: Name -> Q (Map Name Dec)+transitiveProvidedDefaults n = do+  sc <- M.toList <$> getTransitiveSuperclassNames' n+  defaultsMap <- M.map fst . M.unionsWith lowest -- Defaults from deeper subclasses take precidence+             <$> mapM (\(n',i) -> M.map (,i) <$> providedDefaults n') sc+  return $ M.mapWithKey name_dec defaultsMap+  where name_dec n' def = ValD (VarP n') (NormalB (VarE def)) []+        lowest a@(_,i) b@(_,i') = if i <= i' then a else b++-- | Get the default superclass method implementations provided by a subclass+providedDefaults :: Name -> Q (Map Name Name)+providedDefaults (AnnLookupName -> n) = do+  defaults <- reifyAnnotations n+  return $ M.fromList [(defining,definition) | Defaults{..} <- defaults]
− src/Language/Haskell/TH/Instances/Internal/Defaults.hs
@@ -1,18 +0,0 @@-{-# language MagicHash #-}-module Language.Haskell.TH.Instances.Internal.Defaults (defaults#,getDefault, module X) where-import Language.Haskell.TH.Instances.Internal.Utils as X-import Control.Concurrent.MVar (MVar,newMVar,readMVar)-import GHC.Conc (pseq)-import System.IO.Unsafe---- | Global map from method names to definitions.--- Do not use directly, preferring 'defaulting' and 'getDefault'-defaults# :: MVar (Map Name Exp)-{-# noinline defaults# #-}-defaults# = m `pseq` unsafePerformIO (newMVar m) where m = mempty---- | Generate a method definition for provided 'Name' if a default exists in scope-getDefault :: Name -> Q (Maybe Dec)-getDefault n = runIO $ fmap exp_dec . mapLookup n <$> readMVar defaults#-  where exp_dec e = ValD (VarP n) (NormalB e) []-
src/Language/Haskell/TH/Instances/Internal/Utils.hs view
@@ -1,3 +1,4 @@+{-# language DeriveDataTypeable #-} module Language.Haskell.TH.Instances.Internal.Utils   (module Language.Haskell.TH.Instances.Internal.Utils   ,module X) where