| Safe Haskell | Safe-Inferred |
|---|---|
| Language | Haskell2010 |
Agda.TypeChecking.Monad.Base
Synopsis
- data Polarity
- data Comparison
- type BackendName = String
- type ModuleToSource = Map TopLevelModuleName AbsolutePath
- type TCM = TCMT IO
- newtype TCMT m a = TCM {}
- data TCState = TCSt {}
- data TCEnv = TCEnv {
- envContext :: Context
- envLetBindings :: LetBindings
- envCurrentModule :: ModuleName
- envCurrentPath :: Maybe AbsolutePath
- envAnonymousModules :: [(ModuleName, Nat)]
- envImportPath :: [TopLevelModuleName]
- envMutualBlock :: Maybe MutualId
- envTerminationCheck :: TerminationCheck ()
- envCoverageCheck :: CoverageCheck
- envMakeCase :: Bool
- envSolvingConstraints :: Bool
- envCheckingWhere :: Bool
- envWorkingOnTypes :: Bool
- envAssignMetas :: Bool
- envActiveProblems :: Set ProblemId
- envAbstractMode :: AbstractMode
- envModality :: Modality
- envSplitOnStrict :: Bool
- envDisplayFormsEnabled :: Bool
- envRange :: Range
- envHighlightingRange :: Range
- envClause :: IPClause
- envCall :: Maybe (Closure Call)
- envHighlightingLevel :: HighlightingLevel
- envHighlightingMethod :: HighlightingMethod
- envExpandLast :: ExpandHidden
- envAppDef :: Maybe QName
- envSimplification :: Simplification
- envAllowedReductions :: AllowedReductions
- envReduceDefs :: ReduceDefs
- envReconstructed :: Bool
- envInjectivityDepth :: Int
- envCompareBlocked :: Bool
- envPrintDomainFreePi :: Bool
- envPrintMetasBare :: Bool
- envInsideDotPattern :: Bool
- envUnquoteFlags :: UnquoteFlags
- envInstanceDepth :: !Int
- envIsDebugPrinting :: Bool
- envPrintingPatternLambdas :: [QName]
- envCallByNeed :: Bool
- envCurrentCheckpoint :: CheckpointId
- envCheckpoints :: Map CheckpointId Substitution
- envGeneralizeMetas :: DoGeneralize
- envGeneralizedVars :: Map QName GeneralizedValue
- envActiveBackendName :: Maybe BackendName
- envConflComputingOverlap :: Bool
- envCurrentlyElaborating :: Bool
- data HighlightingLevel
- data HighlightingMethod
- data NamedMeta = NamedMeta {}
- data TCWarning = TCWarning {}
- data TCErr
- data Warning
- = NicifierIssue DeclarationWarning
- | TerminationIssue [TerminationError]
- | UnreachableClauses QName [Range]
- | CoverageIssue QName [(Telescope, [NamedArg DeBruijnPattern])]
- | CoverageNoExactSplit QName [Clause]
- | NotStrictlyPositive QName (Seq OccursWhere)
- | UnsolvedMetaVariables [Range]
- | UnsolvedInteractionMetas [Range]
- | UnsolvedConstraints Constraints
- | CantGeneralizeOverSorts [MetaId]
- | AbsurdPatternRequiresNoRHS [NamedArg DeBruijnPattern]
- | OldBuiltin String String
- | EmptyRewritePragma
- | EmptyWhere
- | IllformedAsClause String
- | ClashesViaRenaming NameOrModule [Name]
- | UselessPatternDeclarationForRecord String
- | UselessPublic
- | UselessHiding [ImportedName]
- | UselessInline QName
- | WrongInstanceDeclaration
- | InstanceWithExplicitArg QName
- | InstanceNoOutputTypeName Doc
- | InstanceArgWithExplicitArg Doc
- | InversionDepthReached QName
- | NoGuardednessFlag QName
- | GenericWarning Doc
- | GenericNonFatalError Doc
- | GenericUseless Range Doc
- | SafeFlagPostulate Name
- | SafeFlagPragma [String]
- | SafeFlagNonTerminating
- | SafeFlagTerminating
- | SafeFlagWithoutKFlagPrimEraseEquality
- | WithoutKFlagPrimEraseEquality
- | SafeFlagNoPositivityCheck
- | SafeFlagPolarity
- | SafeFlagNoUniverseCheck
- | SafeFlagNoCoverageCheck
- | SafeFlagInjective
- | SafeFlagEta
- | ParseWarning ParseWarning
- | LibraryWarning LibWarning
- | DeprecationWarning String String String
- | UserWarning Text
- | DuplicateUsing (List1 ImportedName)
- | FixityInRenamingModule (List1 Range)
- | ModuleDoesntExport QName [Name] [Name] [ImportedName]
- | InfectiveImport String ModuleName
- | CoInfectiveImport String ModuleName
- | RewriteNonConfluent Term Term Term Doc
- | RewriteMaybeNonConfluent Term Term [Doc]
- | RewriteAmbiguousRules Term Term Term
- | RewriteMissingRule Term Term Term
- | PragmaCompileErased BackendName QName
- | NotInScopeW [QName]
- | AsPatternShadowsConstructorOrPatternSynonym Bool
- | RecordFieldWarning RecordFieldWarning
- type MonadTCError m = (MonadTCEnv m, ReadTCState m, MonadError TCErr m)
- class (Applicative tcm, MonadIO tcm, MonadTCEnv tcm, MonadTCState tcm, HasOptions tcm) => MonadTCM tcm where
- newtype BlockT m a = BlockT {}
- class Monad m => MonadBlock m where
- patternViolation :: Blocker -> m a
- catchPatternErr :: (Blocker -> m a) -> m a -> m a
- class Monad m => MonadTCState m where
- class Monad m => MonadTCEnv m where
- class (Applicative m, MonadTCEnv m, ReadTCState m, HasOptions m) => MonadReduce m where
- liftReduce :: ReduceM a -> m a
- newtype ReduceM a = ReduceM {}
- data ReduceEnv = ReduceEnv {}
- data LHSOrPatSyn
- data TypeError
- = InternalError String
- | NotImplemented String
- | NotSupported String
- | CompilationError String
- | PropMustBeSingleton
- | DataMustEndInSort Term
- | ShouldEndInApplicationOfTheDatatype Type
- | ShouldBeAppliedToTheDatatypeParameters Term Term
- | ShouldBeApplicationOf Type QName
- | ConstructorPatternInWrongDatatype QName QName
- | CantResolveOverloadedConstructorsTargetingSameDatatype QName (List1 QName)
- | DoesNotConstructAnElementOf QName Type
- | WrongHidingInLHS
- | WrongHidingInLambda Type
- | WrongHidingInApplication Type
- | WrongNamedArgument (NamedArg Expr) [NamedName]
- | WrongIrrelevanceInLambda
- | WrongQuantityInLambda
- | WrongCohesionInLambda
- | QuantityMismatch Quantity Quantity
- | HidingMismatch Hiding Hiding
- | RelevanceMismatch Relevance Relevance
- | UninstantiatedDotPattern Expr
- | ForcedConstructorNotInstantiated Pattern
- | IllformedProjectionPattern Pattern
- | CannotEliminateWithPattern (Maybe Blocker) (NamedArg Pattern) Type
- | WrongNumberOfConstructorArguments QName Nat Nat
- | ShouldBeEmpty Type [DeBruijnPattern]
- | ShouldBeASort Type
- | ShouldBePi Type
- | ShouldBePath Type
- | ShouldBeRecordType Type
- | ShouldBeRecordPattern DeBruijnPattern
- | NotAProjectionPattern (NamedArg Pattern)
- | NotAProperTerm
- | InvalidTypeSort Sort
- | InvalidType Term
- | FunctionTypeInSizeUniv Term
- | SplitOnIrrelevant (Dom Type)
- | SplitOnUnusableCohesion (Dom Type)
- | SplitOnNonVariable Term Type
- | SplitOnNonEtaRecord QName
- | DefinitionIsIrrelevant QName
- | DefinitionIsErased QName
- | VariableIsIrrelevant Name
- | VariableIsErased Name
- | VariableIsOfUnusableCohesion Name Cohesion
- | UnequalLevel Comparison Level Level
- | UnequalTerms Comparison Term Term CompareAs
- | UnequalTypes Comparison Type Type
- | UnequalRelevance Comparison Term Term
- | UnequalQuantity Comparison Term Term
- | UnequalCohesion Comparison Term Term
- | UnequalHiding Term Term
- | UnequalSorts Sort Sort
- | UnequalBecauseOfUniverseConflict Comparison Term Term
- | NotLeqSort Sort Sort
- | MetaCannotDependOn MetaId Nat
- | MetaOccursInItself MetaId
- | MetaIrrelevantSolution MetaId Term
- | MetaErasedSolution MetaId Term
- | GenericError String
- | GenericDocError Doc
- | SortOfSplitVarError (Maybe Blocker) Doc
- | BuiltinMustBeConstructor String Expr
- | NoSuchBuiltinName String
- | DuplicateBuiltinBinding String Term Term
- | NoBindingForBuiltin String
- | NoSuchPrimitiveFunction String
- | DuplicatePrimitiveBinding String QName QName
- | WrongModalityForPrimitive String ArgInfo ArgInfo
- | ShadowedModule Name [ModuleName]
- | BuiltinInParameterisedModule String
- | IllegalLetInTelescope TypedBinding
- | IllegalPatternInTelescope Binder
- | NoRHSRequiresAbsurdPattern [NamedArg Pattern]
- | TooManyFields QName [Name] [Name]
- | DuplicateFields [Name]
- | DuplicateConstructors [Name]
- | WithOnFreeVariable Expr Term
- | UnexpectedWithPatterns [Pattern]
- | WithClausePatternMismatch Pattern (NamedArg DeBruijnPattern)
- | FieldOutsideRecord
- | ModuleArityMismatch ModuleName Telescope [NamedArg Expr]
- | GeneralizeCyclicDependency
- | GeneralizeUnsolvedMeta
- | SplitError SplitError
- | ImpossibleConstructor QName NegativeUnification
- | TooManyPolarities QName Int
- | LocalVsImportedModuleClash ModuleName
- | SolvedButOpenHoles
- | CyclicModuleDependency [TopLevelModuleName]
- | FileNotFound TopLevelModuleName [AbsolutePath]
- | OverlappingProjects AbsolutePath TopLevelModuleName TopLevelModuleName
- | AmbiguousTopLevelModuleName TopLevelModuleName [AbsolutePath]
- | ModuleNameUnexpected TopLevelModuleName TopLevelModuleName
- | ModuleNameDoesntMatchFileName TopLevelModuleName [AbsolutePath]
- | ClashingFileNamesFor ModuleName [AbsolutePath]
- | ModuleDefinedInOtherFile TopLevelModuleName AbsolutePath AbsolutePath
- | BothWithAndRHS
- | AbstractConstructorNotInScope QName
- | NotInScope [QName]
- | NoSuchModule QName
- | AmbiguousName QName (List1 QName)
- | AmbiguousModule QName (List1 ModuleName)
- | ClashingDefinition QName QName (Maybe NiceDeclaration)
- | ClashingModule ModuleName ModuleName
- | ClashingImport Name QName
- | ClashingModuleImport Name ModuleName
- | PatternShadowsConstructor Name QName
- | DuplicateImports QName [ImportedName]
- | InvalidPattern Pattern
- | RepeatedVariablesInPattern [Name]
- | GeneralizeNotSupportedHere QName
- | MultipleFixityDecls [(Name, [Fixity'])]
- | MultiplePolarityPragmas [Name]
- | NotAModuleExpr Expr
- | NotAnExpression Expr
- | NotAValidLetBinding NiceDeclaration
- | NotValidBeforeField NiceDeclaration
- | NothingAppliedToHiddenArg Expr
- | NothingAppliedToInstanceArg Expr
- | BadArgumentsToPatternSynonym AmbiguousQName
- | TooFewArgumentsToPatternSynonym AmbiguousQName
- | CannotResolveAmbiguousPatternSynonym (List1 (QName, PatternSynDefn))
- | UnusedVariableInPatternSynonym
- | NoParseForApplication (List2 Expr)
- | AmbiguousParseForApplication (List2 Expr) (List1 Expr)
- | NoParseForLHS LHSOrPatSyn [Pattern] Pattern
- | AmbiguousParseForLHS LHSOrPatSyn Pattern [Pattern]
- | OperatorInformation [NotationSection] TypeError
- | InstanceNoCandidate Type [(Term, TCErr)]
- | UnquoteFailed UnquoteError
- | DeBruijnIndexOutOfScope Nat Telescope [Name]
- | NeedOptionCopatterns
- | NeedOptionRewriting
- | NeedOptionProp
- | NeedOptionTwoLevel
- | NonFatalErrors [TCWarning]
- | InstanceSearchDepthExhausted Term Type Int
- | TriedToCopyConstrainedPrim QName
- data UnquoteError
- data UnificationFailure
- data NegativeUnification
- data SplitError
- = NotADatatype (Closure Type)
- | BlockedType Blocker (Closure Type)
- | ErasedDatatype Bool (Closure Type)
- | CoinductiveDatatype (Closure Type)
- | UnificationStuck { }
- | CosplitCatchall
- | CosplitNoTarget
- | CosplitNoRecordType (Closure Type)
- | CannotCreateMissingClause QName (Telescope, [NamedArg DeBruijnPattern]) Doc (Closure (Abs Type))
- | GenericSplitError String
- data TerminationError = TerminationError {
- termErrFunctions :: [QName]
- termErrCalls :: [CallInfo]
- data CallInfo = CallInfo {}
- data RecordFieldWarning
- = DuplicateFieldsWarning [(Name, Range)]
- | TooManyFieldsWarning QName [Name] [(Name, Range)]
- data ArgsCheckState a = ACState {}
- data Candidate = Candidate {}
- data CandidateKind
- data ExpandHidden
- data AbstractMode
- type LetBindings = Map Name (Open (Term, Dom Type))
- type ContextEntry = Dom (Name, Type)
- type Context = [ContextEntry]
- data UnquoteFlags = UnquoteFlags {}
- class LensTCEnv a where
- data Builtin pf
- type BuiltinThings pf = Map String (Builtin pf)
- data BuiltinInfo = BuiltinInfo {}
- data BuiltinDescriptor
- = BuiltinData (TCM Type) [String]
- | BuiltinDataCons (TCM Type)
- | BuiltinPrim String (Term -> TCM ())
- | BuiltinSort String
- | BuiltinPostulate Relevance (TCM Type)
- | BuiltinUnknown (Maybe (TCM Type)) (Term -> Type -> TCM ())
- type TempInstanceTable = (InstanceTable, Set QName)
- type InstanceTable = Map QName (Set QName)
- data Call
- = CheckClause Type SpineClause
- | CheckLHS SpineLHS
- | CheckPattern Pattern Telescope Type
- | CheckPatternLinearityType Name
- | CheckPatternLinearityValue Name
- | CheckLetBinding LetBinding
- | InferExpr Expr
- | CheckExprCall Comparison Expr Type
- | CheckDotPattern Expr Term
- | CheckProjection Range QName Type
- | IsTypeCall Comparison Expr Sort
- | IsType_ Expr
- | InferVar Name
- | InferDef QName
- | CheckArguments Range [NamedArg Expr] Type (Maybe Type)
- | CheckMetaSolution Range MetaId Type Term
- | CheckTargetType Range Type Type
- | CheckDataDef Range QName [LamBinding] [Constructor]
- | CheckRecDef Range QName [LamBinding] [Constructor]
- | CheckConstructor QName Telescope Sort Constructor
- | CheckConstructorFitsIn QName Type Sort
- | CheckFunDefCall Range QName [Clause] Bool
- | CheckPragma Range Pragma
- | CheckPrimitive Range QName Expr
- | CheckIsEmpty Range Type
- | CheckConfluence QName QName
- | CheckWithFunctionType Type
- | CheckSectionApplication Range ModuleName ModuleApplication
- | CheckNamedWhere ModuleName
- | ScopeCheckExpr Expr
- | ScopeCheckDeclaration NiceDeclaration
- | ScopeCheckLHS QName Pattern
- | NoHighlighting
- | ModuleContents
- | SetRange Range
- type Statistics = Map String Integer
- newtype MutualId = MutId Int32
- data TermHead
- data FunctionInverse' c
- = NotInjective
- | Inverse (InversionMap c)
- type InversionMap c = Map TermHead [c]
- type FunctionInverse = FunctionInverse' Clause
- data PrimFun = PrimFun {
- primFunName :: QName
- primFunArity :: Arity
- primFunImplementation :: [Arg Term] -> Int -> ReduceM (Reduced MaybeReducedArgs Term)
- data PrimitiveImpl = PrimImpl Type PrimFun
- data ReduceDefs
- = OnlyReduceDefs (Set QName)
- | DontReduceDefs (Set QName)
- type AllowedReductions = SmallSet AllowedReduction
- data AllowedReduction
- type MaybeReducedElims = [MaybeReduced Elim]
- type MaybeReducedArgs = [MaybeReduced (Arg Term)]
- data MaybeReduced a = MaybeRed {
- isReduced :: IsReduced
- ignoreReduced :: a
- data IsReduced
- = NotReduced
- | Reduced (Blocked ())
- data Reduced no yes
- = NoReduction no
- | YesReduction Simplification yes
- data Simplification
- newtype Fields = Fields [(Name, Type)]
- data Defn
- = Axiom { }
- | DataOrRecSig {
- datarecPars :: Int
- | GeneralizableVar
- | AbstractDefn Defn
- | Function {
- funClauses :: [Clause]
- funCompiled :: Maybe CompiledClauses
- funSplitTree :: Maybe SplitTree
- funTreeless :: Maybe Compiled
- funCovering :: [Clause]
- funInv :: FunctionInverse
- funMutual :: Maybe [QName]
- funAbstr :: IsAbstract
- funDelayed :: Delayed
- funProjection :: Maybe Projection
- funFlags :: Set FunctionFlag
- funTerminates :: Maybe Bool
- funExtLam :: Maybe ExtLamInfo
- funWith :: Maybe QName
- | Datatype {
- dataPars :: Nat
- dataIxs :: Nat
- dataClause :: Maybe Clause
- dataCons :: [QName]
- dataSort :: Sort
- dataMutual :: Maybe [QName]
- dataAbstr :: IsAbstract
- dataPathCons :: [QName]
- | Record { }
- | Constructor { }
- | Primitive { }
- | PrimitiveSort { }
- data CompKit = CompKit {}
- data FunctionFlag
- data EtaEquality
- = Specified {
- theEtaEquality :: !HasEta
- | Inferred {
- theEtaEquality :: !HasEta
- = Specified {
- newtype ProjLams = ProjLams {
- getProjLams :: [Arg ArgName]
- data Projection = Projection {}
- data ExtLamInfo = ExtLamInfo {
- extLamModule :: ModuleName
- extLamAbsurd :: Bool
- extLamSys :: !(Maybe System)
- data System = System {
- systemTel :: Telescope
- systemClauses :: [(Face, Term)]
- type Face = [(Term, Bool)]
- type CompiledRepresentation = Map BackendName [CompilerPragma]
- data CompilerPragma = CompilerPragma Range String
- data IsForced
- data NumGeneralizableArgs
- data Definition = Defn {
- defArgInfo :: ArgInfo
- defName :: QName
- defType :: Type
- defPolarity :: [Polarity]
- defArgOccurrences :: [Occurrence]
- defArgGeneralizable :: NumGeneralizableArgs
- defGeneralizedParams :: [Maybe Name]
- defDisplay :: [LocalDisplayForm]
- defMutual :: MutualId
- defCompiledRep :: CompiledRepresentation
- defInstance :: Maybe QName
- defCopy :: Bool
- defMatchable :: Set QName
- defNoCompilation :: Bool
- defInjective :: Bool
- defCopatternLHS :: Bool
- defBlocked :: Blocked_
- defLanguage :: !Language
- theDef :: Defn
- data RewriteRule = RewriteRule {}
- type RewriteRules = [RewriteRule]
- data NLPSort
- data NLPType = NLPType {}
- type PElims = [Elim' NLPat]
- data NLPat
- data DisplayTerm
- = DWithApp DisplayTerm [DisplayTerm] Elims
- | DCon ConHead ConInfo [Arg DisplayTerm]
- | DDef QName [Elim' DisplayTerm]
- | DDot Term
- | DTerm Term
- type LocalDisplayForm = Open DisplayForm
- data DisplayForm = Display {
- dfPatternVars :: Nat
- dfPats :: Elims
- dfRHS :: DisplayTerm
- newtype Section = Section {}
- type DisplayForms = HashMap QName [LocalDisplayForm]
- type RewriteRuleMap = HashMap QName RewriteRules
- type Definitions = HashMap QName Definition
- type Sections = Map ModuleName Section
- data Signature = Sig {}
- data IPClause
- = IPClause {
- ipcQName :: QName
- ipcClauseNo :: Int
- ipcType :: Type
- ipcWithSub :: Maybe Substitution
- ipcClause :: SpineClause
- ipcClosure :: Closure ()
- ipcBoundary :: [Closure IPBoundary]
- | IPNoClause
- = IPClause {
- type IPBoundary = IPBoundary' Term
- data IPBoundary' t = IPBoundary {
- ipbEquations :: [(t, t)]
- ipbValue :: t
- ipbMetaApp :: t
- ipbOverapplied :: Overapplied
- data Overapplied
- type InteractionPoints = BiMap InteractionId InteractionPoint
- data InteractionPoint = InteractionPoint {}
- type MetaStore = IntMap MetaVariable
- type MetaNameSuggestion = String
- data MetaInfo = MetaInfo {}
- data RunMetaOccursCheck
- newtype MetaPriority = MetaPriority Int
- data TypeCheckingProblem
- = CheckExpr Comparison Expr Type
- | CheckArgs Comparison ExpandHidden Range [NamedArg Expr] Type Type (ArgsCheckState CheckedTarget -> TCM Term)
- | CheckProjAppToKnownPrincipalArg Comparison Expr ProjOrigin (List1 QName) Args Type Int Term Type PrincipalArgTypeMetas
- | CheckLambda Comparison (Arg (List1 (WithHiding Name), Maybe Type)) Expr Type
- | DoQuoteTerm Comparison Term Type
- data PrincipalArgTypeMetas = PrincipalArgTypeMetas {
- patmMetas :: Args
- patmRemainder :: Type
- data CheckedTarget
- data MetaInstantiation
- data Frozen
- data Listener
- data MetaVariable = MetaVar {}
- data GeneralizedValue = GeneralizedValue {}
- data DoGeneralize
- data Judgement a
- = HasType {
- jMetaId :: a
- jComparison :: Comparison
- jMetaType :: Type
- | IsSort { }
- = HasType {
- data Open a = OpenThing {}
- data CompareAs
- data CompareDirection
- data Constraint
- = ValueCmp Comparison CompareAs Term Term
- | ValueCmpOnFace Comparison Term Type Term Term
- | ElimCmp [Polarity] [IsForced] Type Term [Elim] [Elim]
- | SortCmp Comparison Sort Sort
- | LevelCmp Comparison Level Level
- | HasBiggerSort Sort
- | HasPTSRule (Dom Type) (Abs Sort)
- | CheckMetaInst MetaId
- | CheckType Type
- | UnBlock MetaId
- | IsEmpty Range Type
- | CheckSizeLtSat Term
- | FindInstance MetaId (Maybe [Candidate])
- | CheckFunDef Delayed DefInfo QName [Clause] TCErr
- | UnquoteTactic Term Term Type
- | CheckLockedVars Term Type (Arg Term) Type
- | UsableAtModality Modality Term
- data ProblemConstraint = PConstr {}
- type Constraints = [ProblemConstraint]
- class LensClosure a b | b -> a where
- lensClosure :: Lens' (Closure a) b
- data Closure a = Closure {}
- data Interface = Interface {
- iSourceHash :: Hash
- iSource :: Text
- iFileType :: FileType
- iImportedModules :: [(ModuleName, Hash)]
- iModuleName :: ModuleName
- iScope :: Map ModuleName Scope
- iInsideScope :: ScopeInfo
- iSignature :: Signature
- iDisplayForms :: DisplayForms
- iUserWarnings :: Map QName Text
- iImportWarning :: Maybe Text
- iBuiltin :: BuiltinThings (String, QName)
- iForeignCode :: Map BackendName [ForeignCode]
- iHighlighting :: HighlightingInfo
- iDefaultPragmaOptions :: [OptionsPragma]
- iFilePragmaOptions :: [OptionsPragma]
- iOptionsUsed :: PragmaOptions
- iPatternSyns :: PatternSynDefns
- iWarnings :: [TCWarning]
- iPartialDefs :: Set QName
- data ForeignCode = ForeignCode Range String
- type DecodedModules = Map TopLevelModuleName ModuleInfo
- type VisitedModules = Map TopLevelModuleName ModuleInfo
- data ModuleInfo = ModuleInfo {}
- data ModuleCheckMode
- class Monad m => MonadStConcreteNames m where
- runStConcreteNames :: StateT ConcreteNames m a -> m a
- useConcreteNames :: m ConcreteNames
- modifyConcreteNames :: (ConcreteNames -> ConcreteNames) -> m ()
- type SourceToModule = Map AbsolutePath TopLevelModuleName
- class FreshName a where
- freshName_ :: MonadFresh NameId m => a -> m Name
- newtype CheckpointId = CheckpointId Int
- class Monad m => MonadFresh i m where
- fresh :: m i
- class Enum i => HasFresh i where
- freshLens :: Lens' i TCState
- nextFresh' :: i -> i
- data TypeCheckAction
- type CurrentTypeCheckLog = [(TypeCheckAction, PostScopeState)]
- type CachedTypeCheckLog = [(TypeCheckAction, PostScopeState)]
- data LoadedFileCache = LoadedFileCache {}
- data PersistentTCState = PersistentTCSt {}
- data MutualBlock = MutualBlock {}
- data PostScopeState = PostScopeState {
- stPostSyntaxInfo :: !HighlightingInfo
- stPostDisambiguatedNames :: !DisambiguatedNames
- stPostMetaStore :: !MetaStore
- stPostInteractionPoints :: !InteractionPoints
- stPostAwakeConstraints :: !Constraints
- stPostSleepingConstraints :: !Constraints
- stPostDirty :: !Bool
- stPostOccursCheckDefs :: !(Set QName)
- stPostSignature :: !Signature
- stPostModuleCheckpoints :: !(Map ModuleName CheckpointId)
- stPostImportsDisplayForms :: !DisplayForms
- stPostCurrentModule :: !(Maybe ModuleName)
- stPostInstanceDefs :: !TempInstanceTable
- stPostConcreteNames :: !ConcreteNames
- stPostUsedNames :: !(Map RawName [RawName])
- stPostShadowingNames :: !(Map Name [RawName])
- stPostStatistics :: !Statistics
- stPostTCWarnings :: ![TCWarning]
- stPostMutualBlocks :: !(Map MutualId MutualBlock)
- stPostLocalBuiltins :: !(BuiltinThings PrimFun)
- stPostFreshMetaId :: !MetaId
- stPostFreshMutualId :: !MutualId
- stPostFreshProblemId :: !ProblemId
- stPostFreshCheckpointId :: !CheckpointId
- stPostFreshInt :: !Int
- stPostFreshNameId :: !NameId
- stPostAreWeCaching :: !Bool
- stPostPostponeInstanceSearch :: !Bool
- stPostConsideringInstance :: !Bool
- stPostInstantiateBlocking :: !Bool
- stPostLocalPartialDefs :: !(Set QName)
- type ConcreteNames = Map Name [Name]
- type DisambiguatedNames = IntMap DisambiguatedName
- data DisambiguatedName = DisambiguatedName NameKind QName
- data PreScopeState = PreScopeState {
- stPreTokens :: !HighlightingInfo
- stPreImports :: !Signature
- stPreImportedModules :: !(Set ModuleName)
- stPreModuleToSource :: !ModuleToSource
- stPreVisitedModules :: !VisitedModules
- stPreScope :: !ScopeInfo
- stPrePatternSyns :: !PatternSynDefns
- stPrePatternSynImports :: !PatternSynDefns
- stPreGeneralizedVars :: !(Maybe (Set QName))
- stPrePragmaOptions :: !PragmaOptions
- stPreImportedBuiltins :: !(BuiltinThings PrimFun)
- stPreImportedDisplayForms :: !DisplayForms
- stPreImportedInstanceDefs :: !InstanceTable
- stPreForeignCode :: !(Map BackendName [ForeignCode])
- stPreFreshInteractionId :: !InteractionId
- stPreImportedUserWarnings :: !(Map QName Text)
- stPreLocalUserWarnings :: !(Map QName Text)
- stPreWarningOnImport :: !(Maybe Text)
- stPreImportedPartialDefs :: !(Set QName)
- stPreProjectConfigs :: !(Map FilePath ProjectConfig)
- stPreAgdaLibFiles :: !(Map FilePath AgdaLibFile)
- class Monad m => ReadTCState m where
- getTCState :: m TCState
- locallyTCState :: Lens' a TCState -> (a -> a) -> m b -> m b
- withTCState :: (TCState -> TCState) -> m a -> m a
- initPersistentState :: PersistentTCState
- initPreScopeState :: PreScopeState
- initPostScopeState :: PostScopeState
- initState :: TCState
- stTokens :: Lens' HighlightingInfo TCState
- stImports :: Lens' Signature TCState
- stImportedModules :: Lens' (Set ModuleName) TCState
- stModuleToSource :: Lens' ModuleToSource TCState
- stVisitedModules :: Lens' VisitedModules TCState
- stScope :: Lens' ScopeInfo TCState
- stPatternSyns :: Lens' PatternSynDefns TCState
- stPatternSynImports :: Lens' PatternSynDefns TCState
- stGeneralizedVars :: Lens' (Maybe (Set QName)) TCState
- stPragmaOptions :: Lens' PragmaOptions TCState
- stImportedBuiltins :: Lens' (BuiltinThings PrimFun) TCState
- stForeignCode :: Lens' (Map BackendName [ForeignCode]) TCState
- stFreshInteractionId :: Lens' InteractionId TCState
- stImportedUserWarnings :: Lens' (Map QName Text) TCState
- stLocalUserWarnings :: Lens' (Map QName Text) TCState
- getUserWarnings :: ReadTCState m => m (Map QName Text)
- stWarningOnImport :: Lens' (Maybe Text) TCState
- stImportedPartialDefs :: Lens' (Set QName) TCState
- stLocalPartialDefs :: Lens' (Set QName) TCState
- getPartialDefs :: ReadTCState m => m (Set QName)
- stLoadedFileCache :: Lens' (Maybe LoadedFileCache) TCState
- stBackends :: Lens' [Backend] TCState
- stProjectConfigs :: Lens' (Map FilePath ProjectConfig) TCState
- stAgdaLibFiles :: Lens' (Map FilePath AgdaLibFile) TCState
- stFreshNameId :: Lens' NameId TCState
- stSyntaxInfo :: Lens' HighlightingInfo TCState
- stDisambiguatedNames :: Lens' DisambiguatedNames TCState
- stMetaStore :: Lens' MetaStore TCState
- stInteractionPoints :: Lens' InteractionPoints TCState
- stAwakeConstraints :: Lens' Constraints TCState
- stSleepingConstraints :: Lens' Constraints TCState
- stDirty :: Lens' Bool TCState
- stOccursCheckDefs :: Lens' (Set QName) TCState
- stSignature :: Lens' Signature TCState
- stModuleCheckpoints :: Lens' (Map ModuleName CheckpointId) TCState
- stImportsDisplayForms :: Lens' DisplayForms TCState
- stImportedDisplayForms :: Lens' DisplayForms TCState
- stCurrentModule :: Lens' (Maybe ModuleName) TCState
- stImportedInstanceDefs :: Lens' InstanceTable TCState
- stInstanceDefs :: Lens' TempInstanceTable TCState
- stConcreteNames :: Lens' ConcreteNames TCState
- stUsedNames :: Lens' (Map RawName [RawName]) TCState
- stShadowingNames :: Lens' (Map Name [RawName]) TCState
- stStatistics :: Lens' Statistics TCState
- stTCWarnings :: Lens' [TCWarning] TCState
- stMutualBlocks :: Lens' (Map MutualId MutualBlock) TCState
- stLocalBuiltins :: Lens' (BuiltinThings PrimFun) TCState
- stFreshMetaId :: Lens' MetaId TCState
- stFreshMutualId :: Lens' MutualId TCState
- stFreshProblemId :: Lens' ProblemId TCState
- stFreshCheckpointId :: Lens' CheckpointId TCState
- stFreshInt :: Lens' Int TCState
- stAreWeCaching :: Lens' Bool TCState
- stPostponeInstanceSearch :: Lens' Bool TCState
- stConsideringInstance :: Lens' Bool TCState
- stInstantiateBlocking :: Lens' Bool TCState
- stBuiltinThings :: TCState -> BuiltinThings PrimFun
- nextFresh :: HasFresh i => TCState -> (i, TCState)
- freshName :: MonadFresh NameId m => Range -> String -> m Name
- freshNoName :: MonadFresh NameId m => Range -> m Name
- freshNoName_ :: MonadFresh NameId m => m Name
- freshRecordName :: MonadFresh NameId m => m Name
- sourceToModule :: TCM SourceToModule
- lookupModuleFromSource :: ReadTCState m => AbsolutePath -> m (Maybe TopLevelModuleName)
- iFullHash :: Interface -> Hash
- intSignature :: Lens' Signature Interface
- buildClosure :: (MonadTCEnv m, ReadTCState m) => a -> m (Closure a)
- fromCmp :: Comparison -> CompareDirection
- flipCmp :: CompareDirection -> CompareDirection
- dirToCmp :: (Comparison -> a -> a -> c) -> CompareDirection -> a -> a -> c
- normalMetaPriority :: MetaPriority
- lowMetaPriority :: MetaPriority
- highMetaPriority :: MetaPriority
- getMetaInfo :: MetaVariable -> Closure Range
- getMetaScope :: MetaVariable -> ScopeInfo
- getMetaEnv :: MetaVariable -> TCEnv
- getMetaSig :: MetaVariable -> Signature
- getMetaRelevance :: MetaVariable -> Relevance
- getMetaModality :: MetaVariable -> Modality
- metaFrozen :: Lens' Frozen MetaVariable
- _mvInfo :: Lens' MetaInfo MetaVariable
- sigSections :: Lens' Sections Signature
- sigDefinitions :: Lens' Definitions Signature
- sigRewriteRules :: Lens' RewriteRuleMap Signature
- secTelescope :: Lens' Telescope Section
- emptySignature :: Signature
- defaultDisplayForm :: QName -> [LocalDisplayForm]
- theDefLens :: Lens' Defn Definition
- defaultDefn :: ArgInfo -> QName -> Type -> Language -> Defn -> Definition
- jsBackendName :: BackendName
- ghcBackendName :: BackendName
- noCompiledRep :: CompiledRepresentation
- modifySystem :: (System -> System) -> ExtLamInfo -> ExtLamInfo
- projDropPars :: Projection -> ProjOrigin -> Term
- projArgInfo :: Projection -> ArgInfo
- setEtaEquality :: EtaEquality -> HasEta -> EtaEquality
- emptyCompKit :: CompKit
- defaultAxiom :: Defn
- constTranspAxiom :: Defn
- recRecursive :: Defn -> Bool
- recEtaEquality :: Defn -> HasEta
- emptyFunction :: Defn
- funFlag :: FunctionFlag -> Lens' Bool Defn
- funStatic :: Lens' Bool Defn
- funInline :: Lens' Bool Defn
- funMacro :: Lens' Bool Defn
- isMacro :: Defn -> Bool
- isEmptyFunction :: Defn -> Bool
- isCopatternLHS :: [Clause] -> Bool
- recCon :: Defn -> QName
- defIsRecord :: Defn -> Bool
- defIsDataOrRecord :: Defn -> Bool
- defConstructors :: Defn -> [QName]
- redReturn :: a -> ReduceM (Reduced a' a)
- redBind :: ReduceM (Reduced a a') -> (a -> b) -> (a' -> ReduceM (Reduced b b')) -> ReduceM (Reduced b b')
- notReduced :: a -> MaybeReduced a
- reduced :: Blocked (Arg Term) -> MaybeReduced (Arg Term)
- allReductions :: AllowedReductions
- reallyAllReductions :: AllowedReductions
- reduceAllDefs :: ReduceDefs
- locallyReduceDefs :: MonadTCEnv m => ReduceDefs -> m a -> m a
- locallyReduceAllDefs :: MonadTCEnv m => m a -> m a
- shouldReduceDef :: MonadTCEnv m => QName -> m Bool
- locallyReconstructed :: MonadTCEnv m => m a -> m a
- isReconstructed :: MonadTCEnv m => m Bool
- primFun :: QName -> Arity -> ([Arg Term] -> ReduceM (Reduced MaybeReducedArgs Term)) -> PrimFun
- defClauses :: Definition -> [Clause]
- defCompiled :: Definition -> Maybe CompiledClauses
- defParameters :: Definition -> Maybe Nat
- defInverse :: Definition -> FunctionInverse
- defCompilerPragmas :: BackendName -> Definition -> [CompilerPragma]
- defDelayed :: Definition -> Delayed
- defNonterminating :: Definition -> Bool
- defTerminationUnconfirmed :: Definition -> Bool
- defAbstract :: Definition -> IsAbstract
- defForced :: Definition -> [IsForced]
- ifTopLevelAndHighlightingLevelIsOr :: MonadTCEnv tcm => HighlightingLevel -> Bool -> tcm () -> tcm ()
- ifTopLevelAndHighlightingLevelIs :: MonadTCEnv tcm => HighlightingLevel -> tcm () -> tcm ()
- initEnv :: TCEnv
- defaultUnquoteFlags :: UnquoteFlags
- unquoteNormalise :: Lens' Bool UnquoteFlags
- eUnquoteNormalise :: Lens' Bool TCEnv
- eContext :: Lens' Context TCEnv
- eLetBindings :: Lens' LetBindings TCEnv
- eCurrentModule :: Lens' ModuleName TCEnv
- eCurrentPath :: Lens' (Maybe AbsolutePath) TCEnv
- eAnonymousModules :: Lens' [(ModuleName, Nat)] TCEnv
- eImportPath :: Lens' [TopLevelModuleName] TCEnv
- eMutualBlock :: Lens' (Maybe MutualId) TCEnv
- eTerminationCheck :: Lens' (TerminationCheck ()) TCEnv
- eCoverageCheck :: Lens' CoverageCheck TCEnv
- eMakeCase :: Lens' Bool TCEnv
- eSolvingConstraints :: Lens' Bool TCEnv
- eCheckingWhere :: Lens' Bool TCEnv
- eWorkingOnTypes :: Lens' Bool TCEnv
- eAssignMetas :: Lens' Bool TCEnv
- eActiveProblems :: Lens' (Set ProblemId) TCEnv
- eAbstractMode :: Lens' AbstractMode TCEnv
- eModality :: Lens' Modality TCEnv
- eRelevance :: Lens' Relevance TCEnv
- eQuantity :: Lens' Quantity TCEnv
- eSplitOnStrict :: Lens' Bool TCEnv
- eDisplayFormsEnabled :: Lens' Bool TCEnv
- eRange :: Lens' Range TCEnv
- eHighlightingRange :: Lens' Range TCEnv
- eCall :: Lens' (Maybe (Closure Call)) TCEnv
- eHighlightingLevel :: Lens' HighlightingLevel TCEnv
- eHighlightingMethod :: Lens' HighlightingMethod TCEnv
- eExpandLast :: Lens' ExpandHidden TCEnv
- eAppDef :: Lens' (Maybe QName) TCEnv
- eSimplification :: Lens' Simplification TCEnv
- eAllowedReductions :: Lens' AllowedReductions TCEnv
- eReduceDefs :: Lens' ReduceDefs TCEnv
- eReconstructed :: Lens' Bool TCEnv
- eInjectivityDepth :: Lens' Int TCEnv
- eCompareBlocked :: Lens' Bool TCEnv
- ePrintDomainFreePi :: Lens' Bool TCEnv
- ePrintMetasBare :: Lens' Bool TCEnv
- eInsideDotPattern :: Lens' Bool TCEnv
- eUnquoteFlags :: Lens' UnquoteFlags TCEnv
- eInstanceDepth :: Lens' Int TCEnv
- eIsDebugPrinting :: Lens' Bool TCEnv
- ePrintingPatternLambdas :: Lens' [QName] TCEnv
- eCallByNeed :: Lens' Bool TCEnv
- eCurrentCheckpoint :: Lens' CheckpointId TCEnv
- eCheckpoints :: Lens' (Map CheckpointId Substitution) TCEnv
- eGeneralizeMetas :: Lens' DoGeneralize TCEnv
- eGeneralizedVars :: Lens' (Map QName GeneralizedValue) TCEnv
- eActiveBackendName :: Lens' (Maybe BackendName) TCEnv
- eConflComputingOverlap :: Lens' Bool TCEnv
- eCurrentlyElaborating :: Lens' Bool TCEnv
- aDefToMode :: IsAbstract -> AbstractMode
- aModeToDef :: AbstractMode -> Maybe IsAbstract
- isDontExpandLast :: ExpandHidden -> Bool
- recordFieldWarningToError :: RecordFieldWarning -> TypeError
- warningName :: Warning -> WarningName
- tcWarningOrigin :: TCWarning -> SrcFile
- sizedTypesOption :: HasOptions m => m Bool
- guardednessOption :: HasOptions m => m Bool
- withoutKOption :: HasOptions m => m Bool
- enableCaching :: HasOptions m => m Bool
- mapRedEnv :: (TCEnv -> TCEnv) -> ReduceEnv -> ReduceEnv
- mapRedSt :: (TCState -> TCState) -> ReduceEnv -> ReduceEnv
- mapRedEnvSt :: (TCEnv -> TCEnv) -> (TCState -> TCState) -> ReduceEnv -> ReduceEnv
- reduceEnv :: Lens' TCEnv ReduceEnv
- reduceSt :: Lens' TCState ReduceEnv
- onReduceEnv :: (ReduceEnv -> ReduceEnv) -> ReduceM a -> ReduceM a
- fmapReduce :: (a -> b) -> ReduceM a -> ReduceM b
- apReduce :: ReduceM (a -> b) -> ReduceM a -> ReduceM b
- thenReduce :: ReduceM a -> ReduceM b -> ReduceM b
- beforeReduce :: ReduceM a -> ReduceM b -> ReduceM a
- bindReduce :: ReduceM a -> (a -> ReduceM b) -> ReduceM b
- runReduceM :: ReduceM a -> TCM a
- runReduceF :: (a -> ReduceM b) -> TCM (a -> b)
- useR :: ReadTCState m => Lens' a TCState -> m a
- askR :: ReduceM ReduceEnv
- localR :: (ReduceEnv -> ReduceEnv) -> ReduceM a -> ReduceM a
- asksTC :: MonadTCEnv m => (TCEnv -> a) -> m a
- viewTC :: MonadTCEnv m => Lens' a TCEnv -> m a
- locallyTC :: MonadTCEnv m => Lens' a TCEnv -> (a -> a) -> m b -> m b
- getsTC :: ReadTCState m => (TCState -> a) -> m a
- modifyTC' :: MonadTCState m => (TCState -> TCState) -> m ()
- useTC :: ReadTCState m => Lens' a TCState -> m a
- setTCLens :: MonadTCState m => Lens' a TCState -> a -> m ()
- modifyTCLens :: MonadTCState m => Lens' a TCState -> (a -> a) -> m ()
- modifyTCLensM :: MonadTCState m => Lens' a TCState -> (a -> m a) -> m ()
- stateTCLens :: MonadTCState m => Lens' a TCState -> (a -> (r, a)) -> m r
- stateTCLensM :: MonadTCState m => Lens' a TCState -> (a -> m (r, a)) -> m r
- runBlocked :: Monad m => BlockT m a -> m (Either Blocker a)
- mapTCMT :: (forall a. m a -> n a) -> TCMT m a -> TCMT n a
- pureTCM :: MonadIO m => (TCState -> TCEnv -> a) -> TCMT m a
- returnTCMT :: Applicative m => a -> TCMT m a
- bindTCMT :: Monad m => TCMT m a -> (a -> TCMT m b) -> TCMT m b
- thenTCMT :: Applicative m => TCMT m a -> TCMT m b -> TCMT m b
- fmapTCMT :: Functor m => (a -> b) -> TCMT m a -> TCMT m b
- apTCMT :: Applicative m => TCMT m (a -> b) -> TCMT m a -> TCMT m b
- catchError_ :: TCM a -> (TCErr -> TCM a) -> TCM a
- finally_ :: TCM a -> TCM b -> TCM a
- internalError :: (HasCallStack, MonadTCM tcm) => String -> tcm a
- locatedTypeError :: MonadTCError m => (a -> TypeError) -> HasCallStack => a -> m b
- genericError :: (HasCallStack, MonadTCError m) => String -> m a
- genericDocError :: (HasCallStack, MonadTCError m) => Doc -> m a
- typeError' :: MonadTCError m => CallStack -> TypeError -> m a
- typeError :: (HasCallStack, MonadTCError m) => TypeError -> m a
- typeError'_ :: (MonadTCEnv m, ReadTCState m) => CallStack -> TypeError -> m TCErr
- typeError_ :: (HasCallStack, MonadTCEnv m, ReadTCState m) => TypeError -> m TCErr
- runTCM :: MonadIO m => TCEnv -> TCState -> TCMT m a -> m (a, TCState)
- runTCMTop :: TCM a -> IO (Either TCErr a)
- runTCMTop' :: MonadIO m => TCMT m a -> m a
- runSafeTCM :: TCM a -> TCState -> IO (a, TCState)
- forkTCM :: TCM a -> TCM ()
- patternInTeleName :: String
- extendedLambdaName :: String
- isExtendedLambdaName :: QName -> Bool
- absurdLambdaName :: String
- isAbsurdLambdaName :: QName -> Bool
- generalizedFieldName :: String
- getGeneralizedFieldName :: QName -> Maybe String
- class (Functor m, Applicative m, Monad m) => HasOptions m where
Documentation
Polarity for equality and subtype checking.
Constructors
| Covariant | monotone |
| Contravariant | antitone |
| Invariant | no information (mixed variance) |
| Nonvariant | constant |
Instances
| KillRange Polarity Source # | |
Defined in Agda.TypeChecking.Monad.Base Methods | |
| PrettyTCM Polarity Source # | |
Defined in Agda.TypeChecking.Pretty | |
| EmbPrj Polarity Source # | |
| Pretty Polarity Source # | |
| Data Polarity Source # | |
Defined in Agda.TypeChecking.Monad.Base Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Polarity -> c Polarity # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Polarity # toConstr :: Polarity -> Constr # dataTypeOf :: Polarity -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Polarity) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Polarity) # gmapT :: (forall b. Data b => b -> b) -> Polarity -> Polarity # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Polarity -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Polarity -> r # gmapQ :: (forall d. Data d => d -> u) -> Polarity -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Polarity -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Polarity -> m Polarity # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Polarity -> m Polarity # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Polarity -> m Polarity # | |
| Generic Polarity Source # | |
| Show Polarity Source # | |
| NFData Polarity Source # | |
Defined in Agda.TypeChecking.Monad.Base | |
| Eq Polarity Source # | |
| Abstract [Polarity] Source # | |
| Apply [Polarity] Source # | |
| type Rep Polarity Source # | |
Defined in Agda.TypeChecking.Monad.Base type Rep Polarity = D1 ('MetaData "Polarity" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-inplace" 'False) ((C1 ('MetaCons "Covariant" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "Contravariant" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "Invariant" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "Nonvariant" 'PrefixI 'False) (U1 :: Type -> Type))) | |
data Comparison Source #
Instances
type BackendName = String Source #
type ModuleToSource = Map TopLevelModuleName AbsolutePath Source #
Maps top-level module names to the corresponding source file names.
Instances
Constructors
| TCSt | |
Fields
| |
Instances
Constructors
| TCEnv | |
Fields
| |
Instances
data HighlightingLevel Source #
How much highlighting should be sent to the user interface?
Constructors
| None | |
| NonInteractive | |
| Interactive | This includes both non-interactive highlighting and interactive highlighting of the expression that is currently being type-checked. |
Instances
data HighlightingMethod Source #
How should highlighting be sent to the user interface?
Instances
For printing, we couple a meta with its name suggestion.
Constructors
| NamedMeta | |
Fields | |
Constructors
| TCWarning | |
Fields
| |
Instances
Type-checking errors.
Constructors
| TypeError | |
Fields
| |
| Exception Range Doc | |
| IOException TCState Range IOException | The first argument is the state in which the error was raised. |
| PatternErr Blocker | The exception which is usually caught.
Raised for pattern violations during unification ( |
Instances
| EncodeTCM TCErr Source # | |
| HasRange TCErr Source # | |
| PrettyTCM TCErr Source # | |
Defined in Agda.TypeChecking.Errors | |
| Exception TCErr Source # | |
Defined in Agda.TypeChecking.Monad.Base Methods toException :: TCErr -> SomeException # fromException :: SomeException -> Maybe TCErr # displayException :: TCErr -> String # | |
| Show TCErr Source # | |
| NFData TCErr Source # | |
Defined in Agda.TypeChecking.Monad.Base | |
| MonadError TCErr IM | |
Defined in Agda.Interaction.Monad | |
| MonadError TCErr TerM | |
Defined in Agda.Termination.Monad | |
| MonadError TCErr TCM Source # | |
Defined in Agda.TypeChecking.Monad.Base | |
| Monad m => MonadError TCErr (PureConversionT m) | |
Defined in Agda.TypeChecking.Conversion.Pure Methods throwError :: TCErr -> PureConversionT m a catchError :: PureConversionT m a -> (TCErr -> PureConversionT m a) -> PureConversionT m a | |
| Monad m => MonadBlock (ExceptT TCErr m) Source # | |
Defined in Agda.TypeChecking.Monad.Base | |
A non-fatal error is an error which does not prevent us from checking the document further and interacting with the user.
Constructors
| NicifierIssue DeclarationWarning | |
| TerminationIssue [TerminationError] | |
| UnreachableClauses QName [Range] | `UnreachableClauses f rs` means that the clauses in |
| CoverageIssue QName [(Telescope, [NamedArg DeBruijnPattern])] | `CoverageIssue f pss` means that |
| CoverageNoExactSplit QName [Clause] | |
| NotStrictlyPositive QName (Seq OccursWhere) | |
| UnsolvedMetaVariables [Range] | Do not use directly with |
| UnsolvedInteractionMetas [Range] | Do not use directly with |
| UnsolvedConstraints Constraints | Do not use directly with |
| CantGeneralizeOverSorts [MetaId] | |
| AbsurdPatternRequiresNoRHS [NamedArg DeBruijnPattern] | |
| OldBuiltin String String | In `OldBuiltin old new`, the BUILTIN old has been replaced by new |
| EmptyRewritePragma | If the user wrote just |
| EmptyWhere | An empty |
| IllformedAsClause String | If the user wrote something other than an unqualified name
in the |
| ClashesViaRenaming NameOrModule [Name] | If a |
| UselessPatternDeclarationForRecord String | The 'pattern' declaration is useless in the presence
of either |
| UselessPublic | If the user opens a module public before the module header. (See issue #2377.) |
| UselessHiding [ImportedName] | Names in |
| UselessInline QName | |
| WrongInstanceDeclaration | |
| InstanceWithExplicitArg QName | An instance was declared with an implicit argument, which means it will never actually be considered by instance search. |
| InstanceNoOutputTypeName Doc | The type of an instance argument doesn't end in a named or variable type, so it will never be considered by instance search. |
| InstanceArgWithExplicitArg Doc | As InstanceWithExplicitArg, but for local bindings rather than top-level instances. |
| InversionDepthReached QName | The --inversion-max-depth was reached. |
| NoGuardednessFlag QName | A coinductive record was declared but neither --guardedness nor --sized-types is enabled. |
| GenericWarning Doc | Harmless generic warning (not an error) |
| GenericNonFatalError Doc | Generic error which doesn't abort proceedings (not a warning) |
| GenericUseless Range Doc | Generic warning when code is useless and thus ignored.
|
| SafeFlagPostulate Name | |
| SafeFlagPragma [String] | Unsafe OPTIONS. |
| SafeFlagNonTerminating | |
| SafeFlagTerminating | |
| SafeFlagWithoutKFlagPrimEraseEquality | |
| WithoutKFlagPrimEraseEquality | |
| SafeFlagNoPositivityCheck | |
| SafeFlagPolarity | |
| SafeFlagNoUniverseCheck | |
| SafeFlagNoCoverageCheck | |
| SafeFlagInjective | |
| SafeFlagEta | ETA pragma is unsafe. |
| ParseWarning ParseWarning | |
| LibraryWarning LibWarning | |
| DeprecationWarning String String String | `DeprecationWarning old new version`:
|
| UserWarning Text | User-defined warning (e.g. to mention that a name is deprecated) |
| DuplicateUsing (List1 ImportedName) | Duplicate mentions of the same name in |
| FixityInRenamingModule (List1 Range) | Fixity of modules cannot be changed via renaming (since modules have no fixity). |
| ModuleDoesntExport QName [Name] [Name] [ImportedName] | Some imported names are not actually exported by the source module. The second argument is the names that could be exported. The third argument is the module names that could be exported. |
| InfectiveImport String ModuleName | Importing a file using an infective option into one which doesn't |
| CoInfectiveImport String ModuleName | Importing a file not using a coinfective option from one which does |
| RewriteNonConfluent Term Term Term Doc | Confluence checker found critical pair and equality checking resulted in a type error |
| RewriteMaybeNonConfluent Term Term [Doc] | Confluence checker got stuck on computing overlap between two rewrite rules |
| RewriteAmbiguousRules Term Term Term | The global confluence checker found a term |
| RewriteMissingRule Term Term Term | The global confluence checker found a term |
| PragmaCompileErased BackendName QName | COMPILE directive for an erased symbol |
| NotInScopeW [QName] | Out of scope error we can recover from |
| AsPatternShadowsConstructorOrPatternSynonym Bool | The as-name in an as-pattern may not shadow a constructor ( |
| RecordFieldWarning RecordFieldWarning |
Instances
type MonadTCError m = (MonadTCEnv m, ReadTCState m, MonadError TCErr m) Source #
The constraints needed for typeError and similar.
class (Applicative tcm, MonadIO tcm, MonadTCEnv tcm, MonadTCState tcm, HasOptions tcm) => MonadTCM tcm where Source #
Embedding a TCM computation.
Minimal complete definition
Nothing
Methods
Instances
| MonadTCM IM Source # | |
| MonadTCM TerM Source # | |
| MonadTCM m => MonadTCM (BlockT m) Source # | |
| MonadIO m => MonadTCM (TCMT m) Source # | |
| MonadTCM m => MonadTCM (NamesT m) Source # | |
| MonadTCM tcm => MonadTCM (ListT tcm) Source # | |
| MonadTCM tcm => MonadTCM (ChangeT tcm) Source # | |
| MonadTCM tcm => MonadTCM (MaybeT tcm) Source # | |
Defined in Agda.TypeChecking.Monad.Base | |
| MonadTCM tcm => MonadTCM (ExceptT err tcm) Source # | |
Defined in Agda.TypeChecking.Monad.Base | |
| MonadTCM tcm => MonadTCM (IdentityT tcm) Source # | |
Defined in Agda.TypeChecking.Monad.Base | |
| MonadTCM tcm => MonadTCM (ReaderT r tcm) Source # | |
Defined in Agda.TypeChecking.Monad.Base | |
| MonadTCM tcm => MonadTCM (StateT s tcm) Source # | |
Defined in Agda.TypeChecking.Monad.Base | |
| (Monoid w, MonadTCM tcm) => MonadTCM (WriterT w tcm) Source # | |
Defined in Agda.TypeChecking.Monad.Base | |
Instances
class Monad m => MonadBlock m where Source #
Minimal complete definition
Methods
patternViolation :: Blocker -> m a Source #
`patternViolation b` aborts the current computation
default patternViolation :: (MonadTrans t, MonadBlock n, m ~ t n) => Blocker -> m a Source #
catchPatternErr :: (Blocker -> m a) -> m a -> m a Source #
`catchPatternErr handle m` runs m, handling pattern violations
with handle (doesn't roll back the state)
Instances
class Monad m => MonadTCState m where Source #
MonadTCState made into its own dedicated service class.
This allows us to use MonadState for StateT extensions of TCM.
Minimal complete definition
Nothing
Methods
default getTC :: (MonadTrans t, MonadTCState n, t n ~ m) => m TCState Source #
putTC :: TCState -> m () Source #
default putTC :: (MonadTrans t, MonadTCState n, t n ~ m) => TCState -> m () Source #
Instances
| MonadTCState IM Source # | |
| MonadTCState TerM Source # | |
| MonadTCState m => MonadTCState (BlockT m) Source # | |
| MonadIO m => MonadTCState (TCMT m) Source # | |
| MonadTCState m => MonadTCState (NamesT m) Source # | |
| MonadTCState m => MonadTCState (ListT m) Source # | |
| MonadTCState m => MonadTCState (ChangeT m) Source # | |
| MonadTCState m => MonadTCState (MaybeT m) Source # | |
| MonadTCState m => MonadTCState (ExceptT err m) Source # | |
| MonadTCState m => MonadTCState (IdentityT m) Source # | |
| MonadTCState m => MonadTCState (ReaderT r m) Source # | |
| MonadTCState m => MonadTCState (StateT s m) Source # | |
| (Monoid w, MonadTCState m) => MonadTCState (WriterT w m) Source # | |
class Monad m => MonadTCEnv m where Source #
MonadTCEnv made into its own dedicated service class.
This allows us to use MonadReader for ReaderT extensions of TCM.
Minimal complete definition
Nothing
Methods
default askTC :: (MonadTrans t, MonadTCEnv n, t n ~ m) => m TCEnv Source #
Instances
| MonadTCEnv IM Source # | |
| MonadTCEnv AbsToCon Source # | |
| MonadTCEnv TerM Source # | |
| MonadTCEnv ReduceM Source # | |
| MonadTCEnv NLM Source # | |
| MonadTCEnv m => MonadTCEnv (PureConversionT m) Source # | |
Defined in Agda.TypeChecking.Conversion.Pure Methods askTC :: PureConversionT m TCEnv Source # localTC :: (TCEnv -> TCEnv) -> PureConversionT m a -> PureConversionT m a Source # | |
| MonadTCEnv m => MonadTCEnv (BlockT m) Source # | |
| MonadIO m => MonadTCEnv (TCMT m) Source # | |
| MonadTCEnv m => MonadTCEnv (NamesT m) Source # | |
| MonadTCEnv m => MonadTCEnv (ListT m) Source # | |
| MonadTCEnv m => MonadTCEnv (ChangeT m) Source # | |
| MonadTCEnv m => MonadTCEnv (MaybeT m) Source # | |
| MonadTCEnv m => MonadTCEnv (ExceptT err m) Source # | |
| MonadTCEnv m => MonadTCEnv (IdentityT m) Source # | |
| MonadTCEnv m => MonadTCEnv (ReaderT r m) Source # | |
| MonadTCEnv m => MonadTCEnv (StateT s m) Source # | |
| (Monoid w, MonadTCEnv m) => MonadTCEnv (WriterT w m) Source # | |
class (Applicative m, MonadTCEnv m, ReadTCState m, HasOptions m) => MonadReduce m where Source #
Minimal complete definition
Nothing
Methods
liftReduce :: ReduceM a -> m a Source #
default liftReduce :: (MonadTrans t, MonadReduce n, t n ~ m) => ReduceM a -> m a Source #
Instances
Instances
Environment of the reduce monad.
data LHSOrPatSyn Source #
Distinguish error message when parsing lhs or pattern synonym, resp.
Instances
| Generic LHSOrPatSyn Source # | |
Defined in Agda.TypeChecking.Monad.Base Associated Types type Rep LHSOrPatSyn :: Type -> Type # | |
| Show LHSOrPatSyn Source # | |
Defined in Agda.TypeChecking.Monad.Base Methods showsPrec :: Int -> LHSOrPatSyn -> ShowS # show :: LHSOrPatSyn -> String # showList :: [LHSOrPatSyn] -> ShowS # | |
| NFData LHSOrPatSyn Source # | |
Defined in Agda.TypeChecking.Monad.Base Methods rnf :: LHSOrPatSyn -> () # | |
| Eq LHSOrPatSyn Source # | |
Defined in Agda.TypeChecking.Monad.Base | |
| type Rep LHSOrPatSyn Source # | |
Constructors
Instances
data UnquoteError Source #
Constructors
| BadVisibility String (Arg Term) | |
| ConInsteadOfDef QName String String | |
| DefInsteadOfCon QName String String | |
| NonCanonical String Term | |
| BlockedOnMeta TCState Blocker | |
| UnquotePanic String |
Instances
data UnificationFailure Source #
Constructors
| UnifyIndicesNotVars Telescope Type Term Term Args | Failed to apply injectivity to constructor of indexed datatype |
| UnifyRecursiveEq Telescope Type Int Term | Can't solve equation because variable occurs in (type of) lhs |
| UnifyReflexiveEq Telescope Type Term | Can't solve reflexive equation because --without-K is enabled |
| UnifyUnusableModality Telescope Type Int Term Modality | Can't solve equation because solution modality is less "usable" |
Instances
data NegativeUnification Source #
Constructors
| UnifyConflict Telescope Term Term | |
| UnifyCycle Telescope Int Term |
Instances
data SplitError Source #
Error when splitting a pattern variable into possible constructor patterns.
Constructors
| NotADatatype (Closure Type) | Neither data type nor record. |
| BlockedType Blocker (Closure Type) | Type could not be sufficiently reduced. |
| ErasedDatatype Bool (Closure Type) | Data type, but in erased position.
If the boolean is |
| CoinductiveDatatype (Closure Type) | Split on codata not allowed. UNUSED, but keep! -- | NoRecordConstructor Type -- ^ record type, but no constructor |
| UnificationStuck | |
Fields
| |
| CosplitCatchall | Copattern split with a catchall |
| CosplitNoTarget | We do not know the target type of the clause. |
| CosplitNoRecordType (Closure Type) | Target type is not a record type. |
| CannotCreateMissingClause QName (Telescope, [NamedArg DeBruijnPattern]) Doc (Closure (Abs Type)) | |
| GenericSplitError String | |
Instances
data TerminationError Source #
Information about a mutual block which did not pass the termination checker.
Constructors
| TerminationError | |
Fields
| |
Instances
Information about a call.
Constructors
| CallInfo | |
Fields
| |
Instances
| PrettyTCM CallInfo Source # | |
Defined in Agda.TypeChecking.Pretty.Call | |
| Pretty CallInfo Source # | We only |
| Generic CallInfo Source # | |
| Show CallInfo Source # | |
| NFData CallInfo Source # | |
Defined in Agda.TypeChecking.Monad.Base | |
| type Rep CallInfo Source # | |
Defined in Agda.TypeChecking.Monad.Base type Rep CallInfo = D1 ('MetaData "CallInfo" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-inplace" 'False) (C1 ('MetaCons "CallInfo" 'PrefixI 'True) (S1 ('MetaSel ('Just "callInfoTarget") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName) :*: (S1 ('MetaSel ('Just "callInfoRange") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Range) :*: S1 ('MetaSel ('Just "callInfoCall") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Closure Term))))) | |
data RecordFieldWarning Source #
Constructors
| DuplicateFieldsWarning [(Name, Range)] | Each redundant field comes with a range of associated dead code. |
| TooManyFieldsWarning QName [Name] [(Name, Range)] | Record type, fields not supplied by user, non-fields but supplied. The redundant fields come with a range of associated dead code. |
Instances
data ArgsCheckState a Source #
Constructors
| ACState | |
Fields
| |
Instances
| Show a => Show (ArgsCheckState a) Source # | |
Defined in Agda.TypeChecking.Monad.Base Methods showsPrec :: Int -> ArgsCheckState a -> ShowS # show :: ArgsCheckState a -> String # showList :: [ArgsCheckState a] -> ShowS # | |
A candidate solution for an instance meta is a term with its type. It may be the case that the candidate is not fully applied yet or of the wrong type, hence the need for the type.
Constructors
| Candidate | |
Fields | |
Instances
data CandidateKind Source #
Constructors
| LocalCandidate | |
| GlobalCandidate QName |
Instances
data ExpandHidden Source #
Constructors
| ExpandLast | Add implicit arguments in the end until type is no longer hidden |
| DontExpandLast | Do not append implicit arguments. |
| ReallyDontExpandLast | Makes |
Instances
| Data ExpandHidden Source # | |
Defined in Agda.TypeChecking.Monad.Base Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ExpandHidden -> c ExpandHidden # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c ExpandHidden # toConstr :: ExpandHidden -> Constr # dataTypeOf :: ExpandHidden -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c ExpandHidden) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c ExpandHidden) # gmapT :: (forall b. Data b => b -> b) -> ExpandHidden -> ExpandHidden # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ExpandHidden -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ExpandHidden -> r # gmapQ :: (forall d. Data d => d -> u) -> ExpandHidden -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> ExpandHidden -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> ExpandHidden -> m ExpandHidden # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ExpandHidden -> m ExpandHidden # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ExpandHidden -> m ExpandHidden # | |
| Generic ExpandHidden Source # | |
Defined in Agda.TypeChecking.Monad.Base Associated Types type Rep ExpandHidden :: Type -> Type # | |
| NFData ExpandHidden Source # | |
Defined in Agda.TypeChecking.Monad.Base Methods rnf :: ExpandHidden -> () # | |
| Eq ExpandHidden Source # | |
Defined in Agda.TypeChecking.Monad.Base | |
| type Rep ExpandHidden Source # | |
Defined in Agda.TypeChecking.Monad.Base type Rep ExpandHidden = D1 ('MetaData "ExpandHidden" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-inplace" 'False) (C1 ('MetaCons "ExpandLast" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "DontExpandLast" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "ReallyDontExpandLast" 'PrefixI 'False) (U1 :: Type -> Type))) | |
data AbstractMode Source #
Constructors
| AbstractMode | Abstract things in the current module can be accessed. |
| ConcreteMode | No abstract things can be accessed. |
| IgnoreAbstractMode | All abstract things can be accessed. |
Instances
| Data AbstractMode Source # | |
Defined in Agda.TypeChecking.Monad.Base Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> AbstractMode -> c AbstractMode # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c AbstractMode # toConstr :: AbstractMode -> Constr # dataTypeOf :: AbstractMode -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c AbstractMode) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c AbstractMode) # gmapT :: (forall b. Data b => b -> b) -> AbstractMode -> AbstractMode # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> AbstractMode -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> AbstractMode -> r # gmapQ :: (forall d. Data d => d -> u) -> AbstractMode -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> AbstractMode -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> AbstractMode -> m AbstractMode # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> AbstractMode -> m AbstractMode # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> AbstractMode -> m AbstractMode # | |
| Generic AbstractMode Source # | |
Defined in Agda.TypeChecking.Monad.Base Associated Types type Rep AbstractMode :: Type -> Type # | |
| Show AbstractMode Source # | |
Defined in Agda.TypeChecking.Monad.Base Methods showsPrec :: Int -> AbstractMode -> ShowS # show :: AbstractMode -> String # showList :: [AbstractMode] -> ShowS # | |
| NFData AbstractMode Source # | |
Defined in Agda.TypeChecking.Monad.Base Methods rnf :: AbstractMode -> () # | |
| Eq AbstractMode Source # | |
Defined in Agda.TypeChecking.Monad.Base | |
| type Rep AbstractMode Source # | |
Defined in Agda.TypeChecking.Monad.Base type Rep AbstractMode = D1 ('MetaData "AbstractMode" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-inplace" 'False) (C1 ('MetaCons "AbstractMode" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "ConcreteMode" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "IgnoreAbstractMode" 'PrefixI 'False) (U1 :: Type -> Type))) | |
type Context = [ContextEntry] Source #
The Context is a stack of ContextEntrys.
data UnquoteFlags Source #
Constructors
| UnquoteFlags | |
Fields | |
Instances
| Data UnquoteFlags Source # | |
Defined in Agda.TypeChecking.Monad.Base Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> UnquoteFlags -> c UnquoteFlags # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c UnquoteFlags # toConstr :: UnquoteFlags -> Constr # dataTypeOf :: UnquoteFlags -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c UnquoteFlags) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c UnquoteFlags) # gmapT :: (forall b. Data b => b -> b) -> UnquoteFlags -> UnquoteFlags # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> UnquoteFlags -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> UnquoteFlags -> r # gmapQ :: (forall d. Data d => d -> u) -> UnquoteFlags -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> UnquoteFlags -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> UnquoteFlags -> m UnquoteFlags # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> UnquoteFlags -> m UnquoteFlags # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> UnquoteFlags -> m UnquoteFlags # | |
| Generic UnquoteFlags Source # | |
Defined in Agda.TypeChecking.Monad.Base Associated Types type Rep UnquoteFlags :: Type -> Type # | |
| NFData UnquoteFlags Source # | |
Defined in Agda.TypeChecking.Monad.Base Methods rnf :: UnquoteFlags -> () # | |
| type Rep UnquoteFlags Source # | |
Defined in Agda.TypeChecking.Monad.Base type Rep UnquoteFlags = D1 ('MetaData "UnquoteFlags" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-inplace" 'False) (C1 ('MetaCons "UnquoteFlags" 'PrefixI 'True) (S1 ('MetaSel ('Just "_unquoteNormalise") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool))) | |
Instances
data BuiltinInfo Source #
Constructors
| BuiltinInfo | |
Fields | |
data BuiltinDescriptor Source #
Constructors
| BuiltinData (TCM Type) [String] | |
| BuiltinDataCons (TCM Type) | |
| BuiltinPrim String (Term -> TCM ()) | |
| BuiltinSort String | |
| BuiltinPostulate Relevance (TCM Type) | |
| BuiltinUnknown (Maybe (TCM Type)) (Term -> Type -> TCM ()) | Builtin of any kind.
Type can be checked ( |
type TempInstanceTable = (InstanceTable, Set QName) Source #
When typechecking something of the following form:
instance x : _ x = y
it's not yet known where to add x, so we add it to a list of
unresolved instances and we'll deal with it later.
type InstanceTable = Map QName (Set QName) Source #
The instance table is a Map associating to every name of
recorddata typepostulate its list of instances
Constructors
Instances
Instances
| KillRange MutualId Source # | |
Defined in Agda.TypeChecking.Monad.Base Methods | |
| HasFresh MutualId Source # | |
| EmbPrj MutualId Source # | |
| Data MutualId Source # | |
Defined in Agda.TypeChecking.Monad.Base Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> MutualId -> c MutualId # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c MutualId # toConstr :: MutualId -> Constr # dataTypeOf :: MutualId -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c MutualId) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c MutualId) # gmapT :: (forall b. Data b => b -> b) -> MutualId -> MutualId # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> MutualId -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> MutualId -> r # gmapQ :: (forall d. Data d => d -> u) -> MutualId -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> MutualId -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> MutualId -> m MutualId # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> MutualId -> m MutualId # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> MutualId -> m MutualId # | |
| Enum MutualId Source # | |
Defined in Agda.TypeChecking.Monad.Base | |
| Num MutualId Source # | |
| Show MutualId Source # | |
| NFData MutualId Source # | |
Defined in Agda.TypeChecking.Monad.Base | |
| Eq MutualId Source # | |
| Ord MutualId Source # | |
Defined in Agda.TypeChecking.Monad.Base | |
Instances
| KillRange TermHead Source # | |
Defined in Agda.TypeChecking.Monad.Base Methods | |
| EmbPrj TermHead Source # | |
| Pretty TermHead Source # | |
| Data TermHead Source # | |
Defined in Agda.TypeChecking.Monad.Base Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> TermHead -> c TermHead # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c TermHead # toConstr :: TermHead -> Constr # dataTypeOf :: TermHead -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c TermHead) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c TermHead) # gmapT :: (forall b. Data b => b -> b) -> TermHead -> TermHead # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> TermHead -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> TermHead -> r # gmapQ :: (forall d. Data d => d -> u) -> TermHead -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> TermHead -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> TermHead -> m TermHead # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> TermHead -> m TermHead # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> TermHead -> m TermHead # | |
| Generic TermHead Source # | |
| Show TermHead Source # | |
| NFData TermHead Source # | |
Defined in Agda.TypeChecking.Monad.Base | |
| Eq TermHead Source # | |
| Ord TermHead Source # | |
Defined in Agda.TypeChecking.Monad.Base | |
| type Rep TermHead Source # | |
Defined in Agda.TypeChecking.Monad.Base type Rep TermHead = D1 ('MetaData "TermHead" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-inplace" 'False) ((C1 ('MetaCons "SortHead" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "PiHead" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "ConsHead" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName)) :+: (C1 ('MetaCons "VarHead" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Nat)) :+: C1 ('MetaCons "UnknownHead" 'PrefixI 'False) (U1 :: Type -> Type)))) | |
data FunctionInverse' c Source #
Constructors
| NotInjective | |
| Inverse (InversionMap c) |
Instances
type InversionMap c = Map TermHead [c] Source #
type FunctionInverse = FunctionInverse' Clause Source #
Constructors
| PrimFun | |
Fields
| |
Instances
| Abstract PrimFun Source # | |
| Apply PrimFun Source # | |
| Generic PrimFun Source # | |
| NFData PrimFun Source # | |
Defined in Agda.TypeChecking.Monad.Base | |
| type Rep PrimFun Source # | |
Defined in Agda.TypeChecking.Monad.Base type Rep PrimFun = D1 ('MetaData "PrimFun" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-inplace" 'False) (C1 ('MetaCons "PrimFun" 'PrefixI 'True) (S1 ('MetaSel ('Just "primFunName") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName) :*: (S1 ('MetaSel ('Just "primFunArity") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Arity) :*: S1 ('MetaSel ('Just "primFunImplementation") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ([Arg Term] -> Int -> ReduceM (Reduced MaybeReducedArgs Term)))))) | |
data ReduceDefs Source #
Constructors
| OnlyReduceDefs (Set QName) | |
| DontReduceDefs (Set QName) |
Instances
data AllowedReduction Source #
Controlling reduce.
Constructors
| ProjectionReductions | (Projection and) projection-like functions may be reduced. |
| InlineReductions | Functions marked INLINE may be reduced. |
| CopatternReductions | Copattern definitions may be reduced. |
| FunctionReductions | Non-recursive functions and primitives may be reduced. |
| RecursiveReductions | Even recursive functions may be reduced. |
| LevelReductions | Reduce |
| TypeLevelReductions | Allow |
| UnconfirmedReductions | Functions whose termination has not (yet) been confirmed. |
| NonTerminatingReductions | Functions that have failed termination checking. |
Instances
type MaybeReducedElims = [MaybeReduced Elim] Source #
type MaybeReducedArgs = [MaybeReduced (Arg Term)] Source #
data MaybeReduced a Source #
Constructors
| MaybeRed | |
Fields
| |
Instances
| Functor MaybeReduced Source # | |
Defined in Agda.TypeChecking.Monad.Base Methods fmap :: (a -> b) -> MaybeReduced a -> MaybeReduced b # (<$) :: a -> MaybeReduced b -> MaybeReduced a # | |
| IsProjElim e => IsProjElim (MaybeReduced e) Source # | |
Defined in Agda.TypeChecking.Monad.Base Methods isProjElim :: MaybeReduced e -> Maybe (ProjOrigin, QName) Source # | |
| PrettyTCM a => PrettyTCM (MaybeReduced a) Source # | |
Defined in Agda.TypeChecking.Pretty Methods prettyTCM :: MonadPretty m => MaybeReduced a -> m Doc Source # | |
Three cases: 1. not reduced, 2. reduced, but blocked, 3. reduced, not blocked.
Constructors
| NotReduced | |
| Reduced (Blocked ()) |
Constructors
| NoReduction no | |
| YesReduction Simplification yes |
data Simplification Source #
Did we encounter a simplifying reduction? In terms of CIC, that would be a iota-reduction. In terms of Agda, this is a constructor or literal pattern that matched. Just beta-reduction (substitution) or delta-reduction (unfolding of definitions) does not count as simplifying?
Constructors
| YesSimplification | |
| NoSimplification |
Instances
Constructors
| Axiom | Postulate |
Fields
| |
| DataOrRecSig | Data or record type signature that doesn't yet have a definition |
Fields
| |
| GeneralizableVar | Generalizable variable (introduced in |
| AbstractDefn Defn | Returned by |
| Function | |
Fields
| |
| Datatype | |
Fields
| |
| Record | |
Fields
| |
| Constructor | |
Fields
| |
| Primitive | Primitive or builtin functions. |
Fields
| |
| PrimitiveSort | |
Instances
Constructors
| CompKit | |
Fields
| |
Instances
| NamesIn CompKit Source # | |
| KillRange CompKit Source # | |
Defined in Agda.TypeChecking.Monad.Base Methods | |
| EmbPrj CompKit Source # | |
| Data CompKit Source # | |
Defined in Agda.TypeChecking.Monad.Base Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> CompKit -> c CompKit # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c CompKit # toConstr :: CompKit -> Constr # dataTypeOf :: CompKit -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c CompKit) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c CompKit) # gmapT :: (forall b. Data b => b -> b) -> CompKit -> CompKit # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> CompKit -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> CompKit -> r # gmapQ :: (forall d. Data d => d -> u) -> CompKit -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> CompKit -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> CompKit -> m CompKit # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> CompKit -> m CompKit # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> CompKit -> m CompKit # | |
| Generic CompKit Source # | |
| Show CompKit Source # | |
| NFData CompKit Source # | |
Defined in Agda.TypeChecking.Monad.Base | |
| Eq CompKit Source # | |
| Ord CompKit Source # | |
Defined in Agda.TypeChecking.Monad.Base | |
| type Rep CompKit Source # | |
Defined in Agda.TypeChecking.Monad.Base type Rep CompKit = D1 ('MetaData "CompKit" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-inplace" 'False) (C1 ('MetaCons "CompKit" 'PrefixI 'True) (S1 ('MetaSel ('Just "nameOfHComp") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe QName)) :*: S1 ('MetaSel ('Just "nameOfTransp") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe QName)))) | |
data FunctionFlag Source #
Constructors
| FunStatic | Should calls to this function be normalised at compile-time? |
| FunInline | Should calls to this function be inlined by the compiler? |
| FunMacro | Is this function a macro? |
Instances
data EtaEquality Source #
Should a record type admit eta-equality?
Constructors
| Specified | User specifed 'eta-equality' or 'no-eta-equality'. |
Fields
| |
| Inferred | Positivity checker inferred whether eta is safe. |
Fields
| |
Instances
Abstractions to build projection function (dropping parameters).
Constructors
| ProjLams | |
Fields
| |
Instances
| KillRange ProjLams Source # | |
Defined in Agda.TypeChecking.Monad.Base Methods | |
| EmbPrj ProjLams Source # | |
| Abstract ProjLams Source # | |
| Apply ProjLams Source # | |
| Null ProjLams Source # | |
| Pretty ProjLams Source # | |
| Data ProjLams Source # | |
Defined in Agda.TypeChecking.Monad.Base Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ProjLams -> c ProjLams # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c ProjLams # toConstr :: ProjLams -> Constr # dataTypeOf :: ProjLams -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c ProjLams) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c ProjLams) # gmapT :: (forall b. Data b => b -> b) -> ProjLams -> ProjLams # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ProjLams -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ProjLams -> r # gmapQ :: (forall d. Data d => d -> u) -> ProjLams -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> ProjLams -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> ProjLams -> m ProjLams # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ProjLams -> m ProjLams # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ProjLams -> m ProjLams # | |
| Generic ProjLams Source # | |
| Show ProjLams Source # | |
| NFData ProjLams Source # | |
Defined in Agda.TypeChecking.Monad.Base | |
| type Rep ProjLams Source # | |
Defined in Agda.TypeChecking.Monad.Base | |
data Projection Source #
Additional information for projection Functions.
Constructors
| Projection | |
Fields
| |
Instances
data ExtLamInfo Source #
Additional information for extended lambdas.
Constructors
| ExtLamInfo | |
Fields
| |
Instances
An alternative representation of partial elements in a telescope: Γ ⊢ λ Δ. [φ₁ u₁, ... , φₙ uₙ] : Δ → PartialP (∨_ᵢ φᵢ) T see cubicaltt paper (however we do not store the type T).
Constructors
| System | |
Fields
| |
Instances
| KillRange System Source # | |
Defined in Agda.TypeChecking.Monad.Base Methods | |
| InstantiateFull System Source # | |
Defined in Agda.TypeChecking.Reduce | |
| EmbPrj System Source # | |
| Abstract System Source # | |
| Apply System Source # | |
| Data System Source # | |
Defined in Agda.TypeChecking.Monad.Base Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> System -> c System # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c System # toConstr :: System -> Constr # dataTypeOf :: System -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c System) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c System) # gmapT :: (forall b. Data b => b -> b) -> System -> System # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> System -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> System -> r # gmapQ :: (forall d. Data d => d -> u) -> System -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> System -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> System -> m System # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> System -> m System # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> System -> m System # | |
| Generic System Source # | |
| Show System Source # | |
| NFData System Source # | |
Defined in Agda.TypeChecking.Monad.Base | |
| Reify (QNamed System) Source # | |
| type Rep System Source # | |
Defined in Agda.TypeChecking.Monad.Base type Rep System = D1 ('MetaData "System" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-inplace" 'False) (C1 ('MetaCons "System" 'PrefixI 'True) (S1 ('MetaSel ('Just "systemTel") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Telescope) :*: S1 ('MetaSel ('Just "systemClauses") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [(Face, Term)]))) | |
| type ReifiesTo (QNamed System) Source # | |
Defined in Agda.Syntax.Translation.InternalToAbstract | |
data CompilerPragma Source #
The backends are responsible for parsing their own pragmas.
Constructors
| CompilerPragma Range String |
Instances
Information about whether an argument is forced by the type of a function.
Instances
| KillRange IsForced Source # | |
Defined in Agda.TypeChecking.Monad.Base Methods | |
| PrettyTCM IsForced Source # | |
Defined in Agda.TypeChecking.Pretty | |
| ChooseFlex IsForced Source # | |
Defined in Agda.TypeChecking.Rules.LHS.Problem Methods chooseFlex :: IsForced -> IsForced -> FlexChoice Source # | |
| EmbPrj IsForced Source # | |
| Data IsForced Source # | |
Defined in Agda.TypeChecking.Monad.Base Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> IsForced -> c IsForced # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c IsForced # toConstr :: IsForced -> Constr # dataTypeOf :: IsForced -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c IsForced) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c IsForced) # gmapT :: (forall b. Data b => b -> b) -> IsForced -> IsForced # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> IsForced -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> IsForced -> r # gmapQ :: (forall d. Data d => d -> u) -> IsForced -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> IsForced -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> IsForced -> m IsForced # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> IsForced -> m IsForced # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> IsForced -> m IsForced # | |
| Generic IsForced Source # | |
| Show IsForced Source # | |
| NFData IsForced Source # | |
Defined in Agda.TypeChecking.Monad.Base | |
| Eq IsForced Source # | |
| type Rep IsForced Source # | |
data NumGeneralizableArgs Source #
Constructors
| NoGeneralizableArgs | |
| SomeGeneralizableArgs !Int | When lambda-lifting new args are generalizable if
|
Instances
data Definition Source #
Constructors
| Defn | |
Fields
| |
Instances
data RewriteRule Source #
Rewrite rules can be added independently from function clauses.
Constructors
| RewriteRule | |
Fields
| |
Instances
type RewriteRules = [RewriteRule] Source #
Instances
Constructors
| NLPType | |
Fields
| |
Instances
Non-linear (non-constructor) first-order pattern.
Constructors
| PVar !Int [Arg Int] | Matches anything (modulo non-linearity) that only contains bound variables that occur in the given arguments. |
| PDef QName PElims | Matches |
| PLam ArgInfo (Abs NLPat) | Matches |
| PPi (Dom NLPType) (Abs NLPType) | Matches |
| PSort NLPSort | Matches a sort of the given shape. |
| PBoundVar !Int PElims | Matches |
| PTerm Term | Matches the term modulo β (ideally βη). |
Instances
data DisplayTerm Source #
Constructors
| DWithApp DisplayTerm [DisplayTerm] Elims |
|
| DCon ConHead ConInfo [Arg DisplayTerm] |
|
| DDef QName [Elim' DisplayTerm] |
|
| DDot Term |
|
| DTerm Term |
|
Instances
type LocalDisplayForm = Open DisplayForm Source #
data DisplayForm Source #
A DisplayForm is in essence a rewrite rule q ts --> dt for a defined symbol (could be a
constructor as well) q. The right hand side is a DisplayTerm which is used to reify to a
more readable Syntax.
The patterns ts are just terms, but the first dfPatternVars variables are pattern variables
that matches any term.
Constructors
| Display | |
Fields
| |
Instances
Constructors
| Section | |
Fields | |
Instances
| KillRange Section Source # | |
Defined in Agda.TypeChecking.Monad.Base Methods | |
| KillRange Sections Source # | |
Defined in Agda.TypeChecking.Monad.Base Methods | |
| InstantiateFull Section Source # | |
Defined in Agda.TypeChecking.Reduce | |
| EmbPrj Section Source # | |
| Pretty Section Source # | |
| Data Section Source # | |
Defined in Agda.TypeChecking.Monad.Base Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Section -> c Section # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Section # toConstr :: Section -> Constr # dataTypeOf :: Section -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Section) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Section) # gmapT :: (forall b. Data b => b -> b) -> Section -> Section # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Section -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Section -> r # gmapQ :: (forall d. Data d => d -> u) -> Section -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Section -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Section -> m Section # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Section -> m Section # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Section -> m Section # | |
| Show Section Source # | |
| NFData Section Source # | |
Defined in Agda.TypeChecking.Monad.Base | |
| Eq Section Source # | |
type DisplayForms = HashMap QName [LocalDisplayForm] Source #
type RewriteRuleMap = HashMap QName RewriteRules Source #
type Definitions = HashMap QName Definition Source #
Constructors
| Sig | |
Fields
| |
Instances
| KillRange Signature Source # | |
Defined in Agda.TypeChecking.Monad.Base Methods | |
| InstantiateFull Signature Source # | |
Defined in Agda.TypeChecking.Reduce | |
| EmbPrj Signature Source # | |
| Generic Signature Source # | |
| Show Signature Source # | |
| NFData Signature Source # | |
Defined in Agda.TypeChecking.Monad.Base | |
| type Rep Signature Source # | |
Defined in Agda.TypeChecking.Monad.Base type Rep Signature = D1 ('MetaData "Signature" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-inplace" 'False) (C1 ('MetaCons "Sig" 'PrefixI 'True) (S1 ('MetaSel ('Just "_sigSections") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Sections) :*: (S1 ('MetaSel ('Just "_sigDefinitions") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Definitions) :*: S1 ('MetaSel ('Just "_sigRewriteRules") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 RewriteRuleMap)))) | |
Which clause is an interaction point located in?
Constructors
| IPClause | |
Fields
| |
| IPNoClause | The interaction point is not in the rhs of a clause. |
Instances
type IPBoundary = IPBoundary' Term Source #
data IPBoundary' t Source #
Datatype representing a single boundary condition: x_0 = u_0, ... ,x_n = u_n ⊢ t = ?n es
Constructors
| IPBoundary | |
Fields
| |
Instances
data Overapplied Source #
Flag to indicate whether the meta is overapplied in the constraint. A meta is overapplied if it has more arguments than the size of the telescope in its creation environment (as stored in MetaInfo).
Constructors
| Overapplied | |
| NotOverapplied |
Instances
| Data Overapplied Source # | |
Defined in Agda.TypeChecking.Monad.Base Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Overapplied -> c Overapplied # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Overapplied # toConstr :: Overapplied -> Constr # dataTypeOf :: Overapplied -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Overapplied) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Overapplied) # gmapT :: (forall b. Data b => b -> b) -> Overapplied -> Overapplied # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Overapplied -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Overapplied -> r # gmapQ :: (forall d. Data d => d -> u) -> Overapplied -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Overapplied -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Overapplied -> m Overapplied # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Overapplied -> m Overapplied # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Overapplied -> m Overapplied # | |
| Generic Overapplied Source # | |
Defined in Agda.TypeChecking.Monad.Base Associated Types type Rep Overapplied :: Type -> Type # | |
| Show Overapplied Source # | |
Defined in Agda.TypeChecking.Monad.Base Methods showsPrec :: Int -> Overapplied -> ShowS # show :: Overapplied -> String # showList :: [Overapplied] -> ShowS # | |
| NFData Overapplied Source # | |
Defined in Agda.TypeChecking.Monad.Base Methods rnf :: Overapplied -> () # | |
| Eq Overapplied Source # | |
Defined in Agda.TypeChecking.Monad.Base | |
| type Rep Overapplied Source # | |
Defined in Agda.TypeChecking.Monad.Base | |
type InteractionPoints = BiMap InteractionId InteractionPoint Source #
Data structure managing the interaction points.
We never remove interaction points from this map, only set their
ipSolved to True. (Issue #2368)
data InteractionPoint Source #
Interaction points are created by the scope checker who sets the range. The meta variable is created by the type checker and then hooked up to the interaction point.
Constructors
| InteractionPoint | |
Instances
type MetaStore = IntMap MetaVariable Source #
type MetaNameSuggestion = String Source #
Name suggestion for meta variable. Empty string means no suggestion.
MetaInfo is cloned from one meta to the next during pruning.
Constructors
| MetaInfo | |
Fields
| |
Instances
data RunMetaOccursCheck Source #
Constructors
| RunMetaOccursCheck | |
| DontRunMetaOccursCheck |
Instances
newtype MetaPriority Source #
Meta variable priority: When we have an equation between meta-variables, which one should be instantiated?
Higher value means higher priority to be instantiated.
Constructors
| MetaPriority Int |
Instances
| Show MetaPriority Source # | |
Defined in Agda.TypeChecking.Monad.Base Methods showsPrec :: Int -> MetaPriority -> ShowS # show :: MetaPriority -> String # showList :: [MetaPriority] -> ShowS # | |
| NFData MetaPriority Source # | |
Defined in Agda.TypeChecking.Monad.Base Methods rnf :: MetaPriority -> () # | |
| Eq MetaPriority Source # | |
Defined in Agda.TypeChecking.Monad.Base | |
| Ord MetaPriority Source # | |
Defined in Agda.TypeChecking.Monad.Base Methods compare :: MetaPriority -> MetaPriority -> Ordering # (<) :: MetaPriority -> MetaPriority -> Bool # (<=) :: MetaPriority -> MetaPriority -> Bool # (>) :: MetaPriority -> MetaPriority -> Bool # (>=) :: MetaPriority -> MetaPriority -> Bool # max :: MetaPriority -> MetaPriority -> MetaPriority # min :: MetaPriority -> MetaPriority -> MetaPriority # | |
data TypeCheckingProblem Source #
Constructors
| CheckExpr Comparison Expr Type | |
| CheckArgs Comparison ExpandHidden Range [NamedArg Expr] Type Type (ArgsCheckState CheckedTarget -> TCM Term) | |
| CheckProjAppToKnownPrincipalArg Comparison Expr ProjOrigin (List1 QName) Args Type Int Term Type PrincipalArgTypeMetas | |
| CheckLambda Comparison (Arg (List1 (WithHiding Name), Maybe Type)) Expr Type |
|
| DoQuoteTerm Comparison Term Type | Quote the given term and check type against |
Instances
data PrincipalArgTypeMetas Source #
Constructors
| PrincipalArgTypeMetas | |
Fields
| |
Instances
| Generic PrincipalArgTypeMetas Source # | |
Defined in Agda.TypeChecking.Monad.Base Associated Types type Rep PrincipalArgTypeMetas :: Type -> Type # Methods from :: PrincipalArgTypeMetas -> Rep PrincipalArgTypeMetas x # to :: Rep PrincipalArgTypeMetas x -> PrincipalArgTypeMetas # | |
| NFData PrincipalArgTypeMetas Source # | |
Defined in Agda.TypeChecking.Monad.Base Methods rnf :: PrincipalArgTypeMetas -> () # | |
| type Rep PrincipalArgTypeMetas Source # | |
Defined in Agda.TypeChecking.Monad.Base type Rep PrincipalArgTypeMetas = D1 ('MetaData "PrincipalArgTypeMetas" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-inplace" 'False) (C1 ('MetaCons "PrincipalArgTypeMetas" 'PrefixI 'True) (S1 ('MetaSel ('Just "patmMetas") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Args) :*: S1 ('MetaSel ('Just "patmRemainder") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type))) | |
data CheckedTarget Source #
Solving a CheckArgs constraint may or may not check the target type. If
it did, it returns a handle to any unsolved constraints.
Constructors
| CheckedTarget (Maybe ProblemId) | |
| NotCheckedTarget |
data MetaInstantiation Source #
Constructors
| InstV [Arg String] Term | solved by term (abstracted over some free variables) |
| Open | unsolved |
| OpenInstance | open, to be instantiated by instance search |
| BlockedConst Term | solution blocked by unsolved constraints |
| PostponedTypeCheckingProblem (Closure TypeCheckingProblem) |
Instances
Frozen meta variable cannot be instantiated by unification. This serves to prevent the completion of a definition by its use outside of the current block. (See issues 118, 288, 399).
Constructors
| Frozen | Do not instantiate. |
| Instantiable |
Constructors
| EtaExpand MetaId | |
| CheckConstraint Nat ProblemConstraint |
Instances
| Generic Listener Source # | |
| NFData Listener Source # | |
Defined in Agda.TypeChecking.Monad.Base | |
| Eq Listener Source # | |
| Ord Listener Source # | |
Defined in Agda.TypeChecking.Monad.Base | |
| type Rep Listener Source # | |
Defined in Agda.TypeChecking.Monad.Base type Rep Listener = D1 ('MetaData "Listener" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-inplace" 'False) (C1 ('MetaCons "EtaExpand" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 MetaId)) :+: C1 ('MetaCons "CheckConstraint" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Nat) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ProblemConstraint))) | |
data MetaVariable Source #
Constructors
| MetaVar | |
Fields
| |
Instances
data GeneralizedValue Source #
The value of a generalizable variable. This is created to be a generalizable meta before checking the type to be generalized.
Constructors
| GeneralizedValue | |
Fields
| |
Instances
data DoGeneralize Source #
Constructors
| YesGeneralizeVar | Generalize because it is a generalizable variable. |
| YesGeneralizeMeta | Generalize because it is a metavariable and we're currently checking the type of a generalizable variable (this should get the default modality). |
| NoGeneralize | Don't generalize. |
Instances
Parametrized since it is used without MetaId when creating a new meta.
Constructors
| HasType | |
Fields
| |
| IsSort | |
Instances
A thing tagged with the context it came from. Also keeps the substitution from previous checkpoints. This lets us handle the case when an open thing was created in a context that we have since exited. Remember which module it's from to make sure we don't get confused by checkpoints from other files.
Constructors
| OpenThing | |
Instances
We can either compare two terms at a given type, or compare two types without knowing (or caring about) their sorts.
Constructors
| AsTermsOf Type |
|
| AsSizes | Replaces |
| AsTypes |
Instances
data CompareDirection Source #
An extension of Comparison to >=.
Instances
| Pretty CompareDirection Source # | |
Defined in Agda.TypeChecking.Monad.Base Methods pretty :: CompareDirection -> Doc Source # prettyPrec :: Int -> CompareDirection -> Doc Source # prettyList :: [CompareDirection] -> Doc Source # | |
| Show CompareDirection Source # | |
Defined in Agda.TypeChecking.Monad.Base Methods showsPrec :: Int -> CompareDirection -> ShowS # show :: CompareDirection -> String # showList :: [CompareDirection] -> ShowS # | |
| Eq CompareDirection Source # | |
Defined in Agda.TypeChecking.Monad.Base Methods (==) :: CompareDirection -> CompareDirection -> Bool # (/=) :: CompareDirection -> CompareDirection -> Bool # | |
data Constraint Source #
Constructors
| ValueCmp Comparison CompareAs Term Term | |
| ValueCmpOnFace Comparison Term Type Term Term | |
| ElimCmp [Polarity] [IsForced] Type Term [Elim] [Elim] | |
| SortCmp Comparison Sort Sort | |
| LevelCmp Comparison Level Level | |
| HasBiggerSort Sort | |
| HasPTSRule (Dom Type) (Abs Sort) | |
| CheckMetaInst MetaId | |
| CheckType Type | |
| UnBlock MetaId | Meta created for a term blocked by a postponed type checking problem or unsolved
constraints. The |
| IsEmpty Range Type | The range is the one of the absurd pattern. |
| CheckSizeLtSat Term | Check that the |
| FindInstance MetaId (Maybe [Candidate]) | the first argument is the instance argument and the second one is the list of candidates (or Nothing if we haven’t determined the list of candidates yet) |
| CheckFunDef Delayed DefInfo QName [Clause] TCErr | Last argument is the error causing us to postpone. |
| UnquoteTactic Term Term Type | First argument is computation and the others are hole and goal type |
| CheckLockedVars Term Type (Arg Term) Type |
|
| UsableAtModality Modality Term | is the term usable at the given modality? |
Instances
data ProblemConstraint Source #
Constructors
| PConstr | |
Fields | |
Instances
type Constraints = [ProblemConstraint] Source #
class LensClosure a b | b -> a where Source #
Methods
lensClosure :: Lens' (Closure a) b Source #
Instances
| LensClosure Range MetaInfo Source # | |
Defined in Agda.TypeChecking.Monad.Base | |
| LensClosure Range MetaVariable Source # | |
Defined in Agda.TypeChecking.Monad.Base Methods | |
| LensClosure a (Closure a) Source # | |
Defined in Agda.TypeChecking.Monad.Base | |
Constructors
| Closure | |
Fields
| |
Instances
Constructors
| Interface | |
Fields
| |
Instances
data ForeignCode Source #
Constructors
| ForeignCode Range String |
Instances
| EmbPrj ForeignCode Source # | |
| Generic ForeignCode Source # | |
Defined in Agda.TypeChecking.Monad.Base Associated Types type Rep ForeignCode :: Type -> Type # | |
| Show ForeignCode Source # | |
Defined in Agda.TypeChecking.Monad.Base Methods showsPrec :: Int -> ForeignCode -> ShowS # show :: ForeignCode -> String # showList :: [ForeignCode] -> ShowS # | |
| NFData ForeignCode Source # | |
Defined in Agda.TypeChecking.Monad.Base Methods rnf :: ForeignCode -> () # | |
| type Rep ForeignCode Source # | |
Defined in Agda.TypeChecking.Monad.Base type Rep ForeignCode = D1 ('MetaData "ForeignCode" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-inplace" 'False) (C1 ('MetaCons "ForeignCode" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Range) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String))) | |
data ModuleInfo Source #
Constructors
| ModuleInfo | |
Fields
| |
Instances
| Generic ModuleInfo Source # | |
Defined in Agda.TypeChecking.Monad.Base Associated Types type Rep ModuleInfo :: Type -> Type # | |
| NFData ModuleInfo Source # | |
Defined in Agda.TypeChecking.Monad.Base Methods rnf :: ModuleInfo -> () # | |
| type Rep ModuleInfo Source # | |
Defined in Agda.TypeChecking.Monad.Base type Rep ModuleInfo = D1 ('MetaData "ModuleInfo" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-inplace" 'False) (C1 ('MetaCons "ModuleInfo" 'PrefixI 'True) ((S1 ('MetaSel ('Just "miInterface") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Interface) :*: S1 ('MetaSel ('Just "miWarnings") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [TCWarning])) :*: (S1 ('MetaSel ('Just "miPrimitive") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool) :*: S1 ('MetaSel ('Just "miMode") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ModuleCheckMode)))) | |
data ModuleCheckMode Source #
Distinguishes between type-checked and scope-checked interfaces
when stored in the map of VisitedModules.
Constructors
| ModuleScopeChecked | |
| ModuleTypeChecked |
Instances
class Monad m => MonadStConcreteNames m where Source #
A monad that has read and write access to the stConcreteNames part of the TCState. Basically, this is a synonym for `MonadState ConcreteNames m` (which cannot be used directly because of the limitations of Haskell's typeclass system).
Minimal complete definition
Methods
runStConcreteNames :: StateT ConcreteNames m a -> m a Source #
useConcreteNames :: m ConcreteNames Source #
modifyConcreteNames :: (ConcreteNames -> ConcreteNames) -> m () Source #
Instances
type SourceToModule = Map AbsolutePath TopLevelModuleName Source #
Maps source file names to the corresponding top-level module names.
class FreshName a where Source #
Create a fresh name from a.
Methods
freshName_ :: MonadFresh NameId m => a -> m Name Source #
Instances
| FreshName Range Source # | |
Defined in Agda.TypeChecking.Monad.Base Methods freshName_ :: MonadFresh NameId m => Range -> m Name Source # | |
| FreshName String Source # | |
Defined in Agda.TypeChecking.Monad.Base Methods freshName_ :: MonadFresh NameId m => String -> m Name Source # | |
| FreshName () Source # | |
Defined in Agda.TypeChecking.Monad.Base Methods freshName_ :: MonadFresh NameId m => () -> m Name Source # | |
| FreshName (Range, String) Source # | |
Defined in Agda.TypeChecking.Monad.Base Methods freshName_ :: MonadFresh NameId m => (Range, String) -> m Name Source # | |
newtype CheckpointId Source #
Constructors
| CheckpointId Int |
Instances
class Monad m => MonadFresh i m where Source #
Minimal complete definition
Nothing
Methods
default fresh :: (MonadTrans t, MonadFresh i n, t n ~ m) => m i Source #
Instances
| HasFresh i => MonadFresh i TCM Source # | |
Defined in Agda.TypeChecking.Monad.Base | |
| Monad m => MonadFresh NameId (PureConversionT m) Source # | |
Defined in Agda.TypeChecking.Conversion.Pure Methods fresh :: PureConversionT m NameId Source # | |
| Monad m => MonadFresh ProblemId (PureConversionT m) Source # | |
Defined in Agda.TypeChecking.Conversion.Pure Methods fresh :: PureConversionT m ProblemId Source # | |
| Monad m => MonadFresh Int (PureConversionT m) Source # | |
Defined in Agda.TypeChecking.Conversion.Pure Methods fresh :: PureConversionT m Int Source # | |
| MonadFresh i m => MonadFresh i (ListT m) Source # | |
Defined in Agda.TypeChecking.Monad.Base | |
| MonadFresh i m => MonadFresh i (IdentityT m) Source # | |
Defined in Agda.TypeChecking.Monad.Base | |
| MonadFresh i m => MonadFresh i (ReaderT r m) Source # | |
Defined in Agda.TypeChecking.Monad.Base | |
| MonadFresh i m => MonadFresh i (StateT s m) Source # | |
Defined in Agda.TypeChecking.Monad.Base | |
class Enum i => HasFresh i where Source #
Minimal complete definition
Instances
data TypeCheckAction Source #
A complete log for a module will look like this:
PragmasEnterSection, entering the main module.DeclEnterSectionLeaveSection, for declarations and nested modulesLeaveSection, leaving the main module.
Constructors
| EnterSection !ModuleName !Telescope | |
| LeaveSection !ModuleName | |
| Decl !Declaration | Never a Section or ScopeDecl |
| Pragmas !PragmaOptions |
Instances
type CurrentTypeCheckLog = [(TypeCheckAction, PostScopeState)] Source #
Like CachedTypeCheckLog, but storing the log for an ongoing type
checking of a module. Stored in reverse order (last performed action
first).
type CachedTypeCheckLog = [(TypeCheckAction, PostScopeState)] Source #
A log of what the type checker does and states after the action is completed. The cached version is stored first executed action first.
data LoadedFileCache Source #
Constructors
| LoadedFileCache | |
Fields | |
Instances
| Generic LoadedFileCache Source # | |
Defined in Agda.TypeChecking.Monad.Base Associated Types type Rep LoadedFileCache :: Type -> Type # Methods from :: LoadedFileCache -> Rep LoadedFileCache x # to :: Rep LoadedFileCache x -> LoadedFileCache # | |
| NFData LoadedFileCache Source # | |
Defined in Agda.TypeChecking.Monad.Base Methods rnf :: LoadedFileCache -> () # | |
| type Rep LoadedFileCache Source # | |
Defined in Agda.TypeChecking.Monad.Base type Rep LoadedFileCache = D1 ('MetaData "LoadedFileCache" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-inplace" 'False) (C1 ('MetaCons "LoadedFileCache" 'PrefixI 'True) (S1 ('MetaSel ('Just "lfcCached") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 CachedTypeCheckLog) :*: S1 ('MetaSel ('Just "lfcCurrent") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 CurrentTypeCheckLog))) | |
data PersistentTCState Source #
A part of the state which is not reverted when an error is thrown or the state is reset.
Constructors
| PersistentTCSt | |
Fields
| |
Instances
data MutualBlock Source #
A mutual block of names in the signature.
Constructors
| MutualBlock | |
Fields
| |
Instances
data PostScopeState Source #
Constructors
| PostScopeState | |
Fields
| |
Instances
data DisambiguatedName Source #
Name disambiguation for the sake of highlighting.
Constructors
| DisambiguatedName NameKind QName |
Instances
| Generic DisambiguatedName Source # | |
Defined in Agda.TypeChecking.Monad.Base Associated Types type Rep DisambiguatedName :: Type -> Type # Methods from :: DisambiguatedName -> Rep DisambiguatedName x # to :: Rep DisambiguatedName x -> DisambiguatedName # | |
| NFData DisambiguatedName Source # | |
Defined in Agda.TypeChecking.Monad.Base Methods rnf :: DisambiguatedName -> () # | |
| type Rep DisambiguatedName Source # | |
Defined in Agda.TypeChecking.Monad.Base type Rep DisambiguatedName = D1 ('MetaData "DisambiguatedName" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-inplace" 'False) (C1 ('MetaCons "DisambiguatedName" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 NameKind) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName))) | |
data PreScopeState Source #
Constructors
| PreScopeState | |
Fields
| |
Instances
class Monad m => ReadTCState m where Source #
Minimal complete definition
Nothing
Methods
getTCState :: m TCState Source #
default getTCState :: (MonadTrans t, ReadTCState n, t n ~ m) => m TCState Source #
locallyTCState :: Lens' a TCState -> (a -> a) -> m b -> m b Source #
default locallyTCState :: (MonadTransControl t, ReadTCState n, t n ~ m) => Lens' a TCState -> (a -> a) -> m b -> m b Source #
withTCState :: (TCState -> TCState) -> m a -> m a Source #
Instances
initPersistentState :: PersistentTCState Source #
Empty persistent state.
initPreScopeState :: PreScopeState Source #
Empty state of type checker.
getUserWarnings :: ReadTCState m => m (Map QName Text) Source #
getPartialDefs :: ReadTCState m => m (Set QName) Source #
freshNoName :: MonadFresh NameId m => Range -> m Name Source #
freshNoName_ :: MonadFresh NameId m => m Name Source #
freshRecordName :: MonadFresh NameId m => m Name Source #
sourceToModule :: TCM SourceToModule Source #
Creates a SourceToModule map based on stModuleToSource.
O(n log n).
For a single reverse lookup in stModuleToSource,
rather use lookupModuleFromSourse.
lookupModuleFromSource :: ReadTCState m => AbsolutePath -> m (Maybe TopLevelModuleName) Source #
Lookup an AbsolutePath in sourceToModule.
O(n).
iFullHash :: Interface -> Hash Source #
Combines the source hash and the (full) hashes of the imported modules.
intSignature :: Lens' Signature Interface Source #
A lens for the iSignature field of the Interface type.
buildClosure :: (MonadTCEnv m, ReadTCState m) => a -> m (Closure a) Source #
fromCmp :: Comparison -> CompareDirection Source #
Embed Comparison into CompareDirection.
flipCmp :: CompareDirection -> CompareDirection Source #
Flip the direction of comparison.
dirToCmp :: (Comparison -> a -> a -> c) -> CompareDirection -> a -> a -> c Source #
Turn a Comparison function into a CompareDirection function.
Property: dirToCmp f (fromCmp cmp) = f cmp
getMetaInfo :: MetaVariable -> Closure Range Source #
getMetaScope :: MetaVariable -> ScopeInfo Source #
getMetaEnv :: MetaVariable -> TCEnv Source #
getMetaSig :: MetaVariable -> Signature Source #
defaultDisplayForm :: QName -> [LocalDisplayForm] Source #
By default, we have no display form.
defaultDefn :: ArgInfo -> QName -> Type -> Language -> Defn -> Definition Source #
Create a definition with sensible defaults.
modifySystem :: (System -> System) -> ExtLamInfo -> ExtLamInfo Source #
projDropPars :: Projection -> ProjOrigin -> Term Source #
Building the projection function (which drops the parameters).
projArgInfo :: Projection -> ArgInfo Source #
The info of the principal (record) argument.
setEtaEquality :: EtaEquality -> HasEta -> EtaEquality Source #
Make sure we do not overwrite a user specification.
defaultAxiom :: Defn Source #
recRecursive :: Defn -> Bool Source #
Is the record type recursive?
recEtaEquality :: Defn -> HasEta Source #
emptyFunction :: Defn Source #
A template for creating Function definitions, with sensible defaults.
isEmptyFunction :: Defn -> Bool Source #
Checking whether we are dealing with a function yet to be defined.
isCopatternLHS :: [Clause] -> Bool Source #
defIsRecord :: Defn -> Bool Source #
defIsDataOrRecord :: Defn -> Bool Source #
defConstructors :: Defn -> [QName] Source #
redBind :: ReduceM (Reduced a a') -> (a -> b) -> (a' -> ReduceM (Reduced b b')) -> ReduceM (Reduced b b') Source #
Conceptually: redBind m f k = either (return . Left . f) k =<< m
notReduced :: a -> MaybeReduced a Source #
allReductions :: AllowedReductions Source #
Not quite all reductions (skip non-terminating reductions)
locallyReduceDefs :: MonadTCEnv m => ReduceDefs -> m a -> m a Source #
locallyReduceAllDefs :: MonadTCEnv m => m a -> m a Source #
shouldReduceDef :: MonadTCEnv m => QName -> m Bool Source #
locallyReconstructed :: MonadTCEnv m => m a -> m a Source #
isReconstructed :: MonadTCEnv m => m Bool Source #
primFun :: QName -> Arity -> ([Arg Term] -> ReduceM (Reduced MaybeReducedArgs Term)) -> PrimFun Source #
defClauses :: Definition -> [Clause] Source #
defParameters :: Definition -> Maybe Nat Source #
defCompilerPragmas :: BackendName -> Definition -> [CompilerPragma] Source #
defDelayed :: Definition -> Delayed Source #
Are the clauses of this definition delayed?
defNonterminating :: Definition -> Bool Source #
Has the definition failed the termination checker?
defTerminationUnconfirmed :: Definition -> Bool Source #
Has the definition not termination checked or did the check fail?
defAbstract :: Definition -> IsAbstract Source #
defForced :: Definition -> [IsForced] Source #
ifTopLevelAndHighlightingLevelIsOr :: MonadTCEnv tcm => HighlightingLevel -> Bool -> tcm () -> tcm () Source #
ifTopLevelAndHighlightingLevelIs l b m runs m when we're
type-checking the top-level module (or before we've started doing
this) and either the highlighting level is at least l or b is
True.
ifTopLevelAndHighlightingLevelIs :: MonadTCEnv tcm => HighlightingLevel -> tcm () -> tcm () Source #
ifTopLevelAndHighlightingLevelIs l m runs m when we're
type-checking the top-level module (or before we've started doing
this) and the highlighting level is at least l.
eAnonymousModules :: Lens' [(ModuleName, Nat)] TCEnv Source #
eTerminationCheck :: Lens' (TerminationCheck ()) TCEnv Source #
aDefToMode :: IsAbstract -> AbstractMode Source #
aModeToDef :: AbstractMode -> Maybe IsAbstract Source #
isDontExpandLast :: ExpandHidden -> Bool Source #
warningName :: Warning -> WarningName Source #
tcWarningOrigin :: TCWarning -> SrcFile Source #
sizedTypesOption :: HasOptions m => m Bool Source #
guardednessOption :: HasOptions m => m Bool Source #
withoutKOption :: HasOptions m => m Bool Source #
enableCaching :: HasOptions m => m Bool Source #
fmapReduce :: (a -> b) -> ReduceM a -> ReduceM b Source #
runReduceM :: ReduceM a -> TCM a Source #
runReduceF :: (a -> ReduceM b) -> TCM (a -> b) Source #
asksTC :: MonadTCEnv m => (TCEnv -> a) -> m a Source #
locallyTC :: MonadTCEnv m => Lens' a TCEnv -> (a -> a) -> m b -> m b Source #
Modify the lens-indicated part of the TCEnv in a subcomputation.
getsTC :: ReadTCState m => (TCState -> a) -> m a Source #
modifyTC' :: MonadTCState m => (TCState -> TCState) -> m () Source #
A variant of modifyTC in which the computation is strict in the
new state.
setTCLens :: MonadTCState m => Lens' a TCState -> a -> m () infix 4 Source #
Overwrite the part of the TCState focused on by the lens.
modifyTCLens :: MonadTCState m => Lens' a TCState -> (a -> a) -> m () Source #
Modify the part of the TCState focused on by the lens.
modifyTCLensM :: MonadTCState m => Lens' a TCState -> (a -> m a) -> m () Source #
Modify a part of the state monadically.
stateTCLens :: MonadTCState m => Lens' a TCState -> (a -> (r, a)) -> m r Source #
Modify the part of the TCState focused on by the lens, and return some result.
stateTCLensM :: MonadTCState m => Lens' a TCState -> (a -> m (r, a)) -> m r Source #
Modify a part of the state monadically, and return some result.
returnTCMT :: Applicative m => a -> TCMT m a Source #
catchError_ :: TCM a -> (TCErr -> TCM a) -> TCM a Source #
Preserve the state of the failing computation.
finally_ :: TCM a -> TCM b -> TCM a Source #
Execute a finalizer even when an exception is thrown. Does not catch any errors. In case both the regular computation and the finalizer throw an exception, the one of the finalizer is propagated.
internalError :: (HasCallStack, MonadTCM tcm) => String -> tcm a Source #
locatedTypeError :: MonadTCError m => (a -> TypeError) -> HasCallStack => a -> m b Source #
Utility function for 1-arg constructed type errors.
Note that the HasCallStack constraint is on the *resulting* function.
genericError :: (HasCallStack, MonadTCError m) => String -> m a Source #
genericDocError :: (HasCallStack, MonadTCError m) => Doc -> m a Source #
typeError' :: MonadTCError m => CallStack -> TypeError -> m a Source #
typeError :: (HasCallStack, MonadTCError m) => TypeError -> m a Source #
typeError'_ :: (MonadTCEnv m, ReadTCState m) => CallStack -> TypeError -> m TCErr Source #
typeError_ :: (HasCallStack, MonadTCEnv m, ReadTCState m) => TypeError -> m TCErr Source #
runTCM :: MonadIO m => TCEnv -> TCState -> TCMT m a -> m (a, TCState) Source #
Running the type checking monad (most general form).
runTCMTop :: TCM a -> IO (Either TCErr a) Source #
Running the type checking monad on toplevel (with initial state).
runTCMTop' :: MonadIO m => TCMT m a -> m a Source #
runSafeTCM :: TCM a -> TCState -> IO (a, TCState) Source #
runSafeTCM runs a safe TCMT action (a TCMT action which
cannot fail, except that it might raise IOExceptions) in the
initial environment.
forkTCM :: TCM a -> TCM () Source #
Runs the given computation in a separate thread, with a copy of the current state and environment.
Note that Agda sometimes uses actual, mutable state. If the
computation given to forkTCM tries to modify this state, then
bad things can happen, because accesses are not mutually exclusive.
The forkTCM function has been added mainly to allow the thread to
read (a snapshot of) the current state in a convenient way.
Note also that exceptions which are raised in the thread are not propagated to the parent, so the thread should not do anything important.
patternInTeleName :: String Source #
Base name for patterns in telescopes
extendedLambdaName :: String Source #
Base name for extended lambda patterns
isExtendedLambdaName :: QName -> Bool Source #
Check whether we have an definition from an extended lambda.
absurdLambdaName :: String Source #
Name of absurdLambda definitions.
isAbsurdLambdaName :: QName -> Bool Source #
Check whether we have an definition from an absurd lambda.
generalizedFieldName :: String Source #
Base name for generalized variable projections
getGeneralizedFieldName :: QName -> Maybe String Source #
Check whether we have a generalized variable field
class (Functor m, Applicative m, Monad m) => HasOptions m where Source #
Minimal complete definition
Nothing
Methods
pragmaOptions :: m PragmaOptions Source #
Returns the pragma options which are currently in effect.
default pragmaOptions :: (HasOptions n, MonadTrans t, m ~ t n) => m PragmaOptions Source #
commandLineOptions :: m CommandLineOptions Source #
Returns the command line options which are currently in effect.
default commandLineOptions :: (HasOptions n, MonadTrans t, m ~ t n) => m CommandLineOptions Source #