Safe Haskell | None |
---|---|
Language | Haskell98 |
This module is about types that can be defined in Haskell, but which must be wired into the compiler nonetheless. C.f module TysPrim
- wiredInTyCons :: [TyCon]
- boolTy :: Type
- boolTyCon :: TyCon
- boolTyCon_RDR :: RdrName
- boolTyConName :: Name
- trueDataCon :: DataCon
- trueDataConId :: Id
- true_RDR :: RdrName
- falseDataCon :: DataCon
- falseDataConId :: Id
- false_RDR :: RdrName
- promotedBoolTyCon :: TyCon
- promotedFalseDataCon :: TyCon
- promotedTrueDataCon :: TyCon
- ltDataCon :: DataCon
- ltDataConId :: Id
- eqDataCon :: DataCon
- eqDataConId :: Id
- gtDataCon :: DataCon
- gtDataConId :: Id
- charTyCon :: TyCon
- charDataCon :: DataCon
- charTyCon_RDR :: RdrName
- charTy :: Type
- stringTy :: Type
- charTyConName :: Name
- integerGmpSDataCon :: DataCon
- doubleTyCon :: TyCon
- doubleDataCon :: DataCon
- doubleTy :: Type
- doubleTyConName :: Name
- floatTyCon :: TyCon
- floatDataCon :: DataCon
- floatTy :: Type
- floatTyConName :: Name
- intTyCon :: TyCon
- intDataCon :: DataCon
- intTyCon_RDR :: RdrName
- intDataCon_RDR :: RdrName
- intTyConName :: Name
- intTy :: Type
- wordTyCon :: TyCon
- wordDataCon :: DataCon
- wordTyConName :: Name
- wordTy :: Type
- listTyCon :: TyCon
- nilDataCon :: DataCon
- nilDataConName :: Name
- consDataCon :: DataCon
- consDataConName :: Name
- listTyCon_RDR :: RdrName
- consDataCon_RDR :: RdrName
- listTyConName :: Name
- mkListTy :: Type -> Type
- mkPromotedListTy :: Type -> Type
- mkTupleTy :: TupleSort -> [Type] -> Type
- mkBoxedTupleTy :: [Type] -> Type
- tupleTyCon :: TupleSort -> Arity -> TyCon
- tupleCon :: TupleSort -> Arity -> DataCon
- promotedTupleTyCon :: TupleSort -> Arity -> TyCon
- promotedTupleDataCon :: TupleSort -> Arity -> TyCon
- unitTyCon :: TyCon
- unitDataCon :: DataCon
- unitDataConId :: Id
- pairTyCon :: TyCon
- unboxedUnitTyCon :: TyCon
- unboxedUnitDataCon :: DataCon
- unboxedSingletonTyCon :: TyCon
- unboxedSingletonDataCon :: DataCon
- unboxedPairTyCon :: TyCon
- unboxedPairDataCon :: DataCon
- unitTy :: Type
- typeNatKindCon :: TyCon
- typeNatKind :: Kind
- typeSymbolKindCon :: TyCon
- typeSymbolKind :: Kind
- mkPArrTy :: Type -> Type
- parrTyCon :: TyCon
- parrFakeCon :: Arity -> DataCon
- isPArrTyCon :: TyCon -> Bool
- isPArrFakeCon :: DataCon -> Bool
- parrTyCon_RDR :: RdrName
- parrTyConName :: Name
- eqTyCon_RDR :: RdrName
- eqTyCon :: TyCon
- eqTyConName :: Name
- eqBoxDataCon :: DataCon
- coercibleTyCon :: TyCon
- coercibleDataCon :: DataCon
- coercibleClass :: Class
- mkWiredInTyConName :: BuiltInSyntax -> Module -> FastString -> Unique -> TyCon -> Name
All wired in things
wiredInTyCons :: [TyCon]Source
Bool
Ordering
Char
Double
Float
Int
Word
List
mkPromotedListTy :: Type -> TypeSource
Tuples
mkBoxedTupleTy :: [Type] -> TypeSource
Build the type of a small tuple that holds the specified type of thing
tupleTyCon :: TupleSort -> Arity -> TyConSource
promotedTupleTyCon :: TupleSort -> Arity -> TyConSource
promotedTupleDataCon :: TupleSort -> Arity -> TyConSource
Unit
Kinds
Parallel arrays
mkPArrTy :: Type -> TypeSource
Construct a type representing the application of the parallel array constructor
Represents the type constructor of parallel arrays
- This must match the definition in
PrelPArr
NB: Although the constructor is given here, it will not be accessible in
user code as it is not in the environment of any compiled module except
PrelPArr
.
parrFakeCon :: Arity -> DataConSource
Fake array constructors
- These constructors are never really used to represent array values; however, they are very convenient during desugaring (and, in particular, in the pattern matching compiler) to treat array pattern just like yet another constructor pattern
isPArrTyCon :: TyCon -> BoolSource
Check whether a type constructor is the constructor for parallel arrays
isPArrFakeCon :: DataCon -> BoolSource
Checks whether a data constructor is a fake constructor for parallel arrays
Equality predicates
mkWiredInTyConName :: BuiltInSyntax -> Module -> FastString -> Unique -> TyCon -> NameSource