Safe Haskell	None
Language	Haskell2010

Language.Haskell.Extensions

Description

The module exports the set of recognized language extensions, mostly corresponding to GHC extensions

Synopsis

data Extension
- = AllowAmbiguousTypes
- | AlternativeLayoutRule
- | AlternativeLayoutRuleTransitional
- | ApplicativeDo
- | Arrows
- | AutoDeriveTypeable
- | BangDataFields
- | BangPatterns
- | BinaryLiterals
- | BlockArguments
- | CApiFFI
- | CUSKs
- | ConstrainedClassMethods
- | ConstraintsAreTypes
- | ConstraintKinds
- | Cpp
- | DataKinds
- | DatatypeContexts
- | DeepSubsumption
- | DefaultSignatures
- | DeriveAnyClass
- | DeriveDataTypeable
- | DeriveFoldable
- | DeriveFunctor
- | DeriveGeneric
- | DeriveLift
- | DeriveTraversable
- | DerivingStrategies
- | DerivingVia
- | DisambiguateRecordFields
- | DoAndIfThenElse
- | DuplicateRecordFields
- | EmptyCase
- | EmptyDataDeclarations
- | EmptyDataDeriving
- | EqualityConstraints
- | ExistentialQuantification
- | ExplicitForAll
- | ExplicitNamespaces
- | ExtendedDefaultRules
- | ExtendedLiterals
- | FieldSelectors
- | FlexibleContexts
- | FlexibleInstances
- | ForeignFunctionInterface
- | FunctionalDependencies
- | GADTSyntax
- | GADTs
- | GHC2021
- | GHC2024
- | GHCForeignImportPrim
- | GeneralizedNewtypeDeriving
- | Haskell2010
- | Haskell98
- | HexFloatLiterals
- | IdentifierSyntax
- | ImplicitParameters
- | ImplicitPrelude
- | ImportQualifiedPost
- | ImpredicativeTypes
- | IncoherentInstances
- | InferredTypeVariables
- | InstanceSigs
- | InterruptibleFFI
- | JavaScriptFFI
- | KindSignatures
- | LambdaCase
- | LexicalNegation
- | LiberalTypeSynonyms
- | LinearTypes
- | ListTuplePuns
- | MagicHash
- | MonadComprehensions
- | MonadFailDesugaring
- | MonoLocalBinds
- | MonoPatBinds
- | MonomorphismRestriction
- | MultiParamTypeClasses
- | MultiParameterConstraints
- | MultiWayIf
- | NPlusKPatterns
- | NamedDefaults
- | NamedFieldPuns
- | NamedWildCards
- | NegativeLiterals
- | NondecreasingIndentation
- | NullaryTypeClasses
- | NumDecimals
- | NumericUnderscores
- | OverlappingInstances
- | OverloadedLabels
- | OverloadedLists
- | OverloadedRecordDot
- | OverloadedRecordUpdate
- | OverloadedStrings
- | PackageImports
- | ParallelArrays
- | ParallelListComp
- | ParallelListComprehensions
- | ParenthesizedTypeOperators
- | GratuitouslyParenthesizedTypes
- | PartialTypeSignatures
- | PatternGuards
- | PatternSynonyms
- | PolyKinds
- | PostfixOperators
- | QualifiedDo
- | QuantifiedConstraints
- | QuasiQuotes
- | RankNTypes
- | RebindableSyntax
- | RecordWildCards
- | RecursiveDo
- | RelaxedLayout
- | RelaxedPolyRec
- | RequiredTypeArguments
- | RoleAnnotations
- | Safe
- | SafeImports
- | ScopedTypeVariables
- | SpaceSensitiveOperators
- | StandaloneDeriving
- | StandaloneKindSignatures
- | StarIsType
- | StaticPointers
- | Strict
- | StrictData
- | TemplateHaskell
- | TemplateHaskellQuotes
- | TraditionalRecordSyntax
- | TransformListComp
- | Trustworthy
- | TupleSections
- | TypeAbstractions
- | TypeAbstractionsOrApplicationsInConstructorPatterns
- | TypeApplications
- | TypeData
- | TypeFamilies
- | TypeFamilyDependencies
- | TypeInType
- | TypeOperators
- | TypeSynonymInstances
- | TypeVariableConstraints
- | UnboxedSums
- | UnboxedTuples
- | UndecidableInstances
- | UndecidableSuperClasses
- | UnicodeSyntax
- | UnliftedDatatypes
- | UnliftedFFITypes
- | UnliftedNewtypes
- | Unsafe
- | ViewPatterns
- | VisibleDependedentQuantification
newtype ExtensionSwitch = ExtensionSwitch (Extension, Bool)
type On (e :: Extension) = 'ExtensionSwitch '(e, 'True)
type Off (e :: Extension) = 'ExtensionSwitch '(e, 'False)
on :: Extension -> ExtensionSwitch
off :: Extension -> ExtensionSwitch
allExtensions :: Set Extension
byName :: (IsString t, Ord t) => Map t Extension
includedByDefault :: Set Extension
implications :: Map Extension (Map Extension Bool)
inverseImplications :: Map Extension (Set Extension)
languageVersions :: Set Extension
partitionContradictory :: Set ExtensionSwitch -> (Set ExtensionSwitch, Map Extension Bool)
switchesByName :: (IsString t, Ord t, Semigroup t) => Map t ExtensionSwitch
withImplications :: Map Extension Bool -> Map Extension Bool

Documentation

data Extension Source #

The enumeration of all language extensions

Constructors

AllowAmbiguousTypes
AlternativeLayoutRule
AlternativeLayoutRuleTransitional
ApplicativeDo
Arrows
AutoDeriveTypeable
BangDataFields
BangPatterns	active but unnamed in GHC and Report
BinaryLiterals
BlockArguments
CApiFFI
CUSKs
ConstrainedClassMethods
ConstraintsAreTypes
ConstraintKinds	active but unnamed in GHC
Cpp
DataKinds
DatatypeContexts
DeepSubsumption
DefaultSignatures
DeriveAnyClass
DeriveDataTypeable
DeriveFoldable
DeriveFunctor
DeriveGeneric
DeriveLift
DeriveTraversable
DerivingStrategies
DerivingVia
DisambiguateRecordFields
DoAndIfThenElse
DuplicateRecordFields
EmptyCase
EmptyDataDeclarations
EmptyDataDeriving
EqualityConstraints
ExistentialQuantification	unnamed in GHC
ExplicitForAll
ExplicitNamespaces
ExtendedDefaultRules
ExtendedLiterals
FieldSelectors
FlexibleContexts
FlexibleInstances
ForeignFunctionInterface
FunctionalDependencies
GADTSyntax
GADTs
GHC2021
GHC2024
GHCForeignImportPrim
GeneralizedNewtypeDeriving
Haskell2010
Haskell98
HexFloatLiterals
IdentifierSyntax
ImplicitParameters	active but unnamed in GHC
ImplicitPrelude
ImportQualifiedPost
ImpredicativeTypes
IncoherentInstances
InferredTypeVariables
InstanceSigs	unnamed in GHC
InterruptibleFFI
JavaScriptFFI
KindSignatures
LambdaCase
LexicalNegation
LiberalTypeSynonyms
LinearTypes
ListTuplePuns
MagicHash
MonadComprehensions
MonadFailDesugaring
MonoLocalBinds
MonoPatBinds
MonomorphismRestriction
MultiParamTypeClasses
MultiParameterConstraints
MultiWayIf	active unnamed in GHC
NPlusKPatterns
NamedDefaults
NamedFieldPuns
NamedWildCards
NegativeLiterals
NondecreasingIndentation
NullaryTypeClasses
NumDecimals
NumericUnderscores
OverlappingInstances
OverloadedLabels
OverloadedLists
OverloadedRecordDot
OverloadedRecordUpdate
OverloadedStrings
PackageImports
ParallelArrays
ParallelListComp
ParallelListComprehensions
ParenthesizedTypeOperators
GratuitouslyParenthesizedTypes	active but unnamed in GHC
PartialTypeSignatures	active but unnamed in GHC
PatternGuards
PatternSynonyms
PolyKinds
PostfixOperators
QualifiedDo
QuantifiedConstraints
QuasiQuotes
RankNTypes
RebindableSyntax
RecordWildCards
RecursiveDo
RelaxedLayout
RelaxedPolyRec
RequiredTypeArguments
RoleAnnotations
Safe
SafeImports
ScopedTypeVariables
SpaceSensitiveOperators
StandaloneDeriving
StandaloneKindSignatures
StarIsType
StaticPointers
Strict
StrictData
TemplateHaskell
TemplateHaskellQuotes
TraditionalRecordSyntax
TransformListComp
Trustworthy
TupleSections
TypeAbstractions
TypeAbstractionsOrApplicationsInConstructorPatterns
TypeApplications	nameless
TypeData
TypeFamilies
TypeFamilyDependencies
TypeInType
TypeOperators
TypeSynonymInstances
TypeVariableConstraints
UnboxedSums	active but unnamed in GHC
UnboxedTuples
UndecidableInstances
UndecidableSuperClasses
UnicodeSyntax
UnliftedDatatypes
UnliftedFFITypes
UnliftedNewtypes
Unsafe
ViewPatterns
VisibleDependedentQuantification

Instances

Instances details

Eq Extension Source #
Instance details Defined in Language.Haskell.Extensions Methods (==) :: Extension -> Extension -> Bool # (/=) :: Extension -> Extension -> Bool #
Ord Extension Source #
Instance details Defined in Language.Haskell.Extensions Methods compare :: Extension -> Extension -> Ordering # (<) :: Extension -> Extension -> Bool # (<=) :: Extension -> Extension -> Bool # (>) :: Extension -> Extension -> Bool # (>=) :: Extension -> Extension -> Bool # max :: Extension -> Extension -> Extension # min :: Extension -> Extension -> Extension #
Data Extension Source #
Instance details Defined in Language.Haskell.Extensions Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Extension -> c Extension # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Extension # toConstr :: Extension -> Constr # dataTypeOf :: Extension -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Extension) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Extension) # gmapT :: (forall b. Data b => b -> b) -> Extension -> Extension # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Extension -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Extension -> r # gmapQ :: (forall d. Data d => d -> u) -> Extension -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Extension -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Extension -> m Extension # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Extension -> m Extension # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Extension -> m Extension #
Bounded Extension Source #	nameless
Instance details Defined in Language.Haskell.Extensions Methods minBound :: Extension # maxBound :: Extension #
Enum Extension Source #
Instance details Defined in Language.Haskell.Extensions Methods succ :: Extension -> Extension # pred :: Extension -> Extension # toEnum :: Int -> Extension # fromEnum :: Extension -> Int # enumFrom :: Extension -> [Extension] # enumFromThen :: Extension -> Extension -> [Extension] # enumFromTo :: Extension -> Extension -> [Extension] # enumFromThenTo :: Extension -> Extension -> Extension -> [Extension] #
Read Extension Source #
Instance details Defined in Language.Haskell.Extensions Methods readsPrec :: Int -> ReadS Extension # readList :: ReadS [Extension] # readPrec :: ReadPrec Extension # readListPrec :: ReadPrec [Extension] #
Show Extension Source #
Instance details Defined in Language.Haskell.Extensions Methods showsPrec :: Int -> Extension -> ShowS # show :: Extension -> String # showList :: [Extension] -> ShowS #
Memoizable (Set Extension) Source #
Instance details Defined in Language.Haskell.Extensions Methods memoize :: (Set Extension -> v) -> Set Extension -> v #
ExtendedWith '['BangPatterns] Language Source #
Instance details Defined in Language.Haskell.Extensions.AST Methods build :: forall l (d :: NodeWrap) (s :: NodeWrap). Construct '['BangPatterns] Language l d s Source #
ExtendedWith '['CApiFFI] Language Source #
Instance details Defined in Language.Haskell.Extensions.AST Methods build :: forall l (d :: NodeWrap) (s :: NodeWrap). Construct '['CApiFFI] Language l d s Source #
ExtendedWith '['DefaultSignatures] Language Source #
Instance details Defined in Language.Haskell.Extensions.AST Methods build :: forall l (d :: NodeWrap) (s :: NodeWrap). Construct '['DefaultSignatures] Language l d s Source #
ExtendedWith '['DerivingStrategies] Language Source #
Instance details Defined in Language.Haskell.Extensions.AST Methods build :: forall l (d :: NodeWrap) (s :: NodeWrap). Construct '['DerivingStrategies] Language l d s Source #
ExtendedWith '['DerivingVia] Language Source #
Instance details Defined in Language.Haskell.Extensions.AST Methods build :: forall l (d :: NodeWrap) (s :: NodeWrap). Construct '['DerivingVia] Language l d s Source #
ExtendedWith '['ExplicitNamespaces] Language Source #
Instance details Defined in Language.Haskell.Extensions.AST Methods build :: forall l (d :: NodeWrap) (s :: NodeWrap). Construct '['ExplicitNamespaces] Language l d s Source #
ExtendedWith '['ExtendedLiterals] Language Source #
Instance details Defined in Language.Haskell.Extensions.AST Methods build :: forall l (d :: NodeWrap) (s :: NodeWrap). Construct '['ExtendedLiterals] Language l d s Source #
ExtendedWith '['FunctionalDependencies] Language Source #
Instance details Defined in Language.Haskell.Extensions.AST Methods build :: forall l (d :: NodeWrap) (s :: NodeWrap). Construct '['FunctionalDependencies] Language l d s Source #
ExtendedWith '['GADTs, 'TypeData] Language Source #
Instance details Defined in Language.Haskell.Extensions.AST Methods build :: forall l (d :: NodeWrap) (s :: NodeWrap). Construct '['GADTs, 'TypeData] Language l d s Source #
ExtendedWith '['ImplicitParameters] Language Source #
Instance details Defined in Language.Haskell.Extensions.AST Methods build :: forall l (d :: NodeWrap) (s :: NodeWrap). Construct '['ImplicitParameters] Language l d s Source #
ExtendedWith '['InterruptibleFFI] Language Source #
Instance details Defined in Language.Haskell.Extensions.AST Methods build :: forall l (d :: NodeWrap) (s :: NodeWrap). Construct '['InterruptibleFFI] Language l d s Source #
ExtendedWith '['LambdaCase] Language Source #
Instance details Defined in Language.Haskell.Extensions.AST Methods build :: forall l (d :: NodeWrap) (s :: NodeWrap). Construct '['LambdaCase] Language l d s Source #
ExtendedWith '['MagicHash] Language Source #
Instance details Defined in Language.Haskell.Extensions.AST Methods build :: forall l (d :: NodeWrap) (s :: NodeWrap). Construct '['MagicHash] Language l d s Source #
ExtendedWith '['NPlusKPatterns] Language Source #
Instance details Defined in Language.Haskell.Extensions.AST Methods build :: forall l (d :: NodeWrap) (s :: NodeWrap). Construct '['NPlusKPatterns] Language l d s Source #
ExtendedWith '['NamedDefaults] Language Source #
Instance details Defined in Language.Haskell.Extensions.AST Methods build :: forall l (d :: NodeWrap) (s :: NodeWrap). Construct '['NamedDefaults] Language l d s Source #
ExtendedWith '['NamedFieldPuns] Language Source #
Instance details Defined in Language.Haskell.Extensions.AST Methods build :: forall l (d :: NodeWrap) (s :: NodeWrap). Construct '['NamedFieldPuns] Language l d s Source #
ExtendedWith '['ParallelListComprehensions] Language Source #
Instance details Defined in Language.Haskell.Extensions.AST Methods build :: forall l (d :: NodeWrap) (s :: NodeWrap). Construct '['ParallelListComprehensions] Language l d s Source #
ExtendedWith '['PatternSynonyms] Language Source #
Instance details Defined in Language.Haskell.Extensions.AST Methods build :: forall l (d :: NodeWrap) (s :: NodeWrap). Construct '['PatternSynonyms] Language l d s Source #
ExtendedWith '['QualifiedDo, 'RecursiveDo] Language Source #
Instance details Defined in Language.Haskell.Extensions.AST Methods build :: forall l (d :: NodeWrap) (s :: NodeWrap). Construct '['QualifiedDo, 'RecursiveDo] Language l d s Source #
ExtendedWith '['QualifiedDo] Language Source #
Instance details Defined in Language.Haskell.Extensions.AST Methods build :: forall l (d :: NodeWrap) (s :: NodeWrap). Construct '['QualifiedDo] Language l d s Source #
ExtendedWith '['RecordWildCards] Language Source #
Instance details Defined in Language.Haskell.Extensions.AST Methods build :: forall l (d :: NodeWrap) (s :: NodeWrap). Construct '['RecordWildCards] Language l d s Source #
ExtendedWith '['RecursiveDo] Language Source #
Instance details Defined in Language.Haskell.Extensions.AST Methods build :: forall l (d :: NodeWrap) (s :: NodeWrap). Construct '['RecursiveDo] Language l d s Source #
ExtendedWith '['StandaloneDeriving] Language Source #
Instance details Defined in Language.Haskell.Extensions.AST Methods build :: forall l (d :: NodeWrap) (s :: NodeWrap). Construct '['StandaloneDeriving] Language l d s Source #
ExtendedWith '['Strict] Language Source #
Instance details Defined in Language.Haskell.Extensions.AST Methods build :: forall l (d :: NodeWrap) (s :: NodeWrap). Construct '['Strict] Language l d s Source #
ExtendedWith '['StrictData] Language Source #
Instance details Defined in Language.Haskell.Extensions.AST Methods build :: forall l (d :: NodeWrap) (s :: NodeWrap). Construct '['StrictData] Language l d s Source #
ExtendedWith '['TupleSections] Language Source #
Instance details Defined in Language.Haskell.Extensions.AST Methods build :: forall l (d :: NodeWrap) (s :: NodeWrap). Construct '['TupleSections] Language l d s Source #
ExtendedWith '['TypeAbstractions] Language Source #
Instance details Defined in Language.Haskell.Extensions.AST Methods build :: forall l (d :: NodeWrap) (s :: NodeWrap). Construct '['TypeAbstractions] Language l d s Source #
ExtendedWith '['TypeData] Language Source #
Instance details Defined in Language.Haskell.Extensions.AST Methods build :: forall l (d :: NodeWrap) (s :: NodeWrap). Construct '['TypeData] Language l d s Source #
ExtendedWith '['UnboxedSums] Language Source #
Instance details Defined in Language.Haskell.Extensions.AST Methods build :: forall l (d :: NodeWrap) (s :: NodeWrap). Construct '['UnboxedSums] Language l d s Source #
ExtendedWith '['UnboxedTuples] Language Source #
Instance details Defined in Language.Haskell.Extensions.AST Methods build :: forall l (d :: NodeWrap) (s :: NodeWrap). Construct '['UnboxedTuples] Language l d s Source #
ExtendedWith '['ViewPatterns] Language Source #
Instance details Defined in Language.Haskell.Extensions.AST Methods build :: forall l (d :: NodeWrap) (s :: NodeWrap). Construct '['ViewPatterns] Language l d s Source #
(SameWrap 'NPlusKPatterns '['ViewPatterns] pos s λ l2, Haskell l2, Supports 'NPlusKPatterns λ, Supports 'ViewPatterns l2, FieldPattern l2 ~ FieldPattern l2, QualifiedName l2 ~ QualifiedName l2, ModuleName l2 ~ ModuleName l2, Name l2 ~ Name l2) => WrappedTranslation (ReformulationOf (On 'NPlusKPatterns) '[On 'ViewPatterns] λ l2 pos s) Pattern Source #
Instance details Defined in Language.Haskell.Extensions.Reformulator Methods translateWrapped :: ReformulationOf (On 'NPlusKPatterns) '[On 'ViewPatterns] λ l2 pos s -> Wrap (ReformulationOf (On 'NPlusKPatterns) '[On 'ViewPatterns] λ l2 pos s) (Pattern (Origin (ReformulationOf (On 'NPlusKPatterns) '[On 'ViewPatterns] λ l2 pos s)) (Origin (ReformulationOf (On 'NPlusKPatterns) '[On 'ViewPatterns] λ l2 pos s)) (Wrap (ReformulationOf (On 'NPlusKPatterns) '[On 'ViewPatterns] λ l2 pos s)) (Wrap (ReformulationOf (On 'NPlusKPatterns) '[On 'ViewPatterns] λ l2 pos s))) -> Wrap (ReformulationOf (On 'NPlusKPatterns) '[On 'ViewPatterns] λ l2 pos s) (Pattern (Target (ReformulationOf (On 'NPlusKPatterns) '[On 'ViewPatterns] λ l2 pos s)) (Origin (ReformulationOf (On 'NPlusKPatterns) '[On 'ViewPatterns] λ l2 pos s)) (Wrap (ReformulationOf (On 'NPlusKPatterns) '[On 'ViewPatterns] λ l2 pos s)) (Wrap (ReformulationOf (On 'NPlusKPatterns) '[On 'ViewPatterns] λ l2 pos s))) Source #
(SameWrap 'RecordWildCards '['NamedFieldPuns] pos s λ l, Supports 'RecordWildCards λ, Haskell l, FieldBinding l ~ FieldBinding l, QualifiedName l ~ QualifiedName l, ModuleName l ~ ModuleName l, Name l ~ Name l) => WrappedTranslation (ReformulationOf (On 'RecordWildCards) '[On 'NamedFieldPuns] λ l pos s) Expression Source #
Instance details Defined in Language.Haskell.Extensions.Reformulator Methods translateWrapped :: ReformulationOf (On 'RecordWildCards) '[On 'NamedFieldPuns] λ l pos s -> Wrap (ReformulationOf (On 'RecordWildCards) '[On 'NamedFieldPuns] λ l pos s) (Expression (Origin (ReformulationOf (On 'RecordWildCards) '[On 'NamedFieldPuns] λ l pos s)) (Origin (ReformulationOf (On 'RecordWildCards) '[On 'NamedFieldPuns] λ l pos s)) (Wrap (ReformulationOf (On 'RecordWildCards) '[On 'NamedFieldPuns] λ l pos s)) (Wrap (ReformulationOf (On 'RecordWildCards) '[On 'NamedFieldPuns] λ l pos s))) -> Wrap (ReformulationOf (On 'RecordWildCards) '[On 'NamedFieldPuns] λ l pos s) (Expression (Target (ReformulationOf (On 'RecordWildCards) '[On 'NamedFieldPuns] λ l pos s)) (Origin (ReformulationOf (On 'RecordWildCards) '[On 'NamedFieldPuns] λ l pos s)) (Wrap (ReformulationOf (On 'RecordWildCards) '[On 'NamedFieldPuns] λ l pos s)) (Wrap (ReformulationOf (On 'RecordWildCards) '[On 'NamedFieldPuns] λ l pos s))) Source #
(SameWrap 'RecordWildCards '['NamedFieldPuns] pos s λ l2, Supports 'RecordWildCards λ, FieldPattern l2 ~ FieldPattern l2, QualifiedName l2 ~ QualifiedName l2, ModuleName l2 ~ ModuleName l2, Name l2 ~ Name l2) => WrappedTranslation (ReformulationOf (On 'RecordWildCards) '[On 'NamedFieldPuns] λ l2 pos s) Pattern Source #
Instance details Defined in Language.Haskell.Extensions.Reformulator Methods translateWrapped :: ReformulationOf (On 'RecordWildCards) '[On 'NamedFieldPuns] λ l2 pos s -> Wrap (ReformulationOf (On 'RecordWildCards) '[On 'NamedFieldPuns] λ l2 pos s) (Pattern (Origin (ReformulationOf (On 'RecordWildCards) '[On 'NamedFieldPuns] λ l2 pos s)) (Origin (ReformulationOf (On 'RecordWildCards) '[On 'NamedFieldPuns] λ l2 pos s)) (Wrap (ReformulationOf (On 'RecordWildCards) '[On 'NamedFieldPuns] λ l2 pos s)) (Wrap (ReformulationOf (On 'RecordWildCards) '[On 'NamedFieldPuns] λ l2 pos s))) -> Wrap (ReformulationOf (On 'RecordWildCards) '[On 'NamedFieldPuns] λ l2 pos s) (Pattern (Target (ReformulationOf (On 'RecordWildCards) '[On 'NamedFieldPuns] λ l2 pos s)) (Origin (ReformulationOf (On 'RecordWildCards) '[On 'NamedFieldPuns] λ l2 pos s)) (Wrap (ReformulationOf (On 'RecordWildCards) '[On 'NamedFieldPuns] λ l2 pos s)) (Wrap (ReformulationOf (On 'RecordWildCards) '[On 'NamedFieldPuns] λ l2 pos s))) Source #
data Construct '['BangPatterns] λ l d s Source #
Instance details Defined in Language.Haskell.Extensions.Abstract data Construct '['BangPatterns] λ l d s = BangPatternConstruction { bangPattern :: s (Pattern l l d d) -> Pattern λ l d s }
data Construct '['CApiFFI] λ l d s Source #
Instance details Defined in Language.Haskell.Extensions.Abstract data Construct '['CApiFFI] λ l d s = CApiFFIConstruction { cApiCall :: CallingConvention λ }
data Construct '['DefaultSignatures] λ l d s Source #
Instance details Defined in Language.Haskell.Extensions.Abstract data Construct '['DefaultSignatures] λ l d s = DefaultSignatureConstruction { defaultMethodSignature :: Name λ -> s (Context l l d d) -> s (Type l l d d) -> Declaration λ l d s }
data Construct '['DerivingStrategies] λ l d s Source #
Instance details Defined in Language.Haskell.Extensions.Abstract data Construct '['DerivingStrategies] λ l d s = DerivingStrategiesConstruction { defaultStrategy :: DerivingStrategy λ l d s stockStrategy :: DerivingStrategy λ l d s newtypeStrategy :: DerivingStrategy λ l d s anyClassStrategy :: DerivingStrategy λ l d s strategicDerive :: s (DerivingStrategy l l d d) -> [s (Type l l d d)] -> DerivingClause λ l d s standaloneStrategicDerivingDeclaration :: Supports 'StandaloneDeriving λ => s (DerivingStrategy l l d d) -> [TypeVarBinding λ l d s] -> s (Context l l d d) -> s (ClassInstanceLHS l l d d) -> Declaration λ l d s }
data Construct '['DerivingVia] λ l d s Source #
Instance details Defined in Language.Haskell.Extensions.Abstract data Construct '['DerivingVia] λ l d s = DerivingViaConstruction { deriveVia :: [s (Type l l d d)] -> s (Type l l d d) -> DerivingClause λ l d s derivingViaStrategy :: s (Type l l d d) -> DerivingStrategy λ l d s }
data Construct '['ExplicitNamespaces] λ l d s Source #
Instance details Defined in Language.Haskell.Extensions.Abstract data Construct '['ExplicitNamespaces] λ l d s = ExplicitNamespacesConstruction { explicitlyNamespacedMemberList :: [ModuleMember λ] -> Members λ defaultMember :: Name λ -> ModuleMember λ patternMember :: Name λ -> ModuleMember λ typeMember :: Name λ -> ModuleMember λ explicitTypeFixityDeclaration :: Associativity λ -> Maybe Int -> NonEmpty (Name λ) -> Declaration λ l d s explicitDataFixityDeclaration :: Associativity λ -> Maybe Int -> NonEmpty (Name λ) -> Declaration λ l d s explicitTypeExpression :: s (Type l l d d) -> Expression λ l d s explicitTypePattern :: s (Type l l d d) -> Pattern λ l d s }
data Construct '['ExtendedLiterals] λ l d s Source #
Instance details Defined in Language.Haskell.Extensions.Abstract data Construct '['ExtendedLiterals] λ l d s = ExtendedLiteralsConstruction { extendedLiteral :: Integer -> Name λ -> Value λ l d s }
data Construct '['FunctionalDependencies] λ l d s Source #
Instance details Defined in Language.Haskell.Extensions.Abstract data Construct '['FunctionalDependencies] λ l d s = FunctionalDependenciesConstruction { functionalDependency :: [Name λ] -> [Name λ] -> FunctionalDependency λ l d s fundepClassDeclaration :: s (Context l l d d) -> s (TypeLHS l l d d) -> [s (FunctionalDependency l l d d)] -> [s (Declaration l l d d)] -> Declaration λ l d s }
data Construct '['GADTs, 'TypeData] λ l d s Source #
Instance details Defined in Language.Haskell.Extensions.Abstract data Construct '['GADTs, 'TypeData] λ l d s = TypeGADTConstruction { typeGADTDeclaration :: s (TypeLHS l l d d) -> Maybe (s (Kind l l d d)) -> [s (GADTConstructor l l d d)] -> Declaration λ l d s }
data Construct '['ImplicitParameters] λ l d s Source #
Instance details Defined in Language.Haskell.Extensions.Abstract data Construct '['ImplicitParameters] λ l d s = ImplicitParametersConstruction { implicitParameterConstraint :: Name λ -> s (Type l l d d) -> Context λ l d s implicitParameterDeclaration :: Name λ -> s (Expression l l d d) -> Declaration λ l d s implicitParameterExpression :: Name λ -> Expression λ l d s }
data Construct '['InterruptibleFFI] λ l d s Source #
Instance details Defined in Language.Haskell.Extensions.Abstract data Construct '['InterruptibleFFI] λ l d s = InterruptibleFFIConstruction { interruptibleCall :: CallSafety λ }
data Construct '['LambdaCase] λ l d s Source #
Instance details Defined in Language.Haskell.Extensions.Abstract data Construct '['LambdaCase] λ l d s = LambdaCaseConstruction { lambdaCaseExpression :: [s (CaseAlternative l l d d)] -> Expression λ l d s lambdaCasesExpression :: [s (LambdaCasesAlternative l l d d)] -> Expression λ l d s lambdaCasesAlternative :: [s (Pattern l l d d)] -> s (EquationRHS l l d d) -> LambdaCasesAlternative λ l d s }
data Construct '['MagicHash] λ l d s Source #
Instance details Defined in Language.Haskell.Extensions.Abstract data Construct '['MagicHash] λ l d s = MagicHashConstruction { hashLiteral' :: Value λ l d s -> Value λ l d s }
data Construct '['NPlusKPatterns] λ l d s Source #
Instance details Defined in Language.Haskell.Extensions.Abstract data Construct '['NPlusKPatterns] λ l d s = NPlusKPatternConstruction { nPlusKPattern :: Name λ -> Integer -> Pattern λ l d s }
data Construct '['NamedDefaults] λ l d s Source #
Instance details Defined in Language.Haskell.Extensions.Abstract data Construct '['NamedDefaults] λ l d s = NamedDefaultsConstruction { namedDefaultDeclaration :: QualifiedName λ -> [s (Type l l d d)] -> Declaration λ l d s }
data Construct '['NamedFieldPuns] λ l d s Source #
Instance details Defined in Language.Haskell.Extensions.Abstract data Construct '['NamedFieldPuns] λ l d s = NamedFieldPunsConstruction { punnedFieldBinding' :: QualifiedName λ -> FieldBinding λ l d s punnedFieldPattern' :: QualifiedName λ -> FieldPattern λ l d s }
data Construct '['ParallelListComprehensions] λ l d s Source #
Instance details Defined in Language.Haskell.Extensions.Abstract data Construct '['ParallelListComprehensions] λ l d s = ParallelListComprehensionConstruction { parallelListComprehension' :: s (Expression l l d d) -> NonEmpty (s (Statement l l d d)) -> NonEmpty (s (Statement l l d d)) -> [NonEmpty (s (Statement l l d d))] -> Expression λ l d s }
data Construct '['PatternSynonyms] λ l d s Source #
Instance details Defined in Language.Haskell.Extensions.Abstract data Construct '['PatternSynonyms] λ l d s = PatternSynonymConstruction { exportPattern :: QualifiedName λ -> Export λ l d s importPattern :: Name λ -> ImportItem λ l d s allMembersPlus :: [Name λ] -> Members λ prefixPatternLHS :: Name λ -> [Name λ] -> PatternLHS λ l d s infixPatternLHS :: Name λ -> Name λ -> Name λ -> PatternLHS λ l d s recordPatternLHS :: Name λ -> [Name λ] -> PatternLHS λ l d s prefixPatternEquationLHS :: Name λ -> [s (Pattern l l d d)] -> PatternEquationLHS λ l d s infixPatternEquationLHS :: s (Pattern l l d d) -> Name λ -> s (Pattern l l d d) -> PatternEquationLHS λ l d s patternEquationClause :: Supports 'PatternSynonyms λ => s (PatternEquationLHS l l d d) -> s (EquationRHS l l d d) -> [s (Declaration l l d d)] -> PatternEquationClause λ l d s implicitPatternSynonym :: Supports 'PatternSynonyms λ => s (PatternLHS l l d d) -> s (Pattern l l d d) -> Declaration λ l d s unidirectionalPatternSynonym :: Supports 'PatternSynonyms λ => s (PatternLHS l l d d) -> s (Pattern l l d d) -> Declaration λ l d s explicitPatternSynonym :: Supports 'PatternSynonyms λ => s (PatternLHS l l d d) -> s (Pattern l l d d) -> [s (PatternEquationClause l l d d)] -> Declaration λ l d s patternSynonymSignature :: Supports 'PatternSynonyms λ => NonEmpty (Name λ) -> [TypeVarBinding λ l d s] -> s (Context l l d d) -> [TypeVarBinding λ l d s] -> s (Context l l d d) -> [s (Type l l d d)] -> s (Type l l d d) -> Declaration λ l d s }
data Construct '['QualifiedDo, 'RecursiveDo] λ l d s Source #
Instance details Defined in Language.Haskell.Extensions.Abstract data Construct '['QualifiedDo, 'RecursiveDo] λ l d s = QualifiedRecursiveDoConstruction { mdoQualifiedExpression :: ModuleName λ -> s (GuardedExpression l l d d) -> Expression λ l d s }
data Construct '['QualifiedDo] λ l d s Source #
Instance details Defined in Language.Haskell.Extensions.Abstract data Construct '['QualifiedDo] λ l d s = QualifiedDoConstruction { qualifiedDoExpression :: ModuleName λ -> s (GuardedExpression l l d d) -> Expression λ l d s }
data Construct '['RecordWildCards] λ l d s Source #
Instance details Defined in Language.Haskell.Extensions.Abstract data Construct '['RecordWildCards] λ l d s = RecordWildCardConstruction { wildcardRecordExpression' :: QualifiedName λ -> [s (FieldBinding l l d d)] -> Expression λ l d s wildcardRecordPattern' :: QualifiedName λ -> [s (FieldPattern l l d d)] -> Pattern λ l d s }
data Construct '['RecursiveDo] λ l d s Source #
Instance details Defined in Language.Haskell.Extensions.Abstract data Construct '['RecursiveDo] λ l d s = RecursiveDoConstruction { mdoExpression' :: s (GuardedExpression l l d d) -> Expression λ l d s recursiveStatement' :: [s (Statement l l d d)] -> Statement λ l d s }
data Construct '['StandaloneDeriving] λ l d s Source #
Instance details Defined in Language.Haskell.Extensions.Abstract data Construct '['StandaloneDeriving] λ l d s = StandaloneDerivingConstruction { standaloneDerivingDeclaration :: [TypeVarBinding λ l d s] -> s (Context l l d d) -> s (ClassInstanceLHS l l d d) -> Declaration λ l d s }
data Construct '['Strict] λ l d s Source #
Instance details Defined in Language.Haskell.Extensions.Abstract data Construct '['Strict] λ l d s = StrictConstruction { lazyPattern :: s (Pattern l l d d) -> Pattern λ l d s }
data Construct '['StrictData] λ l d s Source #
Instance details Defined in Language.Haskell.Extensions.Abstract data Construct '['StrictData] λ l d s = StrictDataConstruction { lazyType :: s (Type l l d d) -> Type λ l d s }
data Construct '['TupleSections] λ l d s Source #
Instance details Defined in Language.Haskell.Extensions.Abstract data Construct '['TupleSections] λ l d s = TupleSectionConstruction { tupleSectionExpression' :: NonEmpty (Maybe (s (Expression l l d d))) -> Expression λ l d s }
data Construct '['TypeAbstractions] λ l d s Source #
Instance details Defined in Language.Haskell.Extensions.Abstract data Construct '['TypeAbstractions] λ l d s = TypeAbstractionConstruction { typeLHSTypeApplication :: s (TypeLHS l l d d) -> TypeVarBinding λ l d s -> TypeLHS λ l d s invisibleTypePattern :: s (Type l l d d) -> Pattern λ l d s }
data Construct '['TypeData] λ l d s Source #
Instance details Defined in Language.Haskell.Extensions.Abstract data Construct '['TypeData] λ l d s = TypeDataConstruction { typeDataDeclaration :: s (TypeLHS l l d d) -> Maybe (s (Kind l l d d)) -> [s (DataConstructor l l d d)] -> Declaration λ l d s }
data Construct '['UnboxedSums] λ l d s Source #
Instance details Defined in Language.Haskell.Extensions.Abstract data Construct '['UnboxedSums] λ l d s = UnboxedSumsConstruction { unboxedSumType :: NonEmpty (s (Type l l d d)) -> Type λ l d s unboxedSumConstructor :: Int -> Constructor λ l d s unboxedSumExpression :: Int -> s (Expression l l d d) -> Int -> Expression λ l d s unboxedSumPattern :: Int -> s (Pattern l l d d) -> Int -> Pattern λ l d s }
data Construct '['UnboxedTuples] λ l d s Source #
Instance details Defined in Language.Haskell.Extensions.Abstract data Construct '['UnboxedTuples] λ l d s = UnboxedTuplesConstruction { unboxedTupleType :: NonEmpty (s (Type l l d d)) -> Type λ l d s unboxedTupleExpression :: NonEmpty (s (Expression l l d d)) -> Expression λ l d s unboxedTupleSectionExpression :: NonEmpty (Maybe (s (Expression l l d d))) -> Expression λ l d s unboxedTupleConstructor :: Int -> Constructor λ l d s unboxedTuplePattern :: NonEmpty (s (Pattern l l d d)) -> Pattern λ l d s }
data Construct '['ViewPatterns] λ l d s Source #
Instance details Defined in Language.Haskell.Extensions.Abstract data Construct '['ViewPatterns] λ l d s = ViewPatternConstruction { viewPattern :: s (Expression l l d d) -> s (Pattern l l d d) -> Pattern λ l d s }

newtype ExtensionSwitch Source #

An extension together with an on/off boolean

Constructors

ExtensionSwitch (Extension, Bool)

Instances

Instances details

Eq ExtensionSwitch Source #
Instance details Defined in Language.Haskell.Extensions Methods (==) :: ExtensionSwitch -> ExtensionSwitch -> Bool # (/=) :: ExtensionSwitch -> ExtensionSwitch -> Bool #
Ord ExtensionSwitch Source #
Instance details Defined in Language.Haskell.Extensions Methods compare :: ExtensionSwitch -> ExtensionSwitch -> Ordering # (<) :: ExtensionSwitch -> ExtensionSwitch -> Bool # (<=) :: ExtensionSwitch -> ExtensionSwitch -> Bool # (>) :: ExtensionSwitch -> ExtensionSwitch -> Bool # (>=) :: ExtensionSwitch -> ExtensionSwitch -> Bool # max :: ExtensionSwitch -> ExtensionSwitch -> ExtensionSwitch # min :: ExtensionSwitch -> ExtensionSwitch -> ExtensionSwitch #
Data ExtensionSwitch Source #
Instance details Defined in Language.Haskell.Extensions Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ExtensionSwitch -> c ExtensionSwitch # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c ExtensionSwitch # toConstr :: ExtensionSwitch -> Constr # dataTypeOf :: ExtensionSwitch -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c ExtensionSwitch) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c ExtensionSwitch) # gmapT :: (forall b. Data b => b -> b) -> ExtensionSwitch -> ExtensionSwitch # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ExtensionSwitch -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ExtensionSwitch -> r # gmapQ :: (forall d. Data d => d -> u) -> ExtensionSwitch -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> ExtensionSwitch -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> ExtensionSwitch -> m ExtensionSwitch # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ExtensionSwitch -> m ExtensionSwitch # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ExtensionSwitch -> m ExtensionSwitch #
Show ExtensionSwitch Source #
Instance details Defined in Language.Haskell.Extensions Methods showsPrec :: Int -> ExtensionSwitch -> ShowS # show :: ExtensionSwitch -> String # showList :: [ExtensionSwitch] -> ShowS #
PrettyViaTH ExtensionSwitch Source #
Instance details Defined in Language.Haskell.Template Methods prettyViaTH :: ExtensionSwitch -> Doc
(SameWrap 'NPlusKPatterns '['ViewPatterns] pos s λ l2, Haskell l2, Supports 'NPlusKPatterns λ, Supports 'ViewPatterns l2, FieldPattern l2 ~ FieldPattern l2, QualifiedName l2 ~ QualifiedName l2, ModuleName l2 ~ ModuleName l2, Name l2 ~ Name l2) => WrappedTranslation (ReformulationOf (On 'NPlusKPatterns) '[On 'ViewPatterns] λ l2 pos s) Pattern Source #
Instance details Defined in Language.Haskell.Extensions.Reformulator Methods translateWrapped :: ReformulationOf (On 'NPlusKPatterns) '[On 'ViewPatterns] λ l2 pos s -> Wrap (ReformulationOf (On 'NPlusKPatterns) '[On 'ViewPatterns] λ l2 pos s) (Pattern (Origin (ReformulationOf (On 'NPlusKPatterns) '[On 'ViewPatterns] λ l2 pos s)) (Origin (ReformulationOf (On 'NPlusKPatterns) '[On 'ViewPatterns] λ l2 pos s)) (Wrap (ReformulationOf (On 'NPlusKPatterns) '[On 'ViewPatterns] λ l2 pos s)) (Wrap (ReformulationOf (On 'NPlusKPatterns) '[On 'ViewPatterns] λ l2 pos s))) -> Wrap (ReformulationOf (On 'NPlusKPatterns) '[On 'ViewPatterns] λ l2 pos s) (Pattern (Target (ReformulationOf (On 'NPlusKPatterns) '[On 'ViewPatterns] λ l2 pos s)) (Origin (ReformulationOf (On 'NPlusKPatterns) '[On 'ViewPatterns] λ l2 pos s)) (Wrap (ReformulationOf (On 'NPlusKPatterns) '[On 'ViewPatterns] λ l2 pos s)) (Wrap (ReformulationOf (On 'NPlusKPatterns) '[On 'ViewPatterns] λ l2 pos s))) Source #
(SameWrap 'RecordWildCards '['NamedFieldPuns] pos s λ l, Supports 'RecordWildCards λ, Haskell l, FieldBinding l ~ FieldBinding l, QualifiedName l ~ QualifiedName l, ModuleName l ~ ModuleName l, Name l ~ Name l) => WrappedTranslation (ReformulationOf (On 'RecordWildCards) '[On 'NamedFieldPuns] λ l pos s) Expression Source #
Instance details Defined in Language.Haskell.Extensions.Reformulator Methods translateWrapped :: ReformulationOf (On 'RecordWildCards) '[On 'NamedFieldPuns] λ l pos s -> Wrap (ReformulationOf (On 'RecordWildCards) '[On 'NamedFieldPuns] λ l pos s) (Expression (Origin (ReformulationOf (On 'RecordWildCards) '[On 'NamedFieldPuns] λ l pos s)) (Origin (ReformulationOf (On 'RecordWildCards) '[On 'NamedFieldPuns] λ l pos s)) (Wrap (ReformulationOf (On 'RecordWildCards) '[On 'NamedFieldPuns] λ l pos s)) (Wrap (ReformulationOf (On 'RecordWildCards) '[On 'NamedFieldPuns] λ l pos s))) -> Wrap (ReformulationOf (On 'RecordWildCards) '[On 'NamedFieldPuns] λ l pos s) (Expression (Target (ReformulationOf (On 'RecordWildCards) '[On 'NamedFieldPuns] λ l pos s)) (Origin (ReformulationOf (On 'RecordWildCards) '[On 'NamedFieldPuns] λ l pos s)) (Wrap (ReformulationOf (On 'RecordWildCards) '[On 'NamedFieldPuns] λ l pos s)) (Wrap (ReformulationOf (On 'RecordWildCards) '[On 'NamedFieldPuns] λ l pos s))) Source #
(SameWrap 'RecordWildCards '['NamedFieldPuns] pos s λ l2, Supports 'RecordWildCards λ, FieldPattern l2 ~ FieldPattern l2, QualifiedName l2 ~ QualifiedName l2, ModuleName l2 ~ ModuleName l2, Name l2 ~ Name l2) => WrappedTranslation (ReformulationOf (On 'RecordWildCards) '[On 'NamedFieldPuns] λ l2 pos s) Pattern Source #
Instance details Defined in Language.Haskell.Extensions.Reformulator Methods translateWrapped :: ReformulationOf (On 'RecordWildCards) '[On 'NamedFieldPuns] λ l2 pos s -> Wrap (ReformulationOf (On 'RecordWildCards) '[On 'NamedFieldPuns] λ l2 pos s) (Pattern (Origin (ReformulationOf (On 'RecordWildCards) '[On 'NamedFieldPuns] λ l2 pos s)) (Origin (ReformulationOf (On 'RecordWildCards) '[On 'NamedFieldPuns] λ l2 pos s)) (Wrap (ReformulationOf (On 'RecordWildCards) '[On 'NamedFieldPuns] λ l2 pos s)) (Wrap (ReformulationOf (On 'RecordWildCards) '[On 'NamedFieldPuns] λ l2 pos s))) -> Wrap (ReformulationOf (On 'RecordWildCards) '[On 'NamedFieldPuns] λ l2 pos s) (Pattern (Target (ReformulationOf (On 'RecordWildCards) '[On 'NamedFieldPuns] λ l2 pos s)) (Origin (ReformulationOf (On 'RecordWildCards) '[On 'NamedFieldPuns] λ l2 pos s)) (Wrap (ReformulationOf (On 'RecordWildCards) '[On 'NamedFieldPuns] λ l2 pos s)) (Wrap (ReformulationOf (On 'RecordWildCards) '[On 'NamedFieldPuns] λ l2 pos s))) Source #