Documentation

Methods

traverseTermM :: Monad m => (Term -> m Term) -> Constraint -> m Constraint Source #

foldTerm :: Monoid m => (Term -> m) -> Constraint -> m Source #

AllMetas Constraint Source #

Instance details

Methods

allMetas :: Monoid m => (MetaId -> m) -> Constraint -> m Source #

HasRange Constraint Source #

Instance details

Methods

getRange :: Constraint -> Range Source #

Reify Constraint Source #

Instance details

Defined in Agda.Interaction.BasicOps

Associated Types

type ReifiesTo Constraint
Instance details Defined in Agda.Interaction.BasicOps type ReifiesTo Constraint = OutputConstraint Expr Expr

Methods

reify :: MonadReify m => Constraint -> m (ReifiesTo Constraint) Source #

reifyWhen :: MonadReify m => Bool -> Constraint -> m (ReifiesTo Constraint) Source #

Free Constraint Source #

Instance details

Methods

freeVars' :: IsVarSet a c => Constraint -> FreeM a c Source #

MentionsMeta Constraint Source #

Instance details

Methods

mentionsMetas :: HashSet MetaId -> Constraint -> Bool Source #

PrettyTCM Constraint Source #

Instance details

Defined in Agda.TypeChecking.Pretty.Constraint

Methods

prettyTCM :: MonadPretty m => Constraint -> m Doc Source #

Instantiate Constraint Source #

Instance details

Defined in Agda.TypeChecking.Reduce

Methods

instantiate' :: Constraint -> ReduceM Constraint Source #

InstantiateFull Constraint Source #

Instance details

Defined in Agda.TypeChecking.Reduce

Methods

instantiateFull' :: Constraint -> ReduceM Constraint Source #

Normalise Constraint Source #

Instance details

Defined in Agda.TypeChecking.Reduce

Methods

normalise' :: Constraint -> ReduceM Constraint Source #

Reduce Constraint Source #

Instance details

Defined in Agda.TypeChecking.Reduce

Methods

reduce' :: Constraint -> ReduceM Constraint Source #

reduceB' :: Constraint -> ReduceM (Blocked Constraint) Source #

Simplify Constraint Source #

Instance details

Defined in Agda.TypeChecking.Reduce

Methods

simplify' :: Constraint -> ReduceM Constraint

Subst Constraint Source #

Instance details

Associated Types

type SubstArg Constraint
Instance details Defined in Agda.TypeChecking.Substitute type SubstArg Constraint = Term

Methods

applySubst :: Substitution' (SubstArg Constraint) -> Constraint -> Constraint Source #

Generic Constraint Source #

Instance details

Associated Types

type Rep Constraint

Instance details

Methods

from :: Constraint -> Rep Constraint x #

to :: Rep Constraint x -> Constraint #

Show Constraint Source #

Instance details

Methods

showsPrec :: Int -> Constraint -> ShowS #

show :: Constraint -> String #

showList :: [Constraint] -> ShowS #

NFData Constraint Source #

Instance details

Methods

rnf :: Constraint -> () #

type ReifiesTo Constraint Source #

Instance details

Defined in Agda.Interaction.BasicOps

type ReifiesTo Constraint = OutputConstraint Expr Expr

type SubstArg Constraint Source #

Instance details

type SubstArg Constraint = Term

type Rep Constraint Source #

Instance details

data TCErr Source #

Type-checking errors.

Constructors

TypeError
Fields tcErrLocation :: CallStack Location in the internal Agda source code where the error was raised tcErrState :: TCState The state in which the error was raised. tcErrClosErr :: Closure TypeError The environment in which the error as raised plus the error.
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 (`assignV`) but also in other situations where we want to backtrack. Contains an unblocker to control when the computation should be retried.

Instances

Instances details

EncodeTCM TCErr Source #
Instance details Defined in Agda.Interaction.JSONTop Methods encodeTCM :: TCErr -> TCM Value Source #
HasRange TCErr Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods getRange :: TCErr -> Range Source #
PrettyTCM TCErr Source #
Instance details Defined in Agda.TypeChecking.Errors Methods prettyTCM :: MonadPretty m => TCErr -> m Doc Source #
Exception TCErr Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods toException :: TCErr -> SomeException # fromException :: SomeException -> Maybe TCErr # displayException :: TCErr -> String #
Show TCErr Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods showsPrec :: Int -> TCErr -> ShowS # show :: TCErr -> String # showList :: [TCErr] -> ShowS #
NFData TCErr Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods rnf :: TCErr -> () #
MonadError TCErr IM Source #
Instance details Defined in Agda.Interaction.Monad Methods throwError :: TCErr -> IM a # catchError :: IM a -> (TCErr -> IM a) -> IM a #
MonadError TCErr TerM Source #
Instance details Defined in Agda.Termination.Monad Methods throwError :: TCErr -> TerM a # catchError :: TerM a -> (TCErr -> TerM a) -> TerM a #
MonadError TCErr TCM Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods throwError :: TCErr -> TCM a # catchError :: TCM a -> (TCErr -> TCM a) -> TCM a #
Monad m => MonadError TCErr (PureConversionT m) Source #
Instance details 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 #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods patternViolation :: Blocker -> ExceptT TCErr m a Source # catchPatternErr :: (Blocker -> ExceptT TCErr m a) -> ExceptT TCErr m a -> ExceptT TCErr m a Source #

typeError :: (HasCallStack, MonadTCError m) => TypeError -> m a Source #

pattern Datatype :: Nat -> Nat -> Maybe Clause -> [QName] -> Sort -> Maybe [QName] -> IsAbstract -> [QName] -> Maybe QName -> Maybe QName -> Defn Source #

pattern Constructor :: Int -> Int -> ConHead -> QName -> IsAbstract -> CompKit -> Maybe [QName] -> [IsForced] -> Maybe [Bool] -> Bool -> Bool -> Defn Source #

data TypeError Source #

Constructors

InternalError String
NotImplemented String
NotSupported String
CompilationError String
PropMustBeSingleton
DataMustEndInSort Term
ShouldEndInApplicationOfTheDatatype Type	The target of a constructor isn't an application of its datatype. The `Type` records what it does target.
ShouldBeAppliedToTheDatatypeParameters Term Term	The target of a constructor isn't its datatype applied to something that isn't the parameters. First term is the correct target and the second term is the actual target.
ShouldBeApplicationOf Type QName	Expected a type to be an application of a particular datatype.
ConstructorPatternInWrongDatatype QName QName	constructor, datatype
CantResolveOverloadedConstructorsTargetingSameDatatype QName (List1 QName)	Datatype, constructors.
DoesNotConstructAnElementOf QName Type	constructor, type
WrongHidingInLHS	The left hand side of a function definition has a hidden argument where a non-hidden was expected.
WrongHidingInLambda Type	Expected a non-hidden function and found a hidden lambda.
WrongHidingInApplication Type	A function is applied to a hidden argument where a non-hidden was expected.
WrongHidingInProjection QName
IllegalHidingInPostfixProjection (NamedArg Expr)
WrongNamedArgument (NamedArg Expr) [NamedName]	A function is applied to a hidden named argument it does not have. The list contains names of possible hidden arguments at this point.
WrongIrrelevanceInLambda	Wrong user-given relevance annotation in lambda.
WrongQuantityInLambda	Wrong user-given quantity annotation in lambda.
WrongCohesionInLambda	Wrong user-given cohesion annotation in lambda.
QuantityMismatch Quantity Quantity	The given quantity does not correspond to the expected quantity.
HidingMismatch Hiding Hiding	The given hiding does not correspond to the expected hiding.
RelevanceMismatch Relevance Relevance	The given relevance does not correspond to the expected relevane.
UninstantiatedDotPattern Expr
ForcedConstructorNotInstantiated Pattern
IllformedProjectionPatternAbstract Pattern
IllformedProjectionPatternConcrete Pattern
CannotEliminateWithPattern (Maybe Blocker) (NamedArg Pattern) Type
CannotEliminateWithProjection (Arg Type) Bool QName
WrongNumberOfConstructorArguments QName Nat Nat
ShouldBeEmpty Type [DeBruijnPattern]
ShouldBeASort Type	The given type should have been a sort.
ShouldBePi Type	The given type should have been a pi.
ShouldBePath Type
ShouldBeRecordType Type
ShouldBeRecordPattern DeBruijnPattern
NotAProjectionPattern (NamedArg Pattern)
NotAProperTerm
InvalidTypeSort Sort	This sort is not a type expression.
InvalidType Term	This term is not a type expression.
FunctionTypeInSizeUniv Term	This term, a function type constructor, lives in `SizeUniv`, which is not allowed.
SplitOnIrrelevant (Dom Type)
SplitOnUnusableCohesion (Dom Type)
SplitOnNonVariable Term Type
SplitOnNonEtaRecord QName
SplitOnAbstract QName
SplitOnUnchecked QName
SplitOnPartial (Dom Type)
SplitInProp DataOrRecordE
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	The two function types have different relevance.
UnequalQuantity Comparison Term Term	The two function types have different relevance.
UnequalCohesion Comparison Term Term	The two function types have different cohesion.
UnequalFiniteness Comparison Term Term	One of the function types has a finite domain (i.e. is a `Partia`l@) and the other isonot.
UnequalHiding Term Term	The two function types have different hiding.
UnequalSorts Sort Sort
UnequalBecauseOfUniverseConflict Comparison Term Term
NotLeqSort Sort Sort
MetaCannotDependOn MetaId Nat	The arguments are the meta variable and the parameter that it wants to depend on.
MetaOccursInItself MetaId
MetaIrrelevantSolution MetaId Term
MetaErasedSolution MetaId Term
GenericError String
GenericDocError Doc
SortOfSplitVarError (Maybe Blocker) Doc	the meta is what we might be blocked on.
BuiltinMustBeConstructor BuiltinId Expr
NoSuchBuiltinName String
DuplicateBuiltinBinding BuiltinId Term Term
NoBindingForBuiltin BuiltinId
NoBindingForPrimitive PrimitiveId
NoSuchPrimitiveFunction String
DuplicatePrimitiveBinding PrimitiveId QName QName
WrongArgInfoForPrimitive PrimitiveId ArgInfo ArgInfo
ShadowedModule Name [ModuleName]
BuiltinInParameterisedModule BuiltinId
IllegalDeclarationInDataDefinition [Declaration]	The declaration list comes from a single `NiceDeclaration`.
IllegalLetInTelescope TypedBinding
IllegalPatternInTelescope Binder
NoRHSRequiresAbsurdPattern [NamedArg Pattern]
TooManyFields QName [Name] [Name]	Record type, fields not supplied by user, non-fields but supplied.
DuplicateFields [Name]
DuplicateConstructors [Name]
WithOnFreeVariable Expr Term
UnexpectedWithPatterns [Pattern]
WithClausePatternMismatch Pattern (NamedArg DeBruijnPattern)
IllTypedPatternAfterWithAbstraction Pattern
FieldOutsideRecord
ModuleArityMismatch ModuleName Telescope [NamedArg Expr]
GeneralizeCyclicDependency
GeneralizeUnsolvedMeta
ReferencesFutureVariables Term (NonEmpty Int) (Arg Term) Int	The first term references the given list of variables, which are in "the future" with respect to the given lock (and its leftmost variable)
DoesNotMentionTicks Term Type (Arg Term)	Arguments: later term, its type, lock term. The lock term does not mention any @lock variables.
MismatchedProjectionsError QName QName
AttributeKindNotEnabled String String String
InvalidProjectionParameter (NamedArg Expr)
TacticAttributeNotAllowed
CannotRewriteByNonEquation Type
MacroResultTypeMismatch Type
NamedWhereModuleInRefinedContext [Term] [String]
CubicalPrimitiveNotFullyApplied QName
TooManyArgumentsToLeveledSort QName
TooManyArgumentsToUnivOmega QName
ComatchingDisabledForRecord QName
BuiltinMustBeIsOne Term
IllegalRewriteRule QName IllegalRewriteRuleReason
IncorrectTypeForRewriteRelation Term IncorrectTypeForRewriteRelationReason
UnexpectedParameter LamBinding
NoParameterOfName ArgName
UnexpectedModalityAnnotationInParameter LamBinding
ExpectedBindingForParameter (Dom Type) (Abs Type)
UnexpectedTypeSignatureForParameter (List1 (NamedArg Binder))
SortDoesNotAdmitDataDefinitions QName Sort
SortCannotDependOnItsIndex QName Type
SplitError SplitError
ImpossibleConstructor QName NegativeUnification
TooManyPolarities QName Int
LocalVsImportedModuleClash ModuleName
SolvedButOpenHoles	Some interaction points (holes) have not been filled by user. There are not `UnsolvedMetas` since unification solved them. This is an error, since interaction points are never filled without user interaction.
CyclicModuleDependency [TopLevelModuleName]
FileNotFound TopLevelModuleName [AbsolutePath]
OverlappingProjects AbsolutePath TopLevelModuleName TopLevelModuleName
AmbiguousTopLevelModuleName TopLevelModuleName [AbsolutePath]
ModuleNameUnexpected TopLevelModuleName TopLevelModuleName	Found module name, expected module name.
ModuleNameDoesntMatchFileName TopLevelModuleName [AbsolutePath]
ClashingFileNamesFor ModuleName [AbsolutePath]
ModuleDefinedInOtherFile TopLevelModuleName AbsolutePath AbsolutePath	Module name, file from which it was loaded, file which the include path says contains the module. Scope errors
BothWithAndRHS
AbstractConstructorNotInScope QName
NotInScope [QName]
NoSuchModule QName
AmbiguousName QName AmbiguousNameReason
AmbiguousModule QName (List1 ModuleName)
AmbiguousField Name [ModuleName]
AmbiguousConstructor QName [QName]
ClashingDefinition QName QName (Maybe NiceDeclaration)
ClashingModule ModuleName ModuleName
ClashingImport Name QName
ClashingModuleImport Name ModuleName
DuplicateImports QName [ImportedName]
InvalidPattern Pattern
RepeatedVariablesInPattern [Name]
GeneralizeNotSupportedHere QName
GeneralizedVarInLetOpenedModule QName
MultipleFixityDecls [(Name, [Fixity'])]
MultiplePolarityPragmas [Name]
NotAModuleExpr Expr	The expr was used in the right hand side of an implicit module definition, but it wasn't of the form `m Delta`.
NotAnExpression Expr
NotAValidLetBinding NiceDeclaration
NotValidBeforeField NiceDeclaration
NothingAppliedToHiddenArg Expr
NothingAppliedToInstanceArg Expr
BadArgumentsToPatternSynonym AmbiguousQName
TooFewArgumentsToPatternSynonym AmbiguousQName
CannotResolveAmbiguousPatternSynonym (List1 (QName, PatternSynDefn))
UnusedVariableInPatternSynonym
UnboundVariablesInPatternSynonym [Name]
NoParseForApplication (List2 Expr)
AmbiguousParseForApplication (List2 Expr) (List1 Expr)
NoParseForLHS LHSOrPatSyn [Pattern] Pattern	The list contains patterns that failed to be interpreted. If it is non-empty, the first entry could be printed as error hint.
AmbiguousParseForLHS LHSOrPatSyn Pattern [Pattern]	Pattern and its possible interpretations.
AmbiguousProjection QName [QName]
AmbiguousOverloadedProjection (List1 QName) Doc
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

Instances

Instances details

PrettyTCM TypeError Source #

Instance details

Defined in Agda.TypeChecking.Errors

Methods

prettyTCM :: MonadPretty m => TypeError -> m Doc Source #

Generic TypeError Source #

Instance details

Associated Types

type Rep TypeError

Instance details

Methods

from :: TypeError -> Rep TypeError x #

to :: Rep TypeError x -> TypeError #

Show TypeError Source #

Instance details

Methods

showsPrec :: Int -> TypeError -> ShowS #

show :: TypeError -> String #

showList :: [TypeError] -> ShowS #

NFData TypeError Source #

Instance details

Methods

rnf :: TypeError -> () #

type Rep TypeError Source #

Instance details

data Comparison Source #

Constructors

CmpEq
CmpLeq

Instances

Instances details

Pretty Comparison Source #

Instance details

Methods

pretty :: Comparison -> Doc Source #

prettyPrec :: Int -> Comparison -> Doc Source #

prettyList :: [Comparison] -> Doc Source #

PrettyTCM Comparison Source #

Instance details

Defined in Agda.TypeChecking.Pretty

Methods

prettyTCM :: MonadPretty m => Comparison -> m Doc Source #

EmbPrj Comparison Source #

Instance details

Defined in Agda.TypeChecking.Serialise.Instances.Internal

Methods

icode :: Comparison -> S Int32 Source #

icod_ :: Comparison -> S Int32 Source #

value :: Int32 -> R Comparison Source #

Generic Comparison Source #

Instance details

Associated Types

type Rep Comparison
Instance details Defined in Agda.TypeChecking.Monad.Base type Rep Comparison = D1 ('MetaData "Comparison" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "CmpEq" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "CmpLeq" 'PrefixI 'False) (U1 :: Type -> Type))

Methods

from :: Comparison -> Rep Comparison x #

to :: Rep Comparison x -> Comparison #

Show Comparison Source #

Instance details

Methods

showsPrec :: Int -> Comparison -> ShowS #

show :: Comparison -> String #

showList :: [Comparison] -> ShowS #

NFData Comparison Source #

Instance details

Methods

rnf :: Comparison -> () #

Eq Comparison Source #

Instance details

Methods

(==) :: Comparison -> Comparison -> Bool #

(/=) :: Comparison -> Comparison -> Bool #

type Rep Comparison Source #

Instance details

type Rep Comparison = D1 ('MetaData "Comparison" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "CmpEq" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "CmpLeq" 'PrefixI 'False) (U1 :: Type -> Type))

data Polarity Source #

Polarity for equality and subtype checking.

Constructors

Covariant	monotone
Contravariant	antitone
Invariant	no information (mixed variance)
Nonvariant	constant

Instances

Instances details

Pretty Polarity Source #

Instance details

Methods

pretty :: Polarity -> Doc Source #

prettyPrec :: Int -> Polarity -> Doc Source #

prettyList :: [Polarity] -> Doc Source #

KillRange Polarity Source #

Instance details

Methods

killRange :: KillRangeT Polarity Source #

PrettyTCM Polarity Source #

Instance details

Defined in Agda.TypeChecking.Pretty

Methods

prettyTCM :: MonadPretty m => Polarity -> m Doc Source #

EmbPrj Polarity Source #

Instance details

Defined in Agda.TypeChecking.Serialise.Instances.Internal

Methods

icode :: Polarity -> S Int32 Source #

icod_ :: Polarity -> S Int32 Source #

value :: Int32 -> R Polarity Source #

Generic Polarity Source #

Instance details

Associated Types

type Rep Polarity

Instance details

type Rep Polarity = D1 ('MetaData "Polarity" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-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)))

Methods

from :: Polarity -> Rep Polarity x #

to :: Rep Polarity x -> Polarity #

Show Polarity Source #

Instance details

Methods

showsPrec :: Int -> Polarity -> ShowS #

show :: Polarity -> String #

showList :: [Polarity] -> ShowS #

NFData Polarity Source #

Instance details

Methods

rnf :: Polarity -> () #

Eq Polarity Source #

Instance details

Methods

(==) :: Polarity -> Polarity -> Bool #

(/=) :: Polarity -> Polarity -> Bool #

Abstract [Polarity] Source #

Instance details

Methods

abstract :: Telescope -> [Polarity] -> [Polarity] Source #

Apply [Polarity] Source #

Instance details

Methods

apply :: [Polarity] -> Args -> [Polarity] Source #

applyE :: [Polarity] -> Elims -> [Polarity] Source #

type Rep Polarity Source #

Instance details

type Rep Polarity = D1 ('MetaData "Polarity" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-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 Builtin pf Source #

Constructors

Builtin Term
Prim pf
BuiltinRewriteRelations (Set QName)	`BUILTIN REWRITE`. We can have several rewrite relations.

Instances

Instances details

Foldable Builtin Source #

Instance details

Methods

fold :: Monoid m => Builtin m -> m #

foldMap :: Monoid m => (a -> m) -> Builtin a -> m #

foldMap' :: Monoid m => (a -> m) -> Builtin a -> m #

foldr :: (a -> b -> b) -> b -> Builtin a -> b #

foldr' :: (a -> b -> b) -> b -> Builtin a -> b #

foldl :: (b -> a -> b) -> b -> Builtin a -> b #

foldl' :: (b -> a -> b) -> b -> Builtin a -> b #

foldr1 :: (a -> a -> a) -> Builtin a -> a #

foldl1 :: (a -> a -> a) -> Builtin a -> a #

toList :: Builtin a -> [a] #

null :: Builtin a -> Bool #

length :: Builtin a -> Int #

elem :: Eq a => a -> Builtin a -> Bool #

maximum :: Ord a => Builtin a -> a #

minimum :: Ord a => Builtin a -> a #

sum :: Num a => Builtin a -> a #

product :: Num a => Builtin a -> a #

Traversable Builtin Source #

Instance details

Methods

traverse :: Applicative f => (a -> f b) -> Builtin a -> f (Builtin b) #

sequenceA :: Applicative f => Builtin (f a) -> f (Builtin a) #

mapM :: Monad m => (a -> m b) -> Builtin a -> m (Builtin b) #

sequence :: Monad m => Builtin (m a) -> m (Builtin a) #

Functor Builtin Source #

Instance details

Methods

fmap :: (a -> b) -> Builtin a -> Builtin b #

(<$) :: a -> Builtin b -> Builtin a #

NamesIn a => NamesIn (Builtin a) Source #

Instance details

Methods

namesAndMetasIn' :: Monoid m => (Either QName MetaId -> m) -> Builtin a -> m Source #

InstantiateFull a => InstantiateFull (Builtin a) Source #

Instance details

Defined in Agda.TypeChecking.Reduce

Methods

instantiateFull' :: Builtin a -> ReduceM (Builtin a) Source #

EmbPrj a => EmbPrj (Builtin a) Source #

Instance details

Defined in Agda.TypeChecking.Serialise.Instances.Internal

Methods

icode :: Builtin a -> S Int32 Source #

icod_ :: Builtin a -> S Int32 Source #

value :: Int32 -> R (Builtin a) Source #

Generic (Builtin pf) Source #

Instance details

Associated Types

type Rep (Builtin pf)

Instance details

type Rep (Builtin pf) = D1 ('MetaData "Builtin" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "Builtin" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term)) :+: (C1 ('MetaCons "Prim" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 pf)) :+: C1 ('MetaCons "BuiltinRewriteRelations" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Set QName)))))

Methods

from :: Builtin pf -> Rep (Builtin pf) x #

to :: Rep (Builtin pf) x -> Builtin pf #

Show pf => Show (Builtin pf) Source #

Instance details

Methods

showsPrec :: Int -> Builtin pf -> ShowS #

show :: Builtin pf -> String #

showList :: [Builtin pf] -> ShowS #

NFData pf => NFData (Builtin pf) Source #

Instance details

Methods

rnf :: Builtin pf -> () #

type Rep (Builtin pf) Source #

Instance details

type Rep (Builtin pf) = D1 ('MetaData "Builtin" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "Builtin" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term)) :+: (C1 ('MetaCons "Prim" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 pf)) :+: C1 ('MetaCons "BuiltinRewriteRelations" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Set QName)))))

data ModuleInfo Source #

Constructors

ModuleInfo

Fields

miInterface :: Interface
miWarnings :: [TCWarning]
Warnings were encountered when the module was type checked. These might include warnings not stored in the interface itself, specifically unsolved interaction metas. See Agda.Interaction.Imports
miPrimitive :: Bool
True if the module is a primitive module, which should always be importable.
miMode :: ModuleCheckMode
The ModuleCheckMode used to create the Interface

Instances

Instances details

Generic ModuleInfo Source #

Instance details

Associated Types

type Rep ModuleInfo

Instance details

type Rep ModuleInfo = D1 ('MetaData "ModuleInfo" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-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))))

Methods

from :: ModuleInfo -> Rep ModuleInfo x #

to :: Rep ModuleInfo x -> ModuleInfo #

NFData ModuleInfo Source #

Instance details

Methods

rnf :: ModuleInfo -> () #

type Rep ModuleInfo Source #

Instance details

type Rep ModuleInfo = D1 ('MetaData "ModuleInfo" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-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 System Source #

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 systemTel :: Telescope the telescope Δ, binding vars for the clauses, Γ ⊢ Δ systemClauses :: [(Face, Term)] a system [φ₁ u₁, ... , φₙ uₙ] where Γ, Δ ⊢ φᵢ and Γ, Δ, φᵢ ⊢ uᵢ

Instances

Instances details

NamesIn System Source #

Instance details

Methods

namesAndMetasIn' :: Monoid m => (Either QName MetaId -> m) -> System -> m Source #

KillRange System Source #

Instance details

Methods

killRange :: KillRangeT System Source #

InstantiateFull System Source #

Instance details

Defined in Agda.TypeChecking.Reduce

Methods

instantiateFull' :: System -> ReduceM System Source #

EmbPrj System Source #

Instance details

Defined in Agda.TypeChecking.Serialise.Instances.Internal

Methods

icode :: System -> S Int32 Source #

icod_ :: System -> S Int32 Source #

value :: Int32 -> R System Source #

Abstract System Source #

Instance details

Methods

abstract :: Telescope -> System -> System Source #

Apply System Source #

Instance details

Methods

apply :: System -> Args -> System Source #

applyE :: System -> Elims -> System Source #

Generic System Source #

Instance details

Associated Types

type Rep System

Instance details

type Rep System = D1 ('MetaData "System" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-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)])))

Methods

from :: System -> Rep System x #

to :: Rep System x -> System #

Show System Source #

Instance details

Methods

showsPrec :: Int -> System -> ShowS #

show :: System -> String #

showList :: [System] -> ShowS #

NFData System Source #

Instance details

Methods

rnf :: System -> () #

Reify (QNamed System) Source #

Instance details

Defined in Agda.Syntax.Translation.InternalToAbstract

Associated Types

type ReifiesTo (QNamed System)
Instance details Defined in Agda.Syntax.Translation.InternalToAbstract type ReifiesTo (QNamed System) = [Clause]

Methods

reify :: MonadReify m => QNamed System -> m (ReifiesTo (QNamed System)) Source #

reifyWhen :: MonadReify m => Bool -> QNamed System -> m (ReifiesTo (QNamed System)) Source #

type Rep System Source #

Instance details

type Rep System = D1 ('MetaData "System" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-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 #

Instance details

Defined in Agda.Syntax.Translation.InternalToAbstract

type ReifiesTo (QNamed System) = [Clause]

type TCM = TCMT IO Source #

Type checking monad.

newtype TCMT (m :: Type -> Type) a Source #

The type checking monad transformer. Adds readonly TCEnv and mutable TCState.

Constructors

TCM
Fields unTCM :: IORef TCState -> TCEnv -> m a

Instances

Instances details

MonadFixityError ScopeM Source #

Instance details

Defined in Agda.Syntax.Scope.Monad

Methods

throwMultipleFixityDecls :: [(Name, [Fixity'])] -> ScopeM a Source #

throwMultiplePolarityPragmas :: [Name] -> ScopeM a Source #

warnUnknownNamesInFixityDecl :: [Name] -> ScopeM () Source #

warnUnknownNamesInPolarityPragmas :: [Name] -> ScopeM () Source #

warnUnknownFixityInMixfixDecl :: [Name] -> ScopeM () Source #

warnPolarityPragmasButNotPostulates :: [Name] -> ScopeM () Source #

MonadBlock TCM Source #

Instance details

Methods

patternViolation :: Blocker -> TCM a Source #

catchPatternErr :: (Blocker -> TCM a) -> TCM a -> TCM a Source #

MonadStConcreteNames TCM Source #

Instance details

Methods

runStConcreteNames :: StateT ConcreteNames TCM a -> TCM a Source #

useConcreteNames :: TCM ConcreteNames Source #

modifyConcreteNames :: (ConcreteNames -> ConcreteNames) -> TCM () Source #

MonadConstraint TCM Source #

Instance details

Defined in Agda.TypeChecking.Constraints

Methods

addConstraint :: Blocker -> Constraint -> TCM () Source #

addAwakeConstraint :: Blocker -> Constraint -> TCM () Source #

solveConstraint :: Constraint -> TCM () Source #

solveSomeAwakeConstraints :: (ProblemConstraint -> Bool) -> Bool -> TCM () Source #

wakeConstraints :: (ProblemConstraint -> WakeUp) -> TCM () Source #

stealConstraints :: ProblemId -> TCM () Source #

modifyAwakeConstraints :: (Constraints -> Constraints) -> TCM () Source #

modifySleepingConstraints :: (Constraints -> Constraints) -> TCM () Source #

MonadAddContext TCM Source #

Instance details

Defined in Agda.TypeChecking.Monad.Context

Methods

addCtx :: Name -> Dom Type -> TCM a -> TCM a Source #

addLetBinding' :: Origin -> Name -> Term -> Dom Type -> TCM a -> TCM a Source #

updateContext :: Substitution -> (Context -> Context) -> TCM a -> TCM a Source #

withFreshName :: Range -> ArgName -> (Name -> TCM a) -> TCM a Source #

MonadDebug TCM Source #

Instance details

Methods

formatDebugMessage :: VerboseKey -> VerboseLevel -> TCM Doc -> TCM String Source #

traceDebugMessage :: VerboseKey -> VerboseLevel -> String -> TCM a -> TCM a Source #

verboseBracket :: VerboseKey -> VerboseLevel -> String -> TCM a -> TCM a Source #

getVerbosity :: TCM Verbosity Source #

getProfileOptions :: TCM ProfileOptions Source #

isDebugPrinting :: TCM Bool Source #

nowDebugPrinting :: TCM a -> TCM a Source #

MonadInteractionPoints TCM Source #

Instance details

Defined in Agda.TypeChecking.Monad.MetaVars

Methods

freshInteractionId :: TCM InteractionId Source #

modifyInteractionPoints :: (InteractionPoints -> InteractionPoints) -> TCM () Source #

MonadMetaSolver TCM Source #

Instance details

Defined in Agda.TypeChecking.MetaVars

Methods

newMeta' :: MetaInstantiation -> Frozen -> MetaInfo -> MetaPriority -> Permutation -> Judgement a -> TCM MetaId Source #

assignV :: CompareDirection -> MetaId -> Args -> Term -> CompareAs -> TCM () Source #

assignTerm' :: MetaId -> [Arg ArgName] -> Term -> TCM () Source #

etaExpandMeta :: [MetaKind] -> MetaId -> TCM () Source #

updateMetaVar :: MetaId -> (MetaVariable -> MetaVariable) -> TCM () Source #

speculateMetas :: TCM () -> TCM KeepMetas -> TCM () Source #

PureTCM TCM Source #

Instance details

Defined in Agda.TypeChecking.Monad.Pure

MonadStatistics TCM Source #

Instance details

Defined in Agda.TypeChecking.Monad.Statistics

Methods

modifyCounter :: String -> (Integer -> Integer) -> TCM () Source #

MonadTrace TCM Source #

Instance details

Defined in Agda.TypeChecking.Monad.Trace

Methods

traceCall :: Call -> TCM a -> TCM a Source #

traceCallM :: TCM Call -> TCM a -> TCM a Source #

traceCallCPS :: Call -> ((a -> TCM b) -> TCM b) -> (a -> TCM b) -> TCM b Source #

traceClosureCall :: Closure Call -> TCM a -> TCM a Source #

printHighlightingInfo :: RemoveTokenBasedHighlighting -> HighlightingInfo -> TCM () Source #

MonadWarning TCM Source #

Instance details

Defined in Agda.TypeChecking.Warnings

Methods

addWarning :: TCWarning -> TCM () Source #

MonadBench TCM Source #

We store benchmark statistics in an IORef. This enables benchmarking pure computation, see Agda.Benchmarking.

Instance details

Associated Types

type BenchPhase TCM
Instance details Defined in Agda.TypeChecking.Monad.Base type BenchPhase TCM = Phase

Methods

getBenchmark :: TCM (Benchmark (BenchPhase TCM)) Source #

putBenchmark :: Benchmark (BenchPhase TCM) -> TCM () Source #

modifyBenchmark :: (Benchmark (BenchPhase TCM) -> Benchmark (BenchPhase TCM)) -> TCM () Source #

finally :: TCM b -> TCM c -> TCM b Source #

CatchImpossible TCM Source #

Like catchError, but resets the state completely before running the handler. This means it also loses changes to the stPersistentState.

The intended use is to catch internal errors during debug printing. In debug printing, we are not expecting state changes.

Instance details

Methods

catchImpossible :: TCM a -> (Impossible -> TCM a) -> TCM a Source #

catchImpossibleJust :: (Impossible -> Maybe b) -> TCM a -> (b -> TCM a) -> TCM a Source #

handleImpossible :: (Impossible -> TCM a) -> TCM a -> TCM a Source #

handleImpossibleJust :: (Impossible -> Maybe b) -> (b -> TCM a) -> TCM a -> TCM a Source #

MonadTrans TCMT Source #

Instance details

Methods

lift :: Monad m => m a -> TCMT m a #

HasFresh i => MonadFresh i TCM Source #

Instance details

Methods

fresh :: TCM i Source #

MonadError TCErr TCM Source #

Instance details

Methods

throwError :: TCErr -> TCM a #

catchError :: TCM a -> (TCErr -> TCM a) -> TCM a #

Conversion TOM Clause (Maybe ([Pat O], MExp O)) Source #

Instance details

Defined in Agda.Auto.Convert

Methods

convert :: Clause -> TOM (Maybe ([Pat O], MExp O)) Source #

Conversion TOM Term (MExp O) Source #

Instance details

Defined in Agda.Auto.Convert

Methods

convert :: Term -> TOM (MExp O) Source #

Conversion TOM Type (MExp O) Source #

Instance details

Defined in Agda.Auto.Convert

Methods

convert :: Type -> TOM (MExp O) Source #

Conversion TOM Args (MM (ArgList O) (RefInfo O)) Source #

Instance details

Defined in Agda.Auto.Convert

Methods

convert :: Args -> TOM (MM (ArgList O) (RefInfo O)) Source #

Conversion TOM (Arg Pattern) (Pat O) Source #

Instance details

Defined in Agda.Auto.Convert

Methods

convert :: Arg Pattern -> TOM (Pat O) Source #

Conversion TOM [Clause] [([Pat O], MExp O)] Source #

Instance details

Defined in Agda.Auto.Convert

Methods

convert :: [Clause] -> TOM [([Pat O], MExp O)] Source #

Conversion TOM a b => Conversion TOM (Arg a) (Hiding, b) Source #

Instance details

Defined in Agda.Auto.Convert

Methods

convert :: Arg a -> TOM (Hiding, b) Source #

MonadIO m => HasOptions (TCMT m) Source #

Instance details

Methods

pragmaOptions :: TCMT m PragmaOptions Source #

commandLineOptions :: TCMT m CommandLineOptions Source #

MonadIO m => MonadReduce (TCMT m) Source #

Instance details

Methods

liftReduce :: ReduceM a -> TCMT m a Source #

MonadIO m => MonadTCEnv (TCMT m) Source #

Instance details

Methods

askTC :: TCMT m TCEnv Source #

localTC :: (TCEnv -> TCEnv) -> TCMT m a -> TCMT m a Source #

MonadIO m => MonadTCM (TCMT m) Source #

Instance details

Methods

liftTCM :: TCM a -> TCMT m a Source #

MonadIO m => MonadTCState (TCMT m) Source #

Instance details

Methods

getTC :: TCMT m TCState Source #

putTC :: TCState -> TCMT m () Source #

modifyTC :: (TCState -> TCState) -> TCMT m () Source #

MonadIO m => ReadTCState (TCMT m) Source #

Instance details

Methods

getTCState :: TCMT m TCState Source #

locallyTCState :: Lens' TCState a -> (a -> a) -> TCMT m b -> TCMT m b Source #

withTCState :: (TCState -> TCState) -> TCMT m a -> TCMT m a Source #

MonadIO m => HasBuiltins (TCMT m) Source #

Instance details

Defined in Agda.TypeChecking.Monad.Builtin

Methods

getBuiltinThing :: SomeBuiltin -> TCMT m (Maybe (Builtin PrimFun)) Source #

ReportS (TCM Doc) Source #

Instance details

Methods

reportS :: MonadDebug m => VerboseKey -> VerboseLevel -> TCM Doc -> m () Source #

ReportS [TCM Doc] Source #

Instance details

Methods

reportS :: MonadDebug m => VerboseKey -> VerboseLevel -> [TCM Doc] -> m () Source #

TraceS (TCM Doc) Source #

Instance details

Methods

traceS :: MonadDebug m => VerboseKey -> VerboseLevel -> TCM Doc -> m c -> m c Source #

TraceS [TCM Doc] Source #

Instance details

Methods

traceS :: MonadDebug m => VerboseKey -> VerboseLevel -> [TCM Doc] -> m c -> m c Source #

HasConstInfo (TCMT IO) Source #

Instance details

Defined in Agda.TypeChecking.Monad.Signature

Methods

getConstInfo :: QName -> TCMT IO Definition Source #

getConstInfo' :: QName -> TCMT IO (Either SigError Definition) Source #

getRewriteRulesFor :: QName -> TCMT IO RewriteRules Source #

Null (TCM Doc) Source #

Instance details

Methods

empty :: TCM Doc Source #

null :: TCM Doc -> Bool Source #

MonadIO m => MonadFail (TCMT m) Source #

Instance details

Methods

fail :: String -> TCMT m a #

MonadFix m => MonadFix (TCMT m) Source #

Instance details

Methods

mfix :: (a -> TCMT m a) -> TCMT m a #

MonadIO m => MonadIO (TCMT m) Source #

Instance details

Methods

liftIO :: IO a -> TCMT m a #

Applicative m => Applicative (TCMT m) Source #

Instance details

Methods

pure :: a -> TCMT m a #

(<*>) :: TCMT m (a -> b) -> TCMT m a -> TCMT m b #

liftA2 :: (a -> b -> c) -> TCMT m a -> TCMT m b -> TCMT m c #

(*>) :: TCMT m a -> TCMT m b -> TCMT m b #

(<*) :: TCMT m a -> TCMT m b -> TCMT m a #

Functor m => Functor (TCMT m) Source #

Instance details

Methods

fmap :: (a -> b) -> TCMT m a -> TCMT m b #

(<$) :: a -> TCMT m b -> TCMT m a #

Monad m => Monad (TCMT m) Source #

Instance details

Methods

(>>=) :: TCMT m a -> (a -> TCMT m b) -> TCMT m b #

(>>) :: TCMT m a -> TCMT m b -> TCMT m b #

return :: a -> TCMT m a #

Semigroup (TCM Doc) Source #

This instance is more specific than a generic instance Semigroup a => Semigroup (TCM a).

Instance details

Defined in Agda.TypeChecking.Pretty

Methods

(<>) :: TCM Doc -> TCM Doc -> TCM Doc #

sconcat :: NonEmpty (TCM Doc) -> TCM Doc #

stimes :: Integral b => b -> TCM Doc -> TCM Doc #

(MonadIO m, Null a) => Null (TCMT m a) Source #

Instance details

Methods

empty :: TCMT m a Source #

null :: TCMT m a -> Bool Source #

(IsString a, MonadIO m) => IsString (TCMT m a) Source #

Instance details

Methods

fromString :: String -> TCMT m a #

(MonadIO m, Semigroup a, Monoid a) => Monoid (TCMT m a) Source #

Strict (non-shortcut) monoid.

Instance details

Methods

mempty :: TCMT m a #

mappend :: TCMT m a -> TCMT m a -> TCMT m a #

mconcat :: [TCMT m a] -> TCMT m a #

(MonadIO m, Semigroup a) => Semigroup (TCMT m a) Source #

Strict (non-shortcut) semigroup.

Note that there might be a lazy alternative, e.g., for TCM All we might want and2M as concatenation, to shortcut conjunction in case we already have False.

Instance details

Methods

(<>) :: TCMT m a -> TCMT m a -> TCMT m a #

sconcat :: NonEmpty (TCMT m a) -> TCMT m a #

stimes :: Integral b => b -> TCMT m a -> TCMT m a #

type BenchPhase TCM Source #

Instance details

type BenchPhase TCM = Phase

pattern Function :: [Clause] -> Maybe CompiledClauses -> Maybe SplitTree -> Maybe Compiled -> [Clause] -> FunctionInverse -> Maybe [QName] -> IsAbstract -> Either ProjectionLikenessMissing Projection -> Bool -> Set FunctionFlag -> Maybe Bool -> Maybe ExtLamInfo -> Maybe QName -> Maybe QName -> IsOpaque -> Defn Source #

data Signature Source #

Constructors

Sig
Fields _sigSections :: Sections _sigDefinitions :: Definitions _sigRewriteRules :: RewriteRuleMap The rewrite rules defined in this file.

Instances

Instances details

KillRange Signature Source #

Instance details

Methods

killRange :: KillRangeT Signature Source #

InstantiateFull Signature Source #

Instance details

Defined in Agda.TypeChecking.Reduce

Methods

instantiateFull' :: Signature -> ReduceM Signature Source #

EmbPrj Signature Source #

Instance details

Defined in Agda.TypeChecking.Serialise.Instances.Internal

Methods

icode :: Signature -> S Int32 Source #

icod_ :: Signature -> S Int32 Source #

value :: Int32 -> R Signature Source #

Generic Signature Source #

Instance details

Associated Types

type Rep Signature

Instance details

type Rep Signature = D1 ('MetaData "Signature" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-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))))

Methods

from :: Signature -> Rep Signature x #

to :: Rep Signature x -> Signature #

Show Signature Source #

Instance details

Methods

showsPrec :: Int -> Signature -> ShowS #

show :: Signature -> String #

showList :: [Signature] -> ShowS #

NFData Signature Source #

Instance details

Methods

rnf :: Signature -> () #

type Rep Signature Source #

Instance details

type Rep Signature = D1 ('MetaData "Signature" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-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))))

data MetaVariable Source #

Information about local meta-variables.

Constructors

MetaVar

Fields

mvInfo :: MetaInfo
mvPriority :: MetaPriority
some metavariables are more eager to be instantiated
mvPermutation :: Permutation
a metavariable doesn't have to depend on all variables in the context, this "permutation" will throw away the ones it does not depend on
mvJudgement :: Judgement MetaId
mvInstantiation :: MetaInstantiation
mvListeners :: Set Listener
meta variables scheduled for eta-expansion but blocked by this one
mvFrozen :: Frozen
are we past the point where we can instantiate this meta variable?
mvTwin :: Maybe MetaId
Just m means that this meta-variable will be equated to m when the latter is unblocked. See blockTermOnProblem.

Instances

Instances details

LensModality MetaVariable Source #

Instance details

Methods

getModality :: MetaVariable -> Modality Source #

setModality :: Modality -> MetaVariable -> MetaVariable Source #

mapModality :: (Modality -> Modality) -> MetaVariable -> MetaVariable Source #

LensQuantity MetaVariable Source #

Instance details

Methods

getQuantity :: MetaVariable -> Quantity Source #

setQuantity :: Quantity -> MetaVariable -> MetaVariable Source #

mapQuantity :: (Quantity -> Quantity) -> MetaVariable -> MetaVariable Source #

LensRelevance MetaVariable Source #

Instance details

Methods

getRelevance :: MetaVariable -> Relevance Source #

setRelevance :: Relevance -> MetaVariable -> MetaVariable Source #

mapRelevance :: (Relevance -> Relevance) -> MetaVariable -> MetaVariable Source #

HasRange MetaVariable Source #

Instance details

Methods

getRange :: MetaVariable -> Range Source #

SetRange MetaVariable Source #

Instance details

Methods

setRange :: Range -> MetaVariable -> MetaVariable Source #

Generic MetaVariable Source #

Instance details

Associated Types

type Rep MetaVariable

Instance details

Methods

from :: MetaVariable -> Rep MetaVariable x #

to :: Rep MetaVariable x -> MetaVariable #

NFData MetaVariable Source #

Instance details

Methods

rnf :: MetaVariable -> () #

LensClosure MetaVariable Range Source #

Instance details

Methods

lensClosure :: Lens' MetaVariable (Closure Range) Source #

type Rep MetaVariable Source #

Instance details

getMetaInfo :: MetaVariable -> Closure Range Source #

data TCEnv Source #

Constructors

TCEnv

Fields

envContext :: Context
envLetBindings :: LetBindings
envCurrentModule :: ModuleName
envCurrentPath :: Maybe AbsolutePath
The path to the file that is currently being type-checked. Nothing if we do not have a file (like in interactive mode see CommandLine).
envAnonymousModules :: [(ModuleName, Nat)]
anonymous modules and their number of free variables
envImportPath :: [TopLevelModuleName]
The module stack with the entry being the top-level module as Agda chases modules. It will be empty if there is no main module, will have a single entry for the top level module, or more when descending past the main module. This is used to detect import cycles and in some cases highlighting behavior. The level of a given module is not necessarily the same as the length, in the module dependency graph, of the shortest path from the top-level module; it depends on in which order Agda chooses to chase dependencies.
envMutualBlock :: Maybe MutualId
the current (if any) mutual block
envTerminationCheck :: TerminationCheck ()
are we inside the scope of a termination pragma
envCoverageCheck :: CoverageCheck
are we inside the scope of a coverage pragma
envMakeCase :: Bool
are we inside a make-case (if so, ignore forcing analysis in unifier)
envSolvingConstraints :: Bool
Are we currently in the process of solving active constraints?
envCheckingWhere :: Bool
Have we stepped into the where-declarations of a clause? Everything under a where will be checked with this flag on.
envWorkingOnTypes :: Bool
Are we working on types? Turned on by workOnTypes.
envAssignMetas :: Bool
Are we allowed to assign metas?
envActiveProblems :: Set ProblemId
envAbstractMode :: AbstractMode
When checking the typesignature of a public definition or the body of a non-abstract definition this is true. To prevent information about abstract things leaking outside the module.
envRelevance :: Relevance
Are we checking an irrelevant argument? (=Irrelevant) Then top-level irrelevant declarations are enabled. Other value: Relevant, then only relevant decls. are available.
envQuantity :: Quantity
Are we checking a runtime-irrelevant thing? (=Quantity0) Then runtime-irrelevant things are usable.
envHardCompileTimeMode :: Bool
Is the "hard" compile-time mode enabled? In this mode the quantity component of the environment is always zero, and every new definition is treated as erased.
envSplitOnStrict :: Bool
Are we currently case-splitting on a strict datatype (i.e. in SSet)? If yes, the pattern-matching unifier will solve reflexive equations even --without-K.
envDisplayFormsEnabled :: Bool
Sometimes we want to disable display forms.
envFoldLetBindings :: Bool
Fold let-bindings when printing terms (default: True)
envRange :: Range
envHighlightingRange :: Range
Interactive highlighting uses this range rather than envRange.
envClause :: IPClause
What is the current clause we are type-checking? Will be recorded in interaction points in this clause.
envCall :: Maybe (Closure Call)
what we're doing at the moment
envHighlightingLevel :: HighlightingLevel
Set to None when imported modules are type-checked.
envHighlightingMethod :: HighlightingMethod
envExpandLast :: ExpandHidden
When type-checking an alias f=e, we do not want to insert hidden arguments in the end, because these will become unsolved metas.
envAppDef :: Maybe QName
We are reducing an application of this function. (For tracking of incomplete matches.)
envSimplification :: Simplification
Did we encounter a simplification (proper match) during the current reduction process?
envAllowedReductions :: AllowedReductions
envReduceDefs :: ReduceDefs
envReconstructed :: Bool
envInjectivityDepth :: Int
Injectivity can cause non-termination for unsolvable contraints (#431, #3067). Keep a limit on the nesting depth of injectivity uses.
envCompareBlocked :: Bool
When True, the conversion checker will consider all term constructors as injective, including blocked function applications and metas. Warning: this should only be used when not assigning any metas (e.g. when envAssignMetas is False or when running pureEqualTerms) or else we get non-unique meta solutions.
envPrintDomainFreePi :: Bool
When True, types will be omitted from printed pi types if they can be inferred.
envPrintMetasBare :: Bool
When True, throw away meta numbers and meta elims. This is used for reifying terms for feeding into the user's source code, e.g., for the interaction tactics solveAll.
envInsideDotPattern :: Bool
Used by the scope checker to make sure that certain forms of expressions are not used inside dot patterns: extended lambdas and let-expressions.
envUnquoteFlags :: UnquoteFlags
envInstanceDepth :: !Int
Until we get a termination checker for instance search (#1743) we limit the search depth to ensure termination.
envIsDebugPrinting :: Bool
envPrintingPatternLambdas :: [QName]
#3004: pattern lambdas with copatterns may refer to themselves. We don't have a good story for what to do in this case, but at least printing shouldn't loop. Here we keep track of which pattern lambdas we are currently in the process of printing.
envCallByNeed :: Bool
Use call-by-need evaluation for reductions.
envCurrentCheckpoint :: CheckpointId
Checkpoints track the evolution of the context as we go under binders or refine it by pattern matching.
envCheckpoints :: Map CheckpointId Substitution
Keeps the substitution from each previous checkpoint to the current context.
envGeneralizeMetas :: DoGeneralize
Should new metas generalized over.
envGeneralizedVars :: Map QName GeneralizedValue
Values for used generalizable variables.
envActiveBackendName :: Maybe BackendName
Is some backend active at the moment, and if yes, which? NB: we only store the BackendName here, otherwise instance Data TCEnv is not derivable. The actual backend can be obtained from the name via stBackends.
envConflComputingOverlap :: Bool
Are we currently computing the overlap between two rewrite rules for the purpose of confluence checking?
envCurrentlyElaborating :: Bool
Are we currently in the process of executing an elaborate-and-give interactive command?
envSyntacticEqualityFuel :: !(Maybe Int)
If this counter is Nothing, then syntactic equality checking is unrestricted. If it is zero, then syntactic equality checking is not run at all. If it is a positive number, then syntactic equality checking is allowed to run, but the counter is decreased in the failure continuation of checkSyntacticEquality.
envCurrentOpaqueId :: !(Maybe OpaqueId)
Unique identifier of the opaque block we are currently under, if any. Used by the scope checker (to associate definitions to blocks), and by the type checker (for unfolding control).

Instances

Instances details

LensIsAbstract TCEnv Source #

Instance details

Methods

lensIsAbstract :: Lens' TCEnv IsAbstract Source #

LensIsOpaque TCEnv Source #

Instance details

Methods

lensIsOpaque :: Lens' TCEnv IsOpaque Source #

LensTCEnv TCEnv Source #

Instance details

Methods

lensTCEnv :: Lens' TCEnv TCEnv Source #

Generic TCEnv Source #

Instance details

Associated Types

type Rep TCEnv

Instance details

Methods

from :: TCEnv -> Rep TCEnv x #

to :: Rep TCEnv x -> TCEnv #

NFData TCEnv Source #

Instance details

Methods

rnf :: TCEnv -> () #

type Rep TCEnv Source #

Instance details

data Closure a Source #

Constructors

Closure
Fields clSignature :: Signature clEnv :: TCEnv clScope :: ScopeInfo clModuleCheckpoints :: Map ModuleName CheckpointId clValue :: a

Instances

Instances details

Foldable Closure Source #

Instance details

Methods

fold :: Monoid m => Closure m -> m #

foldMap :: Monoid m => (a -> m) -> Closure a -> m #

foldMap' :: Monoid m => (a -> m) -> Closure a -> m #

foldr :: (a -> b -> b) -> b -> Closure a -> b #

foldr' :: (a -> b -> b) -> b -> Closure a -> b #

foldl :: (b -> a -> b) -> b -> Closure a -> b #

foldl' :: (b -> a -> b) -> b -> Closure a -> b #

foldr1 :: (a -> a -> a) -> Closure a -> a #

foldl1 :: (a -> a -> a) -> Closure a -> a #

toList :: Closure a -> [a] #

null :: Closure a -> Bool #

length :: Closure a -> Int #

elem :: Eq a => a -> Closure a -> Bool #

maximum :: Ord a => Closure a -> a #

minimum :: Ord a => Closure a -> a #

sum :: Num a => Closure a -> a #

product :: Num a => Closure a -> a #

Functor Closure Source #

Instance details

Methods

fmap :: (a -> b) -> Closure a -> Closure b #

(<$) :: a -> Closure b -> Closure a #

LensIsAbstract (Closure a) Source #

Instance details

Methods

lensIsAbstract :: Lens' (Closure a) IsAbstract Source #

HasRange a => HasRange (Closure a) Source #

Instance details

Methods

getRange :: Closure a -> Range Source #

KillRange a => KillRange (Closure a) Source #

Instance details

Methods

killRange :: KillRangeT (Closure a) Source #

MentionsMeta a => MentionsMeta (Closure a) Source #

Instance details

Methods

mentionsMetas :: HashSet MetaId -> Closure a -> Bool Source #

LensTCEnv (Closure a) Source #

Instance details

Methods

lensTCEnv :: Lens' (Closure a) TCEnv Source #

PrettyTCM a => PrettyTCM (Closure a) Source #

Instance details

Defined in Agda.TypeChecking.Pretty

Methods

prettyTCM :: MonadPretty m => Closure a -> m Doc Source #

Instantiate a => Instantiate (Closure a) Source #

Instance details

Defined in Agda.TypeChecking.Reduce

Methods

instantiate' :: Closure a -> ReduceM (Closure a) Source #

InstantiateFull a => InstantiateFull (Closure a) Source #

Instance details

Defined in Agda.TypeChecking.Reduce

Methods

instantiateFull' :: Closure a -> ReduceM (Closure a) Source #

Normalise a => Normalise (Closure a) Source #

Instance details

Defined in Agda.TypeChecking.Reduce

Methods

normalise' :: Closure a -> ReduceM (Closure a) Source #

Reduce a => Reduce (Closure a) Source #

Instance details

Defined in Agda.TypeChecking.Reduce

Methods

reduce' :: Closure a -> ReduceM (Closure a) Source #

reduceB' :: Closure a -> ReduceM (Blocked (Closure a)) Source #

Simplify a => Simplify (Closure a) Source #

Instance details

Defined in Agda.TypeChecking.Reduce

Methods

simplify' :: Closure a -> ReduceM (Closure a)

Generic (Closure a) Source #

Instance details

Associated Types

type Rep (Closure a)

Instance details

type Rep (Closure a) = D1 ('MetaData "Closure" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "Closure" 'PrefixI 'True) ((S1 ('MetaSel ('Just "clSignature") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Signature) :*: S1 ('MetaSel ('Just "clEnv") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 TCEnv)) :*: (S1 ('MetaSel ('Just "clScope") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ScopeInfo) :*: (S1 ('MetaSel ('Just "clModuleCheckpoints") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Map ModuleName CheckpointId)) :*: S1 ('MetaSel ('Just "clValue") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)))))

Methods

from :: Closure a -> Rep (Closure a) x #

to :: Rep (Closure a) x -> Closure a #

Show a => Show (Closure a) Source #

Instance details

Methods

showsPrec :: Int -> Closure a -> ShowS #

show :: Closure a -> String #

showList :: [Closure a] -> ShowS #

NFData a => NFData (Closure a) Source #

Instance details

Methods

rnf :: Closure a -> () #

LensClosure (Closure a) a Source #

Instance details

Methods

lensClosure :: Lens' (Closure a) (Closure a) Source #

type Rep (Closure a) Source #

Instance details

type Rep (Closure a) = D1 ('MetaData "Closure" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "Closure" 'PrefixI 'True) ((S1 ('MetaSel ('Just "clSignature") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Signature) :*: S1 ('MetaSel ('Just "clEnv") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 TCEnv)) :*: (S1 ('MetaSel ('Just "clScope") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ScopeInfo) :*: (S1 ('MetaSel ('Just "clModuleCheckpoints") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Map ModuleName CheckpointId)) :*: S1 ('MetaSel ('Just "clValue") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)))))

type Context = [ContextEntry] Source #

The Context is a stack of ContextEntrys.

type Constraints = [ProblemConstraint] Source #

data TypeCheckAction Source #

A complete log for a module will look like this:

Pragmas
EnterSection, entering the main module.
DeclEnterSectionLeaveSection, for declarations and nested modules
LeaveSection, leaving the main module.

Constructors

EnterSection !Erased !ModuleName !Telescope
LeaveSection !ModuleName
Decl !Declaration	Never a Section or ScopeDecl
Pragmas !PragmaOptions

Instances

Instances details

Generic TypeCheckAction Source #

Instance details

Associated Types

type Rep TypeCheckAction

Instance details

type Rep TypeCheckAction = D1 ('MetaData "TypeCheckAction" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) ((C1 ('MetaCons "EnterSection" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Erased) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 ModuleName) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Telescope))) :+: C1 ('MetaCons "LeaveSection" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 ModuleName))) :+: (C1 ('MetaCons "Decl" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Declaration)) :+: C1 ('MetaCons "Pragmas" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 PragmaOptions))))

Methods

from :: TypeCheckAction -> Rep TypeCheckAction x #

to :: Rep TypeCheckAction x -> TypeCheckAction #

NFData TypeCheckAction Source #

Instance details

Methods

rnf :: TypeCheckAction -> () #

type Rep TypeCheckAction Source #

Instance details

type Rep TypeCheckAction = D1 ('MetaData "TypeCheckAction" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) ((C1 ('MetaCons "EnterSection" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Erased) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 ModuleName) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Telescope))) :+: C1 ('MetaCons "LeaveSection" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 ModuleName))) :+: (C1 ('MetaCons "Decl" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Declaration)) :+: C1 ('MetaCons "Pragmas" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 PragmaOptions))))

pattern Primitive :: IsAbstract -> PrimitiveId -> [Clause] -> FunctionInverse -> Maybe CompiledClauses -> IsOpaque -> Defn Source #

newtype ReduceM a Source #

Constructors

ReduceM
Fields unReduceM :: ReduceEnv -> a

Instances

Instances details

HasOptions ReduceM Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods pragmaOptions :: ReduceM PragmaOptions Source # commandLineOptions :: ReduceM CommandLineOptions Source #
MonadReduce ReduceM Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods liftReduce :: ReduceM a -> ReduceM a Source #
MonadTCEnv ReduceM Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods askTC :: ReduceM TCEnv Source # localTC :: (TCEnv -> TCEnv) -> ReduceM a -> ReduceM a Source #
ReadTCState ReduceM Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods getTCState :: ReduceM TCState Source # locallyTCState :: Lens' TCState a -> (a -> a) -> ReduceM b -> ReduceM b Source # withTCState :: (TCState -> TCState) -> ReduceM a -> ReduceM a Source #
HasBuiltins ReduceM Source #
Instance details Defined in Agda.TypeChecking.Reduce.Monad Methods getBuiltinThing :: SomeBuiltin -> ReduceM (Maybe (Builtin PrimFun)) Source #
MonadAddContext ReduceM Source #
Instance details Defined in Agda.TypeChecking.Reduce.Monad Methods addCtx :: Name -> Dom Type -> ReduceM a -> ReduceM a Source # addLetBinding' :: Origin -> Name -> Term -> Dom Type -> ReduceM a -> ReduceM a Source # updateContext :: Substitution -> (Context -> Context) -> ReduceM a -> ReduceM a Source # withFreshName :: Range -> ArgName -> (Name -> ReduceM a) -> ReduceM a Source #
MonadDebug ReduceM Source #
Instance details Defined in Agda.TypeChecking.Reduce.Monad Methods formatDebugMessage :: VerboseKey -> VerboseLevel -> TCM Doc -> ReduceM String Source # traceDebugMessage :: VerboseKey -> VerboseLevel -> String -> ReduceM a -> ReduceM a Source # verboseBracket :: VerboseKey -> VerboseLevel -> String -> ReduceM a -> ReduceM a Source # getVerbosity :: ReduceM Verbosity Source # getProfileOptions :: ReduceM ProfileOptions Source # isDebugPrinting :: ReduceM Bool Source # nowDebugPrinting :: ReduceM a -> ReduceM a Source #
PureTCM ReduceM Source #
Instance details Defined in Agda.TypeChecking.Reduce.Monad
HasConstInfo ReduceM Source #
Instance details Defined in Agda.TypeChecking.Reduce.Monad Methods getConstInfo :: QName -> ReduceM Definition Source # getConstInfo' :: QName -> ReduceM (Either SigError Definition) Source # getRewriteRulesFor :: QName -> ReduceM RewriteRules Source #
MonadFail ReduceM Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods fail :: String -> ReduceM a #
Applicative ReduceM Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods pure :: a -> ReduceM a # (<>) :: ReduceM (a -> b) -> ReduceM a -> ReduceM b # liftA2 :: (a -> b -> c) -> ReduceM a -> ReduceM b -> ReduceM c # (>) :: ReduceM a -> ReduceM b -> ReduceM b # (<*) :: ReduceM a -> ReduceM b -> ReduceM a #
Functor ReduceM Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods fmap :: (a -> b) -> ReduceM a -> ReduceM b # (<$) :: a -> ReduceM b -> ReduceM a #
Monad ReduceM Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods (>>=) :: ReduceM a -> (a -> ReduceM b) -> ReduceM b # (>>) :: ReduceM a -> ReduceM b -> ReduceM b # return :: a -> ReduceM a #

runReduceM :: ReduceM a -> TCM a Source #

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

Instances details

Generic HighlightingLevel Source #

Instance details

Associated Types

type Rep HighlightingLevel
Instance details Defined in Agda.TypeChecking.Monad.Base type Rep HighlightingLevel = D1 ('MetaData "HighlightingLevel" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "None" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "NonInteractive" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "Interactive" 'PrefixI 'False) (U1 :: Type -> Type)))

Methods

from :: HighlightingLevel -> Rep HighlightingLevel x #

to :: Rep HighlightingLevel x -> HighlightingLevel #

Read HighlightingLevel Source #

Instance details

Methods

readsPrec :: Int -> ReadS HighlightingLevel #

readList :: ReadS [HighlightingLevel] #

readPrec :: ReadPrec HighlightingLevel #

readListPrec :: ReadPrec [HighlightingLevel] #

Show HighlightingLevel Source #

Instance details

Methods

showsPrec :: Int -> HighlightingLevel -> ShowS #

show :: HighlightingLevel -> String #

showList :: [HighlightingLevel] -> ShowS #

NFData HighlightingLevel Source #

Instance details

Methods

rnf :: HighlightingLevel -> () #

Eq HighlightingLevel Source #

Instance details

Methods

(==) :: HighlightingLevel -> HighlightingLevel -> Bool #

(/=) :: HighlightingLevel -> HighlightingLevel -> Bool #

Ord HighlightingLevel Source #

Instance details

Methods

compare :: HighlightingLevel -> HighlightingLevel -> Ordering #

(<) :: HighlightingLevel -> HighlightingLevel -> Bool #

(<=) :: HighlightingLevel -> HighlightingLevel -> Bool #

(>) :: HighlightingLevel -> HighlightingLevel -> Bool #

(>=) :: HighlightingLevel -> HighlightingLevel -> Bool #

max :: HighlightingLevel -> HighlightingLevel -> HighlightingLevel #

min :: HighlightingLevel -> HighlightingLevel -> HighlightingLevel #

type Rep HighlightingLevel Source #

Instance details

type Rep HighlightingLevel = D1 ('MetaData "HighlightingLevel" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "None" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "NonInteractive" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "Interactive" 'PrefixI 'False) (U1 :: Type -> Type)))

data HighlightingMethod Source #

How should highlighting be sent to the user interface?

Constructors

Direct	Via stdout.
Indirect	Both via files and via stdout.

Instances

Instances details

Generic HighlightingMethod Source #

Instance details

Associated Types

type Rep HighlightingMethod
Instance details Defined in Agda.TypeChecking.Monad.Base type Rep HighlightingMethod = D1 ('MetaData "HighlightingMethod" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "Direct" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "Indirect" 'PrefixI 'False) (U1 :: Type -> Type))

Methods

from :: HighlightingMethod -> Rep HighlightingMethod x #

to :: Rep HighlightingMethod x -> HighlightingMethod #

Read HighlightingMethod Source #

Instance details

Methods

readsPrec :: Int -> ReadS HighlightingMethod #

readList :: ReadS [HighlightingMethod] #

readPrec :: ReadPrec HighlightingMethod #

readListPrec :: ReadPrec [HighlightingMethod] #

Show HighlightingMethod Source #

Instance details

Methods

showsPrec :: Int -> HighlightingMethod -> ShowS #

show :: HighlightingMethod -> String #

showList :: [HighlightingMethod] -> ShowS #

NFData HighlightingMethod Source #

Instance details

Methods

rnf :: HighlightingMethod -> () #

Eq HighlightingMethod Source #

Instance details

Methods

(==) :: HighlightingMethod -> HighlightingMethod -> Bool #

(/=) :: HighlightingMethod -> HighlightingMethod -> Bool #

type Rep HighlightingMethod Source #

Instance details

type Rep HighlightingMethod = D1 ('MetaData "HighlightingMethod" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "Direct" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "Indirect" 'PrefixI 'False) (U1 :: Type -> Type))

data Open a Source #

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
Fields openThingCheckpoint :: CheckpointId openThingCheckpointMap :: Map CheckpointId Substitution openThingModule :: ModuleNameHash openThing :: a

Instances

Instances details

Decoration Open Source #

Instance details

Methods

traverseF :: Functor m => (a -> m b) -> Open a -> m (Open b) Source #

distributeF :: Functor m => Open (m a) -> m (Open a) Source #

Foldable Open Source #

Instance details

Methods

fold :: Monoid m => Open m -> m #

foldMap :: Monoid m => (a -> m) -> Open a -> m #

foldMap' :: Monoid m => (a -> m) -> Open a -> m #

foldr :: (a -> b -> b) -> b -> Open a -> b #

foldr' :: (a -> b -> b) -> b -> Open a -> b #

foldl :: (b -> a -> b) -> b -> Open a -> b #

foldl' :: (b -> a -> b) -> b -> Open a -> b #

foldr1 :: (a -> a -> a) -> Open a -> a #

foldl1 :: (a -> a -> a) -> Open a -> a #

toList :: Open a -> [a] #

null :: Open a -> Bool #

length :: Open a -> Int #

elem :: Eq a => a -> Open a -> Bool #

maximum :: Ord a => Open a -> a #

minimum :: Ord a => Open a -> a #

sum :: Num a => Open a -> a #

product :: Num a => Open a -> a #

Traversable Open Source #

Instance details

Methods

traverse :: Applicative f => (a -> f b) -> Open a -> f (Open b) #

sequenceA :: Applicative f => Open (f a) -> f (Open a) #

mapM :: Monad m => (a -> m b) -> Open a -> m (Open b) #

sequence :: Monad m => Open (m a) -> m (Open a) #

Functor Open Source #

Instance details

Methods

fmap :: (a -> b) -> Open a -> Open b #

(<$) :: a -> Open b -> Open a #

Pretty a => Pretty (Open a) Source #

Instance details

Methods

pretty :: Open a -> Doc Source #

prettyPrec :: Int -> Open a -> Doc Source #

prettyList :: [Open a] -> Doc Source #

NamesIn a => NamesIn (Open a) Source #

Instance details

Methods

namesAndMetasIn' :: Monoid m => (Either QName MetaId -> m) -> Open a -> m Source #

KillRange a => KillRange (Open a) Source #

Instance details

Methods

killRange :: KillRangeT (Open a) Source #

InstantiateFull t => InstantiateFull (Open t) Source #

Instance details

Defined in Agda.TypeChecking.Reduce

Methods

instantiateFull' :: Open t -> ReduceM (Open t) Source #

EmbPrj a => EmbPrj (Open a) Source #

Instance details

Defined in Agda.TypeChecking.Serialise.Instances.Internal

Methods

icode :: Open a -> S Int32 Source #

icod_ :: Open a -> S Int32 Source #

value :: Int32 -> R (Open a) Source #

Generic (Open a) Source #

Instance details

Associated Types

type Rep (Open a)

Instance details

type Rep (Open a) = D1 ('MetaData "Open" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "OpenThing" 'PrefixI 'True) ((S1 ('MetaSel ('Just "openThingCheckpoint") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 CheckpointId) :*: S1 ('MetaSel ('Just "openThingCheckpointMap") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Map CheckpointId Substitution))) :*: (S1 ('MetaSel ('Just "openThingModule") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ModuleNameHash) :*: S1 ('MetaSel ('Just "openThing") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a))))

Methods

from :: Open a -> Rep (Open a) x #

to :: Rep (Open a) x -> Open a #

Show a => Show (Open a) Source #

Instance details

Methods

showsPrec :: Int -> Open a -> ShowS #

show :: Open a -> String #

showList :: [Open a] -> ShowS #

NFData a => NFData (Open a) Source #

Instance details

Methods

rnf :: Open a -> () #

type Rep (Open a) Source #

Instance details

type Rep (Open a) = D1 ('MetaData "Open" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "OpenThing" 'PrefixI 'True) ((S1 ('MetaSel ('Just "openThingCheckpoint") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 CheckpointId) :*: S1 ('MetaSel ('Just "openThingCheckpointMap") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Map CheckpointId Substitution))) :*: (S1 ('MetaSel ('Just "openThingModule") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ModuleNameHash) :*: S1 ('MetaSel ('Just "openThing") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a))))

data MetaInstantiation Source #

Constructors

InstV Instantiation	solved
Open	unsolved
OpenInstance	open, to be instantiated by instance search
BlockedConst Term	solution blocked by unsolved constraints
PostponedTypeCheckingProblem (Closure TypeCheckingProblem)

Instances

Instances details

Pretty MetaInstantiation Source #

Instance details

Methods

pretty :: MetaInstantiation -> Doc Source #

prettyPrec :: Int -> MetaInstantiation -> Doc Source #

prettyList :: [MetaInstantiation] -> Doc Source #

Generic MetaInstantiation Source #

Instance details

Associated Types

type Rep MetaInstantiation

Instance details

type Rep MetaInstantiation = D1 ('MetaData "MetaInstantiation" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) ((C1 ('MetaCons "InstV" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Instantiation)) :+: C1 ('MetaCons "Open" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "OpenInstance" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "BlockedConst" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term)) :+: C1 ('MetaCons "PostponedTypeCheckingProblem" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Closure TypeCheckingProblem))))))

Methods

from :: MetaInstantiation -> Rep MetaInstantiation x #

to :: Rep MetaInstantiation x -> MetaInstantiation #

NFData MetaInstantiation Source #

Instance details

Methods

rnf :: MetaInstantiation -> () #

type Rep MetaInstantiation Source #

Instance details

type Rep MetaInstantiation = D1 ('MetaData "MetaInstantiation" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) ((C1 ('MetaCons "InstV" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Instantiation)) :+: C1 ('MetaCons "Open" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "OpenInstance" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "BlockedConst" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term)) :+: C1 ('MetaCons "PostponedTypeCheckingProblem" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Closure TypeCheckingProblem))))))

data MetaInfo Source #

MetaInfo is cloned from one meta to the next during pruning.

Constructors

MetaInfo

Fields

miClosRange :: Closure Range
miModality :: Modality
Instantiable with irrelevant/erased solution?
miMetaOccursCheck :: RunMetaOccursCheck
Run the extended occurs check that goes in definitions?
miNameSuggestion :: MetaNameSuggestion
Used for printing. Just x if meta-variable comes from omitted argument with name x.
miGeneralizable :: Arg DoGeneralize
Should this meta be generalized if unsolved? If so, at what ArgInfo?

Instances

Instances details

LensIsAbstract MetaInfo Source #

Instance details

Methods

lensIsAbstract :: Lens' MetaInfo IsAbstract Source #

LensModality MetaInfo Source #

Instance details

Methods

getModality :: MetaInfo -> Modality Source #

setModality :: Modality -> MetaInfo -> MetaInfo Source #

mapModality :: (Modality -> Modality) -> MetaInfo -> MetaInfo Source #

LensQuantity MetaInfo Source #

Instance details

Methods

getQuantity :: MetaInfo -> Quantity Source #

setQuantity :: Quantity -> MetaInfo -> MetaInfo Source #

mapQuantity :: (Quantity -> Quantity) -> MetaInfo -> MetaInfo Source #

LensRelevance MetaInfo Source #

Instance details

Methods

getRelevance :: MetaInfo -> Relevance Source #

setRelevance :: Relevance -> MetaInfo -> MetaInfo Source #

mapRelevance :: (Relevance -> Relevance) -> MetaInfo -> MetaInfo Source #

HasRange MetaInfo Source #

Instance details

Methods

getRange :: MetaInfo -> Range Source #

SetRange MetaInfo Source #

Instance details

Methods

setRange :: Range -> MetaInfo -> MetaInfo Source #

Generic MetaInfo Source #

Instance details

Associated Types

type Rep MetaInfo

Instance details

type Rep MetaInfo = D1 ('MetaData "MetaInfo" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "MetaInfo" 'PrefixI 'True) ((S1 ('MetaSel ('Just "miClosRange") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Closure Range)) :*: S1 ('MetaSel ('Just "miModality") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Modality)) :*: (S1 ('MetaSel ('Just "miMetaOccursCheck") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 RunMetaOccursCheck) :*: (S1 ('MetaSel ('Just "miNameSuggestion") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 MetaNameSuggestion) :*: S1 ('MetaSel ('Just "miGeneralizable") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Arg DoGeneralize))))))

Methods

from :: MetaInfo -> Rep MetaInfo x #

to :: Rep MetaInfo x -> MetaInfo #

NFData MetaInfo Source #

Instance details

Methods

rnf :: MetaInfo -> () #

LensClosure MetaInfo Range Source #

Instance details

Methods

lensClosure :: Lens' MetaInfo (Closure Range) Source #

type Rep MetaInfo Source #

Instance details

type Rep MetaInfo = D1 ('MetaData "MetaInfo" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "MetaInfo" 'PrefixI 'True) ((S1 ('MetaSel ('Just "miClosRange") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Closure Range)) :*: S1 ('MetaSel ('Just "miModality") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Modality)) :*: (S1 ('MetaSel ('Just "miMetaOccursCheck") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 RunMetaOccursCheck) :*: (S1 ('MetaSel ('Just "miNameSuggestion") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 MetaNameSuggestion) :*: S1 ('MetaSel ('Just "miGeneralizable") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Arg DoGeneralize))))))

data Warning Source #

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 `f` whose ranges are rs are unreachable
CoverageIssue QName [(Telescope, [NamedArg DeBruijnPattern])]	`CoverageIssue f pss` means that `pss` are not covered in `f`
CoverageNoExactSplit QName [Clause]
InlineNoExactSplit QName Clause	`Clause` was turned into copattern matching clause(s) by an `{-# INLINE constructor #-}` and thus is not a definitional equality any more.
NotStrictlyPositive QName (Seq OccursWhere)
UnsolvedMetaVariables [Range]	Do not use directly with `warning`
UnsolvedInteractionMetas [Range]	Do not use directly with `warning`
UnsolvedConstraints Constraints	Do not use directly with `warning`
InteractionMetaBoundaries [Range]	Do not use directly with `warning`
CantGeneralizeOverSorts [MetaId]
AbsurdPatternRequiresNoRHS [NamedArg DeBruijnPattern]
OldBuiltin BuiltinId BuiltinId	In `OldBuiltin old new`, the BUILTIN old has been replaced by new
EmptyRewritePragma	If the user wrote just `{-# REWRITE #-}`.
EmptyWhere	An empty `where` block is dead code.
IllformedAsClause String	If the user wrote something other than an unqualified name in the `as` clause of an `import` statement. The `String` gives optionally extra explanation.
InvalidCharacterLiteral Char	A character literal Agda does not support, e.g. surrogate code points.
ClashesViaRenaming NameOrModule [Name]	If a `renaming` import directive introduces a name or module name clash in the exported names of a module. (See issue #4154.)
UselessPatternDeclarationForRecord String	The 'pattern' declaration is useless in the presence of either `coinductive` or `eta-equality`. Content of `String` is "coinductive" or "eta", resp.
UselessPragma Range Doc	Warning when pragma is useless and thus ignored. `Range` is for dead code highlighting.
UselessPublic	If the user opens a module public before the module header. (See issue #2377.)
UselessHiding [ImportedName]	Names in `hiding` directive that don't hide anything imported by a `using` directive.
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)
SafeFlagPostulate Name
SafeFlagPragma [String]	Unsafe OPTIONS.
SafeFlagWithoutKFlagPrimEraseEquality
WithoutKFlagPrimEraseEquality
OptionWarning OptionWarning
ParseWarning ParseWarning
LibraryWarning LibWarning
DeprecationWarning String String String	`DeprecationWarning old new version`: `old` is deprecated, use `new` instead. This will be an error in Agda `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 `using` directive(s).
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 Doc	Importing a file using an infective option into one which doesn't
CoInfectiveImport Doc	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 `u` that reduces to both `v1` and `v2` and there is no rule to resolve the ambiguity.
RewriteMissingRule Term Term Term	The global confluence checker found a term `u` that reduces to `v`, but `v` does not reduce to `rho(u)`.
PragmaCompileErased BackendName QName	COMPILE directive for an erased symbol
NotInScopeW [QName]	Out of scope error we can recover from
UnsupportedIndexedMatch Doc	Was not able to compute a full equivalence when splitting.
AsPatternShadowsConstructorOrPatternSynonym Bool	The as-name in an as-pattern may not shadow a constructor (`False`) or pattern synonym name (`True`), because this can be confusing to read.
PatternShadowsConstructor Name QName	A pattern variable has the name of a constructor (data constructor or matchable record constructor).
PlentyInHardCompileTimeMode QωOrigin	Explicit use of @`ω` or @`plenty` in hard compile-time mode.
RecordFieldWarning RecordFieldWarning
NotAffectedByOpaque
UnfoldTransparentName QName
UselessOpaque
FaceConstraintCannotBeHidden ArgInfo	Face constraint patterns `(i = 0)` must be visible arguments.
FaceConstraintCannotBeNamed NamedName	Face constraint patterns `(i = 0)` must be unnamed arguments.
DuplicateInterfaceFiles AbsolutePath AbsolutePath	`DuplicateInterfaceFiles selectedInterfaceFile ignoredInterfaceFile`

Instances

Instances details

EmbPrj Warning Source #

Instance details

Defined in Agda.TypeChecking.Serialise.Instances.Errors

Methods

icode :: Warning -> S Int32 Source #

icod_ :: Warning -> S Int32 Source #

value :: Int32 -> R Warning Source #

Generic Warning Source #

Instance details

Associated Types

type Rep Warning

Instance details

Methods

from :: Warning -> Rep Warning x #

to :: Rep Warning x -> Warning #

Show Warning Source #

Instance details

Methods

showsPrec :: Int -> Warning -> ShowS #

show :: Warning -> String #

showList :: [Warning] -> ShowS #

NFData Warning Source #

Instance details

Methods

rnf :: Warning -> () #

type Rep Warning Source #

Instance details

data TCWarning Source #

Constructors

TCWarning
Fields tcWarningLocation :: CallStack Location in the internal Agda source code location where the error raised tcWarningRange :: Range Range where the warning was raised tcWarning :: Warning The warning itself tcWarningPrintedWarning :: Doc The warning printed in the state and environment where it was raised tcWarningCached :: Bool Should the warning be affected by caching.

Instances

Instances details

EncodeTCM TCWarning Source #

Instance details

Defined in Agda.Interaction.JSONTop

Methods

encodeTCM :: TCWarning -> TCM Value Source #

HasRange TCWarning Source #

Instance details

Methods

getRange :: TCWarning -> Range Source #

PrettyTCM TCWarning Source #

Instance details

Defined in Agda.TypeChecking.Pretty.Warning

Methods

prettyTCM :: MonadPretty m => TCWarning -> m Doc Source #

EmbPrj TCWarning Source #

Instance details

Defined in Agda.TypeChecking.Serialise.Instances.Errors

Methods

icode :: TCWarning -> S Int32 Source #

icod_ :: TCWarning -> S Int32 Source #

value :: Int32 -> R TCWarning Source #

Generic TCWarning Source #

Instance details

Associated Types

type Rep TCWarning

Instance details

type Rep TCWarning = D1 ('MetaData "TCWarning" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "TCWarning" 'PrefixI 'True) ((S1 ('MetaSel ('Just "tcWarningLocation") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 CallStack) :*: S1 ('MetaSel ('Just "tcWarningRange") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Range)) :*: (S1 ('MetaSel ('Just "tcWarning") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Warning) :*: (S1 ('MetaSel ('Just "tcWarningPrintedWarning") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Doc) :*: S1 ('MetaSel ('Just "tcWarningCached") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool)))))

Methods

from :: TCWarning -> Rep TCWarning x #

to :: Rep TCWarning x -> TCWarning #

Show TCWarning Source #

Instance details

Methods

showsPrec :: Int -> TCWarning -> ShowS #

show :: TCWarning -> String #

showList :: [TCWarning] -> ShowS #

NFData TCWarning Source #

Instance details

Methods

rnf :: TCWarning -> () #

Eq TCWarning Source #

Instance details

Methods

(==) :: TCWarning -> TCWarning -> Bool #

(/=) :: TCWarning -> TCWarning -> Bool #

type Rep TCWarning Source #

Instance details

type Rep TCWarning = D1 ('MetaData "TCWarning" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "TCWarning" 'PrefixI 'True) ((S1 ('MetaSel ('Just "tcWarningLocation") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 CallStack) :*: S1 ('MetaSel ('Just "tcWarningRange") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Range)) :*: (S1 ('MetaSel ('Just "tcWarning") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Warning) :*: (S1 ('MetaSel ('Just "tcWarningPrintedWarning") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Doc) :*: S1 ('MetaSel ('Just "tcWarningCached") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool)))))

data NamedMeta Source #

For printing, we couple a meta with its name suggestion.

Constructors

NamedMeta
Fields nmSuggestion :: MetaNameSuggestion nmid :: MetaId

Instances

Instances details

EncodeTCM NamedMeta Source #

Instance details

Defined in Agda.Interaction.JSONTop

Methods

encodeTCM :: NamedMeta -> TCM Value Source #

Pretty NamedMeta Source #

Instance details

Methods

pretty :: NamedMeta -> Doc Source #

prettyPrec :: Int -> NamedMeta -> Doc Source #

prettyList :: [NamedMeta] -> Doc Source #

ToConcrete NamedMeta Source #

Instance details

Defined in Agda.Syntax.Translation.AbstractToConcrete

Associated Types

type ConOfAbs NamedMeta
Instance details Defined in Agda.Syntax.Translation.AbstractToConcrete type ConOfAbs NamedMeta = Expr

Methods

toConcrete :: NamedMeta -> AbsToCon (ConOfAbs NamedMeta) Source #

bindToConcrete :: NamedMeta -> (ConOfAbs NamedMeta -> AbsToCon b) -> AbsToCon b Source #

PrettyTCM NamedMeta Source #

Instance details

Defined in Agda.TypeChecking.Pretty

Methods

prettyTCM :: MonadPretty m => NamedMeta -> m Doc Source #

type ConOfAbs NamedMeta Source #

Instance details

Defined in Agda.Syntax.Translation.AbstractToConcrete

type ConOfAbs NamedMeta = Expr

type ModuleToSource = Map TopLevelModuleName AbsolutePath Source #

Maps top-level module names to the corresponding source file names.

pattern Record :: Nat -> Maybe Clause -> ConHead -> Bool -> [Dom QName] -> Telescope -> Maybe [QName] -> EtaEquality -> PatternOrCopattern -> Maybe Induction -> Maybe Bool -> IsAbstract -> CompKit -> Defn Source #

type Definitions = HashMap QName Definition Source #

initState :: TCState Source #

data IPFace' t Source #

Datatype representing a single boundary condition: x_0 = u_0, ... ,x_n = u_n ⊢ t = ?n es

Constructors

IPFace'
Fields faceEqns :: [(t, t)] faceRHS :: t

Instances

Instances details

Pretty c => Pretty (IPFace' c) Source #
Instance details Defined in Agda.Interaction.BasicOps Methods pretty :: IPFace' c -> Doc Source # prettyPrec :: Int -> IPFace' c -> Doc Source # prettyList :: [IPFace' c] -> Doc Source #

class Monad m => MonadTCEnv (m :: Type -> Type) 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

askTC :: m TCEnv Source #

default askTC :: forall (t :: (Type -> Type) -> Type -> Type) (n :: Type -> Type). (MonadTrans t, MonadTCEnv n, t n ~ m) => m TCEnv Source #

localTC :: (TCEnv -> TCEnv) -> m a -> m a Source #

default localTC :: forall (t :: (Type -> Type) -> Type -> Type) (n :: Type -> Type) a. (MonadTransControl t, MonadTCEnv n, t n ~ m) => (TCEnv -> TCEnv) -> m a -> m a Source #

Instances

Instances details

MonadTCEnv IM Source #
Instance details Defined in Agda.Interaction.Monad Methods askTC :: IM TCEnv Source # localTC :: (TCEnv -> TCEnv) -> IM a -> IM a Source #
MonadTCEnv AbsToCon Source #
Instance details Defined in Agda.Syntax.Translation.AbstractToConcrete Methods askTC :: AbsToCon TCEnv Source # localTC :: (TCEnv -> TCEnv) -> AbsToCon a -> AbsToCon a Source #
MonadTCEnv TerM Source #
Instance details Defined in Agda.Termination.Monad Methods askTC :: TerM TCEnv Source # localTC :: (TCEnv -> TCEnv) -> TerM a -> TerM a Source #
MonadTCEnv ReduceM Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods askTC :: ReduceM TCEnv Source # localTC :: (TCEnv -> TCEnv) -> ReduceM a -> ReduceM a Source #
MonadTCEnv NLM Source #
Instance details Defined in Agda.TypeChecking.Rewriting.NonLinMatch Methods askTC :: NLM TCEnv Source # localTC :: (TCEnv -> TCEnv) -> NLM a -> NLM a Source #
MonadTCEnv m => MonadTCEnv (PureConversionT m) Source #
Instance details 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 #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods askTC :: BlockT m TCEnv Source # localTC :: (TCEnv -> TCEnv) -> BlockT m a -> BlockT m a Source #
MonadIO m => MonadTCEnv (TCMT m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods askTC :: TCMT m TCEnv Source # localTC :: (TCEnv -> TCEnv) -> TCMT m a -> TCMT m a Source #
MonadTCEnv m => MonadTCEnv (NamesT m) Source #
Instance details Defined in Agda.TypeChecking.Names Methods askTC :: NamesT m TCEnv Source # localTC :: (TCEnv -> TCEnv) -> NamesT m a -> NamesT m a Source #
MonadTCEnv m => MonadTCEnv (ListT m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods askTC :: ListT m TCEnv Source # localTC :: (TCEnv -> TCEnv) -> ListT m a -> ListT m a Source #
MonadTCEnv m => MonadTCEnv (ChangeT m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods askTC :: ChangeT m TCEnv Source # localTC :: (TCEnv -> TCEnv) -> ChangeT m a -> ChangeT m a Source #
MonadTCEnv m => MonadTCEnv (MaybeT m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods askTC :: MaybeT m TCEnv Source # localTC :: (TCEnv -> TCEnv) -> MaybeT m a -> MaybeT m a Source #
MonadTCEnv m => MonadTCEnv (ExceptT err m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods askTC :: ExceptT err m TCEnv Source # localTC :: (TCEnv -> TCEnv) -> ExceptT err m a -> ExceptT err m a Source #
MonadTCEnv m => MonadTCEnv (IdentityT m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods askTC :: IdentityT m TCEnv Source # localTC :: (TCEnv -> TCEnv) -> IdentityT m a -> IdentityT m a Source #
MonadTCEnv m => MonadTCEnv (ReaderT r m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods askTC :: ReaderT r m TCEnv Source # localTC :: (TCEnv -> TCEnv) -> ReaderT r m a -> ReaderT r m a Source #
MonadTCEnv m => MonadTCEnv (StateT s m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods askTC :: StateT s m TCEnv Source # localTC :: (TCEnv -> TCEnv) -> StateT s m a -> StateT s m a Source #
(Monoid w, MonadTCEnv m) => MonadTCEnv (WriterT w m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods askTC :: WriterT w m TCEnv Source # localTC :: (TCEnv -> TCEnv) -> WriterT w m a -> WriterT w m a Source #

class (Applicative tcm, MonadIO tcm, MonadTCEnv tcm, MonadTCState tcm, HasOptions tcm) => MonadTCM (tcm :: Type -> Type) where Source #

Embedding a TCM computation.

Minimal complete definition

Nothing

Methods

liftTCM :: TCM a -> tcm a Source #

default liftTCM :: forall (m :: Type -> Type) (t :: (Type -> Type) -> Type -> Type) a. (MonadTCM m, MonadTrans t, tcm ~ t m) => TCM a -> tcm a Source #

Instances

Instances details

MonadTCM IM Source #
Instance details Defined in Agda.Interaction.Monad Methods liftTCM :: TCM a -> IM a Source #
MonadTCM TerM Source #
Instance details Defined in Agda.Termination.Monad Methods liftTCM :: TCM a -> TerM a Source #
MonadTCM m => MonadTCM (BlockT m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods liftTCM :: TCM a -> BlockT m a Source #
MonadIO m => MonadTCM (TCMT m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods liftTCM :: TCM a -> TCMT m a Source #
MonadTCM m => MonadTCM (NamesT m) Source #
Instance details Defined in Agda.TypeChecking.Names Methods liftTCM :: TCM a -> NamesT m a Source #
MonadTCM tcm => MonadTCM (ListT tcm) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods liftTCM :: TCM a -> ListT tcm a Source #
MonadTCM tcm => MonadTCM (ChangeT tcm) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods liftTCM :: TCM a -> ChangeT tcm a Source #
MonadTCM tcm => MonadTCM (MaybeT tcm) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods liftTCM :: TCM a -> MaybeT tcm a Source #
MonadTCM tcm => MonadTCM (ExceptT err tcm) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods liftTCM :: TCM a -> ExceptT err tcm a Source #
MonadTCM tcm => MonadTCM (IdentityT tcm) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods liftTCM :: TCM a -> IdentityT tcm a Source #
MonadTCM tcm => MonadTCM (ReaderT r tcm) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods liftTCM :: TCM a -> ReaderT r tcm a Source #
MonadTCM tcm => MonadTCM (StateT s tcm) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods liftTCM :: TCM a -> StateT s tcm a Source #
(Monoid w, MonadTCM tcm) => MonadTCM (WriterT w tcm) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods liftTCM :: TCM a -> WriterT w tcm a Source #

class Monad m => MonadTCState (m :: Type -> Type) 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

getTC :: m TCState Source #

default getTC :: forall (t :: (Type -> Type) -> Type -> Type) (n :: Type -> Type). (MonadTrans t, MonadTCState n, t n ~ m) => m TCState Source #

putTC :: TCState -> m () Source #

default putTC :: forall (t :: (Type -> Type) -> Type -> Type) (n :: Type -> Type). (MonadTrans t, MonadTCState n, t n ~ m) => TCState -> m () Source #

modifyTC :: (TCState -> TCState) -> m () Source #

default modifyTC :: forall (t :: (Type -> Type) -> Type -> Type) (n :: Type -> Type). (MonadTrans t, MonadTCState n, t n ~ m) => (TCState -> TCState) -> m () Source #

Instances

Instances details

MonadTCState IM Source #
Instance details Defined in Agda.Interaction.Monad Methods getTC :: IM TCState Source # putTC :: TCState -> IM () Source # modifyTC :: (TCState -> TCState) -> IM () Source #
MonadTCState TerM Source #
Instance details Defined in Agda.Termination.Monad Methods getTC :: TerM TCState Source # putTC :: TCState -> TerM () Source # modifyTC :: (TCState -> TCState) -> TerM () Source #
MonadTCState m => MonadTCState (BlockT m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods getTC :: BlockT m TCState Source # putTC :: TCState -> BlockT m () Source # modifyTC :: (TCState -> TCState) -> BlockT m () Source #
MonadIO m => MonadTCState (TCMT m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods getTC :: TCMT m TCState Source # putTC :: TCState -> TCMT m () Source # modifyTC :: (TCState -> TCState) -> TCMT m () Source #
MonadTCState m => MonadTCState (NamesT m) Source #
Instance details Defined in Agda.TypeChecking.Names Methods getTC :: NamesT m TCState Source # putTC :: TCState -> NamesT m () Source # modifyTC :: (TCState -> TCState) -> NamesT m () Source #
MonadTCState m => MonadTCState (ListT m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods getTC :: ListT m TCState Source # putTC :: TCState -> ListT m () Source # modifyTC :: (TCState -> TCState) -> ListT m () Source #
MonadTCState m => MonadTCState (ChangeT m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods getTC :: ChangeT m TCState Source # putTC :: TCState -> ChangeT m () Source # modifyTC :: (TCState -> TCState) -> ChangeT m () Source #
MonadTCState m => MonadTCState (MaybeT m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods getTC :: MaybeT m TCState Source # putTC :: TCState -> MaybeT m () Source # modifyTC :: (TCState -> TCState) -> MaybeT m () Source #
MonadTCState m => MonadTCState (ExceptT err m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods getTC :: ExceptT err m TCState Source # putTC :: TCState -> ExceptT err m () Source # modifyTC :: (TCState -> TCState) -> ExceptT err m () Source #
MonadTCState m => MonadTCState (IdentityT m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods getTC :: IdentityT m TCState Source # putTC :: TCState -> IdentityT m () Source # modifyTC :: (TCState -> TCState) -> IdentityT m () Source #
MonadTCState m => MonadTCState (ReaderT r m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods getTC :: ReaderT r m TCState Source # putTC :: TCState -> ReaderT r m () Source # modifyTC :: (TCState -> TCState) -> ReaderT r m () Source #
MonadTCState m => MonadTCState (StateT s m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods getTC :: StateT s m TCState Source # putTC :: TCState -> StateT s m () Source # modifyTC :: (TCState -> TCState) -> StateT s m () Source #
(Monoid w, MonadTCState m) => MonadTCState (WriterT w m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods getTC :: WriterT w m TCState Source # putTC :: TCState -> WriterT w m () Source # modifyTC :: (TCState -> TCState) -> WriterT w m () Source #

class Monad m => ReadTCState (m :: Type -> Type) where Source #

Minimal complete definition

Nothing

Methods

getTCState :: m TCState Source #

default getTCState :: forall (t :: (Type -> Type) -> Type -> Type) (n :: Type -> Type). (MonadTrans t, ReadTCState n, t n ~ m) => m TCState Source #

locallyTCState :: Lens' TCState a -> (a -> a) -> m b -> m b Source #

default locallyTCState :: forall (t :: (Type -> Type) -> Type -> Type) (n :: Type -> Type) a b. (MonadTransControl t, ReadTCState n, t n ~ m) => Lens' TCState a -> (a -> a) -> m b -> m b Source #

withTCState :: (TCState -> TCState) -> m a -> m a Source #

Instances

Instances details

ReadTCState IM Source #
Instance details Defined in Agda.Interaction.Monad Methods getTCState :: IM TCState Source # locallyTCState :: Lens' TCState a -> (a -> a) -> IM b -> IM b Source # withTCState :: (TCState -> TCState) -> IM a -> IM a Source #
ReadTCState AbsToCon Source #
Instance details Defined in Agda.Syntax.Translation.AbstractToConcrete Methods getTCState :: AbsToCon TCState Source # locallyTCState :: Lens' TCState a -> (a -> a) -> AbsToCon b -> AbsToCon b Source # withTCState :: (TCState -> TCState) -> AbsToCon a -> AbsToCon a Source #
ReadTCState TerM Source #
Instance details Defined in Agda.Termination.Monad Methods getTCState :: TerM TCState Source # locallyTCState :: Lens' TCState a -> (a -> a) -> TerM b -> TerM b Source # withTCState :: (TCState -> TCState) -> TerM a -> TerM a Source #
ReadTCState ReduceM Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods getTCState :: ReduceM TCState Source # locallyTCState :: Lens' TCState a -> (a -> a) -> ReduceM b -> ReduceM b Source # withTCState :: (TCState -> TCState) -> ReduceM a -> ReduceM a Source #
ReadTCState NLM Source #
Instance details Defined in Agda.TypeChecking.Rewriting.NonLinMatch Methods getTCState :: NLM TCState Source # locallyTCState :: Lens' TCState a -> (a -> a) -> NLM b -> NLM b Source # withTCState :: (TCState -> TCState) -> NLM a -> NLM a Source #
ReadTCState m => ReadTCState (PureConversionT m) Source #
Instance details Defined in Agda.TypeChecking.Conversion.Pure Methods getTCState :: PureConversionT m TCState Source # locallyTCState :: Lens' TCState a -> (a -> a) -> PureConversionT m b -> PureConversionT m b Source # withTCState :: (TCState -> TCState) -> PureConversionT m a -> PureConversionT m a Source #
ReadTCState m => ReadTCState (BlockT m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods getTCState :: BlockT m TCState Source # locallyTCState :: Lens' TCState a -> (a -> a) -> BlockT m b -> BlockT m b Source # withTCState :: (TCState -> TCState) -> BlockT m a -> BlockT m a Source #
MonadIO m => ReadTCState (TCMT m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods getTCState :: TCMT m TCState Source # locallyTCState :: Lens' TCState a -> (a -> a) -> TCMT m b -> TCMT m b Source # withTCState :: (TCState -> TCState) -> TCMT m a -> TCMT m a Source #
ReadTCState m => ReadTCState (NamesT m) Source #
Instance details Defined in Agda.TypeChecking.Names Methods getTCState :: NamesT m TCState Source # locallyTCState :: Lens' TCState a -> (a -> a) -> NamesT m b -> NamesT m b Source # withTCState :: (TCState -> TCState) -> NamesT m a -> NamesT m a Source #
ReadTCState m => ReadTCState (ListT m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods getTCState :: ListT m TCState Source # locallyTCState :: Lens' TCState a -> (a -> a) -> ListT m b -> ListT m b Source # withTCState :: (TCState -> TCState) -> ListT m a -> ListT m a Source #
ReadTCState m => ReadTCState (ChangeT m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods getTCState :: ChangeT m TCState Source # locallyTCState :: Lens' TCState a -> (a -> a) -> ChangeT m b -> ChangeT m b Source # withTCState :: (TCState -> TCState) -> ChangeT m a -> ChangeT m a Source #
ReadTCState m => ReadTCState (MaybeT m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods getTCState :: MaybeT m TCState Source # locallyTCState :: Lens' TCState a -> (a -> a) -> MaybeT m b -> MaybeT m b Source # withTCState :: (TCState -> TCState) -> MaybeT m a -> MaybeT m a Source #
ReadTCState m => ReadTCState (ExceptT err m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods getTCState :: ExceptT err m TCState Source # locallyTCState :: Lens' TCState a -> (a -> a) -> ExceptT err m b -> ExceptT err m b Source # withTCState :: (TCState -> TCState) -> ExceptT err m a -> ExceptT err m a Source #
ReadTCState m => ReadTCState (IdentityT m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods getTCState :: IdentityT m TCState Source # locallyTCState :: Lens' TCState a -> (a -> a) -> IdentityT m b -> IdentityT m b Source # withTCState :: (TCState -> TCState) -> IdentityT m a -> IdentityT m a Source #
ReadTCState m => ReadTCState (ReaderT r m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods getTCState :: ReaderT r m TCState Source # locallyTCState :: Lens' TCState a -> (a -> a) -> ReaderT r m b -> ReaderT r m b Source # withTCState :: (TCState -> TCState) -> ReaderT r m a -> ReaderT r m a Source #
ReadTCState m => ReadTCState (StateT s m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods getTCState :: StateT s m TCState Source # locallyTCState :: Lens' TCState a -> (a -> a) -> StateT s m b -> StateT s m b Source # withTCState :: (TCState -> TCState) -> StateT s m a -> StateT s m a Source #
(Monoid w, ReadTCState m) => ReadTCState (WriterT w m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods getTCState :: WriterT w m TCState Source # locallyTCState :: Lens' TCState a -> (a -> a) -> WriterT w m b -> WriterT w m b Source # withTCState :: (TCState -> TCState) -> WriterT w m a -> WriterT w m a Source #

mapTCMT :: (forall a1. m a1 -> n a1) -> TCMT m a -> TCMT n a Source #

data LHSOrPatSyn Source #

Distinguish error message when parsing lhs or pattern synonym, resp.

Constructors

IsLHS
IsPatSyn

Instances

Instances details

Generic LHSOrPatSyn Source #

Instance details

Associated Types

type Rep LHSOrPatSyn
Instance details Defined in Agda.TypeChecking.Monad.Base type Rep LHSOrPatSyn = D1 ('MetaData "LHSOrPatSyn" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "IsLHS" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "IsPatSyn" 'PrefixI 'False) (U1 :: Type -> Type))

Methods

from :: LHSOrPatSyn -> Rep LHSOrPatSyn x #

to :: Rep LHSOrPatSyn x -> LHSOrPatSyn #

Show LHSOrPatSyn Source #

Instance details

Methods

showsPrec :: Int -> LHSOrPatSyn -> ShowS #

show :: LHSOrPatSyn -> String #

showList :: [LHSOrPatSyn] -> ShowS #

NFData LHSOrPatSyn Source #

Instance details

Methods

rnf :: LHSOrPatSyn -> () #

Eq LHSOrPatSyn Source #

Instance details

Methods

(==) :: LHSOrPatSyn -> LHSOrPatSyn -> Bool #

(/=) :: LHSOrPatSyn -> LHSOrPatSyn -> Bool #

type Rep LHSOrPatSyn Source #

Instance details

type Rep LHSOrPatSyn = D1 ('MetaData "LHSOrPatSyn" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "IsLHS" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "IsPatSyn" 'PrefixI 'False) (U1 :: Type -> Type))

data Call Source #

Constructors

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
CheckConArgFitsIn QName Bool Type Sort
CheckFunDefCall Range QName [Clause] Bool	Highlight (interactively) if and only if the boolean is `True`.
CheckPragma Range Pragma
CheckPrimitive Range QName Expr
CheckIsEmpty Range Type
CheckConfluence QName QName
CheckModuleParameters ModuleName Telescope
CheckWithFunctionType Type
CheckSectionApplication Range Erased ModuleName ModuleApplication
CheckNamedWhere ModuleName
CheckIApplyConfluence	Checking a clause for confluence with endpoint reductions. Always `φ ⊢ f vs = rhs` for now, but we store the simplifications of `f vs[φ]` and `rhs[φ]`.
Fields Range Clause range QName Function name Term (As-is) Function applied to the patterns in this clause Term (Simplified) Function applied to the patterns in this clause Term (Simplified) clause RHS Type (Simplified) clause type
ScopeCheckExpr Expr
ScopeCheckDeclaration NiceDeclaration
ScopeCheckLHS QName Pattern
NoHighlighting
ModuleContents	Interaction command: show module contents.
SetRange Range	used by `setCurrentRange`

Instances

Instances details

Pretty Call Source #

Instance details

Methods

pretty :: Call -> Doc Source #

prettyPrec :: Int -> Call -> Doc Source #

prettyList :: [Call] -> Doc Source #

HasRange Call Source #

Instance details

Methods

getRange :: Call -> Range Source #

PrettyTCM Call Source #

Instance details

Defined in Agda.TypeChecking.Pretty.Call

Methods

prettyTCM :: MonadPretty m => Call -> m Doc Source #

Generic Call Source #

Instance details

Associated Types

type Rep Call

Instance details

Methods

from :: Call -> Rep Call x #

to :: Rep Call x -> Call #

NFData Call Source #

Instance details

Methods

rnf :: Call -> () #

type Rep Call Source #

Instance details

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

dfPatternVars :: Nat
Number n of pattern variables in dfPats.
dfPats :: Elims
Left hand side patterns, the n first free variables are pattern variables, any variables above n are fixed and only match that particular variable. This happens when you have display forms inside parameterised modules that match on the module parameters. The ArgInfo is ignored in these patterns.
dfRHS :: DisplayTerm
Right hand side.

Instances

Instances details

Pretty DisplayForm Source #

Instance details

Methods

pretty :: DisplayForm -> Doc Source #

prettyPrec :: Int -> DisplayForm -> Doc Source #

prettyList :: [DisplayForm] -> Doc Source #

NamesIn DisplayForm Source #

Instance details

Methods

namesAndMetasIn' :: Monoid m => (Either QName MetaId -> m) -> DisplayForm -> m Source #

KillRange DisplayForm Source #

Instance details

Methods

killRange :: KillRangeT DisplayForm Source #

Free DisplayForm Source #

Instance details

Methods

freeVars' :: IsVarSet a c => DisplayForm -> FreeM a c Source #

InstantiateFull DisplayForm Source #

Instance details

Defined in Agda.TypeChecking.Reduce

Methods

instantiateFull' :: DisplayForm -> ReduceM DisplayForm Source #

Normalise DisplayForm Source #

Instance details

Defined in Agda.TypeChecking.Reduce

Methods

normalise' :: DisplayForm -> ReduceM DisplayForm Source #

Simplify DisplayForm Source #

Instance details

Defined in Agda.TypeChecking.Reduce

Methods

simplify' :: DisplayForm -> ReduceM DisplayForm

EmbPrj DisplayForm Source #

Instance details

Defined in Agda.TypeChecking.Serialise.Instances.Internal

Methods

icode :: DisplayForm -> S Int32 Source #

icod_ :: DisplayForm -> S Int32 Source #

value :: Int32 -> R DisplayForm Source #

Subst DisplayForm Source #

Instance details

Associated Types

type SubstArg DisplayForm
Instance details Defined in Agda.TypeChecking.Substitute type SubstArg DisplayForm = Term

Methods

applySubst :: Substitution' (SubstArg DisplayForm) -> DisplayForm -> DisplayForm Source #

Generic DisplayForm Source #

Instance details

Associated Types

type Rep DisplayForm

Instance details

type Rep DisplayForm = D1 ('MetaData "DisplayForm" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "Display" 'PrefixI 'True) (S1 ('MetaSel ('Just "dfPatternVars") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Nat) :*: (S1 ('MetaSel ('Just "dfPats") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Elims) :*: S1 ('MetaSel ('Just "dfRHS") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 DisplayTerm))))

Methods

from :: DisplayForm -> Rep DisplayForm x #

to :: Rep DisplayForm x -> DisplayForm #

Show DisplayForm Source #

Instance details

Methods

showsPrec :: Int -> DisplayForm -> ShowS #

show :: DisplayForm -> String #

showList :: [DisplayForm] -> ShowS #

NFData DisplayForm Source #

Instance details

Methods

rnf :: DisplayForm -> () #

type SubstArg DisplayForm Source #

Instance details

type SubstArg DisplayForm = Term

type Rep DisplayForm Source #

Instance details

CompilerPragma Range String

type Rep DisplayForm = D1 ('MetaData "DisplayForm" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "Display" 'PrefixI 'True) (S1 ('MetaSel ('Just "dfPatternVars") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Nat) :*: (S1 ('MetaSel ('Just "dfPats") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Elims) :*: S1 ('MetaSel ('Just "dfRHS") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 DisplayTerm))))

class (Applicative m, MonadTCEnv m, ReadTCState m, HasOptions m) => MonadReduce (m :: Type -> Type) where Source #

Minimal complete definition

Nothing

Methods

liftReduce :: ReduceM a -> m a Source #

default liftReduce :: forall (t :: (Type -> Type) -> Type -> Type) (n :: Type -> Type) a. (MonadTrans t, MonadReduce n, t n ~ m) => ReduceM a -> m a Source #

Instances

Instances details

MonadReduce AbsToCon Source #
Instance details Defined in Agda.Syntax.Translation.AbstractToConcrete Methods liftReduce :: ReduceM a -> AbsToCon a Source #
MonadReduce TerM Source #
Instance details Defined in Agda.Termination.Monad Methods liftReduce :: ReduceM a -> TerM a Source #
MonadReduce ReduceM Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods liftReduce :: ReduceM a -> ReduceM a Source #
MonadReduce NLM Source #
Instance details Defined in Agda.TypeChecking.Rewriting.NonLinMatch Methods liftReduce :: ReduceM a -> NLM a Source #
MonadReduce m => MonadReduce (PureConversionT m) Source #
Instance details Defined in Agda.TypeChecking.Conversion.Pure Methods liftReduce :: ReduceM a -> PureConversionT m a Source #
MonadReduce m => MonadReduce (BlockT m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods liftReduce :: ReduceM a -> BlockT m a Source #
MonadIO m => MonadReduce (TCMT m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods liftReduce :: ReduceM a -> TCMT m a Source #
MonadReduce m => MonadReduce (NamesT m) Source #
Instance details Defined in Agda.TypeChecking.Names Methods liftReduce :: ReduceM a -> NamesT m a Source #
MonadReduce m => MonadReduce (ListT m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods liftReduce :: ReduceM a -> ListT m a Source #
MonadReduce m => MonadReduce (ChangeT m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods liftReduce :: ReduceM a -> ChangeT m a Source #
MonadReduce m => MonadReduce (MaybeT m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods liftReduce :: ReduceM a -> MaybeT m a Source #
MonadReduce m => MonadReduce (ExceptT err m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods liftReduce :: ReduceM a -> ExceptT err m a Source #
MonadReduce m => MonadReduce (IdentityT m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods liftReduce :: ReduceM a -> IdentityT m a Source #
MonadReduce m => MonadReduce (ReaderT r m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods liftReduce :: ReduceM a -> ReaderT r m a Source #
MonadReduce m => MonadReduce (StateT w m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods liftReduce :: ReduceM a -> StateT w m a Source #
(Monoid w, MonadReduce m) => MonadReduce (WriterT w m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods liftReduce :: ReduceM a -> WriterT w m a Source #

type Statistics = Map String Integer Source #

askR :: ReduceM ReduceEnv Source #

defAbstract :: Definition -> IsAbstract Source #

data CompilerPragma Source #

The backends are responsible for parsing their own pragmas.

Constructors

Instances

Instances details

HasRange CompilerPragma Source #

Instance details

KillRange CompiledRepresentation Source #

Methods

getRange :: CompilerPragma -> Range Source #

Instance details

Methods

killRange :: KillRangeT CompiledRepresentation Source #

EmbPrj CompilerPragma Source #

Instance details

Defined in Agda.TypeChecking.Serialise.Instances.Compilers

Methods

icode :: CompilerPragma -> S Int32 Source #

icod_ :: CompilerPragma -> S Int32 Source #

value :: Int32 -> R CompilerPragma Source #

Generic CompilerPragma Source #

Instance details

Associated Types

type Rep CompilerPragma

Instance details

type Rep CompilerPragma = D1 ('MetaData "CompilerPragma" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "CompilerPragma" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Range) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String)))

Methods

from :: CompilerPragma -> Rep CompilerPragma x #

to :: Rep CompilerPragma x -> CompilerPragma #

Show CompilerPragma Source #

Instance details

Methods

showsPrec :: Int -> CompilerPragma -> ShowS #

show :: CompilerPragma -> String #

showList :: [CompilerPragma] -> ShowS #

NFData CompilerPragma Source #

Instance details

Methods

rnf :: CompilerPragma -> () #

Eq CompilerPragma Source #

Instance details

Methods

(==) :: CompilerPragma -> CompilerPragma -> Bool #

(/=) :: CompilerPragma -> CompilerPragma -> Bool #

type Rep CompilerPragma Source #

Instance details

type Rep CompilerPragma = D1 ('MetaData "CompilerPragma" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "CompilerPragma" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Range) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String)))

data Definition Source #

Constructors

Defn

Fields

defArgInfo :: ArgInfo
Hiding should not be used.
defName :: QName
The canonical name, used e.g. in compilation.
defType :: Type
Type of the lifted definition.
defPolarity :: [Polarity]
Variance information on arguments of the definition. Does not include info for dropped parameters to projection(-like) functions and constructors.
defArgOccurrences :: [Occurrence]
Positivity information on arguments of the definition. Does not include info for dropped parameters to projection(-like) functions and constructors.
defArgGeneralizable :: NumGeneralizableArgs
For a generalized variable, shows how many arguments should be generalised.
defGeneralizedParams :: [Maybe Name]
Gives the name of the (bound variable) parameter for named generalized parameters. This is needed to bring it into scope when type checking the data/record definition corresponding to a type with generalized parameters.
defDisplay :: [LocalDisplayForm]
defMutual :: MutualId
defCompiledRep :: CompiledRepresentation
defInstance :: Maybe QName
Just q when this definition is an instance of class q
defCopy :: Bool
Has this function been created by a module instantiation?
defMatchable :: Set QName
The set of symbols with rewrite rules that match against this symbol
defNoCompilation :: Bool
should compilers skip this? Used for e.g. cubical's comp
defInjective :: Bool
Should the def be treated as injective by the pattern matching unifier?
defCopatternLHS :: Bool
Is this a function defined by copatterns?
defBlocked :: Blocked_
What blocking tag to use when we cannot reduce this def? Used when checking a function definition is blocked on a meta in the type.
defLanguage :: !Language
The language used for the definition.
theDef :: Defn

Instances

Instances details

LensArgInfo Definition Source #

Instance details

Methods

getArgInfo :: Definition -> ArgInfo Source #

setArgInfo :: ArgInfo -> Definition -> Definition Source #

mapArgInfo :: (ArgInfo -> ArgInfo) -> Definition -> Definition Source #

LensModality Definition Source #

Instance details

Methods

getModality :: Definition -> Modality Source #

setModality :: Modality -> Definition -> Definition Source #

mapModality :: (Modality -> Modality) -> Definition -> Definition Source #

LensQuantity Definition Source #

Instance details

Methods

getQuantity :: Definition -> Quantity Source #

setQuantity :: Quantity -> Definition -> Definition Source #

mapQuantity :: (Quantity -> Quantity) -> Definition -> Definition Source #

LensRelevance Definition Source #

Instance details

Methods

getRelevance :: Definition -> Relevance Source #

setRelevance :: Relevance -> Definition -> Definition Source #

mapRelevance :: (Relevance -> Relevance) -> Definition -> Definition Source #

Pretty Definition Source #

Instance details

Methods

pretty :: Definition -> Doc Source #

prettyPrec :: Int -> Definition -> Doc Source #

prettyList :: [Definition] -> Doc Source #

NamesIn Definition Source #

Instance details

Methods

namesAndMetasIn' :: Monoid m => (Either QName MetaId -> m) -> Definition -> m Source #

KillRange Definition Source #

Instance details

Methods

killRange :: KillRangeT Definition Source #

KillRange Definitions Source #

Instance details

Methods

killRange :: KillRangeT Definitions Source #

InstantiateFull Definition Source #

Instance details

Defined in Agda.TypeChecking.Reduce

Methods

instantiateFull' :: Definition -> ReduceM Definition Source #

EmbPrj Definition Source #

Instance details

Defined in Agda.TypeChecking.Serialise.Instances.Internal

Methods

icode :: Definition -> S Int32 Source #

icod_ :: Definition -> S Int32 Source #

value :: Int32 -> R Definition Source #

Abstract Definition Source #

Instance details

Methods

abstract :: Telescope -> Definition -> Definition Source #

Apply Definition Source #

Instance details

Methods

apply :: Definition -> Args -> Definition Source #

applyE :: Definition -> Elims -> Definition Source #

Generic Definition Source #

Instance details

Associated Types

type Rep Definition

Instance details

Methods

from :: Definition -> Rep Definition x #

to :: Rep Definition x -> Definition #

Show Definition Source #

Instance details

Methods

showsPrec :: Int -> Definition -> ShowS #

show :: Definition -> String #

showList :: [Definition] -> ShowS #

NFData Definition Source #

Instance details

Methods

rnf :: Definition -> () #

type Rep Definition Source #

Instance details

data Interface Source #

Constructors

Interface

Fields

iSourceHash :: Hash
Hash of the source code.
iSource :: Text
The source code. The source code is stored so that the HTML and LaTeX backends can generate their output without having to re-read the (possibly out of date) source code.
iFileType :: FileType
Source file type, determined from the file extension
iImportedModules :: [(TopLevelModuleName, Hash)]
Imported modules and their hashes.
iModuleName :: ModuleName
Module name of this interface.
iTopLevelModuleName :: TopLevelModuleName
The module's top-level module name.
iScope :: Map ModuleName Scope
Scope defined by this module.
Andreas, AIM XX: Too avoid duplicate serialization, this field is not serialized, so if you deserialize an interface, iScope will be empty. But constructIScope constructs iScope from iInsideScope.
iInsideScope :: ScopeInfo
Scope after we loaded this interface. Used in AtTopLevel and interactionLoop.
iSignature :: Signature
iMetaBindings :: RemoteMetaStore
Instantiations for meta-variables that come from this module.
iDisplayForms :: DisplayForms
Display forms added for imported identifiers.
iUserWarnings :: Map QName Text
User warnings for imported identifiers
iImportWarning :: Maybe Text
Whether this module should raise a warning when imported
iBuiltin :: BuiltinThings (PrimitiveId, QName)
iForeignCode :: Map BackendName ForeignCodeStack
iHighlighting :: HighlightingInfo
iDefaultPragmaOptions :: [OptionsPragma]
Pragma options set in library files.
iFilePragmaOptions :: [OptionsPragma]
Pragma options set in the file.
iOptionsUsed :: PragmaOptions
Options/features used when checking the file (can be different from options set directly in the file).
iPatternSyns :: PatternSynDefns
iWarnings :: [TCWarning]
iPartialDefs :: Set QName
iOpaqueBlocks :: Map OpaqueId OpaqueBlock
iOpaqueNames :: Map QName OpaqueId

Instances

Instances details

Pretty Interface Source #

Instance details

Methods

pretty :: Interface -> Doc Source #

prettyPrec :: Int -> Interface -> Doc Source #

prettyList :: [Interface] -> Doc Source #

InstantiateFull Interface Source #

Instance details

Defined in Agda.TypeChecking.Reduce

Methods

instantiateFull' :: Interface -> ReduceM Interface Source #

EmbPrj Interface Source #

Instance details

Defined in Agda.TypeChecking.Serialise.Instances

Methods

icode :: Interface -> S Int32 Source #

icod_ :: Interface -> S Int32 Source #

value :: Int32 -> R Interface Source #

Generic Interface Source #

Instance details

Associated Types

type Rep Interface

Instance details

Methods

from :: Interface -> Rep Interface x #

to :: Rep Interface x -> Interface #

Show Interface Source #

Instance details

Methods

showsPrec :: Int -> Interface -> ShowS #

show :: Interface -> String #

showList :: [Interface] -> ShowS #

NFData Interface Source #

Instance details

Methods

rnf :: Interface -> () #

type Rep Interface Source #

Instance details

LensCommandLineOptions TCState Source #

type MonadTCError (m :: Type -> Type) = (MonadTCEnv m, ReadTCState m, MonadError TCErr m) Source #

The constraints needed for typeError and similar.

genericError :: (HasCallStack, MonadTCError m) => String -> m a Source #

stModuleToSource :: Lens' TCState ModuleToSource Source #

useTC :: ReadTCState m => Lens' TCState a -> m a Source #

type BackendName = String Source #

data TCState Source #

Constructors

TCSt
Fields stPreScopeState :: !PreScopeState The state which is frozen after scope checking. stPostScopeState :: !PostScopeState The state which is modified after scope checking. stPersistentState :: !PersistentTCState State which is forever, like a diamond.

Instances

Instances details

Instance details

Methods

getCommandLineOptions :: TCState -> CommandLineOptions Source #

setCommandLineOptions :: CommandLineOptions -> TCState -> TCState Source #

mapCommandLineOptions :: (CommandLineOptions -> CommandLineOptions) -> TCState -> TCState Source #

LensIncludePaths TCState Source #

Instance details

LensPersistentVerbosity TCState Source #

Methods

getIncludePaths :: TCState -> [FilePath] Source #

setIncludePaths :: [FilePath] -> TCState -> TCState Source #

mapIncludePaths :: ([FilePath] -> [FilePath]) -> TCState -> TCState Source #

getAbsoluteIncludePaths :: TCState -> [AbsolutePath] Source #

setAbsoluteIncludePaths :: [AbsolutePath] -> TCState -> TCState Source #

mapAbsoluteIncludePaths :: ([AbsolutePath] -> [AbsolutePath]) -> TCState -> TCState Source #

Instance details

Methods

getPersistentVerbosity :: TCState -> PersistentVerbosity Source #

setPersistentVerbosity :: PersistentVerbosity -> TCState -> TCState Source #

mapPersistentVerbosity :: (PersistentVerbosity -> PersistentVerbosity) -> TCState -> TCState Source #

LensPragmaOptions TCState Source #

Instance details

Methods

getPragmaOptions :: TCState -> PragmaOptions Source #

setPragmaOptions :: PragmaOptions -> TCState -> TCState Source #

mapPragmaOptions :: (PragmaOptions -> PragmaOptions) -> TCState -> TCState Source #

lensPragmaOptions :: Lens' TCState PragmaOptions Source #

LensSafeMode TCState Source #

Instance details

Methods

getSafeMode :: TCState -> SafeMode Source #

setSafeMode :: SafeMode -> TCState -> TCState Source #

mapSafeMode :: (SafeMode -> SafeMode) -> TCState -> TCState Source #

LensVerbosity TCState Source #

Instance details

Methods

getVerbosity :: TCState -> Verbosity Source #

setVerbosity :: Verbosity -> TCState -> TCState Source #

mapVerbosity :: (Verbosity -> Verbosity) -> TCState -> TCState Source #

Generic TCState Source #

Instance details

Associated Types

type Rep TCState

Instance details

type Rep TCState = D1 ('MetaData "TCState" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "TCSt" 'PrefixI 'True) (S1 ('MetaSel ('Just "stPreScopeState") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 PreScopeState) :*: (S1 ('MetaSel ('Just "stPostScopeState") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 PostScopeState) :*: S1 ('MetaSel ('Just "stPersistentState") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 PersistentTCState))))

Methods

from :: TCState -> Rep TCState x #

to :: Rep TCState x -> TCState #

Show TCState Source #

Instance details

Methods

showsPrec :: Int -> TCState -> ShowS #

show :: TCState -> String #

showList :: [TCState] -> ShowS #

NFData TCState Source #

Instance details

Methods

rnf :: TCState -> () #

type Rep TCState Source #

Instance details

type Rep TCState = D1 ('MetaData "TCState" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "TCSt" 'PrefixI 'True) (S1 ('MetaSel ('Just "stPreScopeState") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 PreScopeState) :*: (S1 ('MetaSel ('Just "stPostScopeState") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 PostScopeState) :*: S1 ('MetaSel ('Just "stPersistentState") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 PersistentTCState))))

type RewriteRules = [RewriteRule] Source #

data PrimFun Source #

Constructors

PrimFun
Fields primFunName :: QName primFunArity :: Arity primFunArgOccurrences :: [Occurrence] See `defArgOccurrences`. primFunImplementation :: [Arg Term] -> Int -> ReduceM (Reduced MaybeReducedArgs Term)

Instances

Instances details

NamesIn PrimFun Source #

Note that the primFunImplementation is skipped.

Instance details

Methods

namesAndMetasIn' :: Monoid m => (Either QName MetaId -> m) -> PrimFun -> m Source #

Abstract PrimFun Source #

Instance details

Methods

abstract :: Telescope -> PrimFun -> PrimFun Source #

Apply PrimFun Source #

Instance details

Methods

apply :: PrimFun -> Args -> PrimFun Source #

applyE :: PrimFun -> Elims -> PrimFun Source #

Generic PrimFun Source #

Instance details

Associated Types

type Rep PrimFun

Instance details

type Rep PrimFun = D1 ('MetaData "PrimFun" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-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 "primFunArgOccurrences") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Occurrence]) :*: S1 ('MetaSel ('Just "primFunImplementation") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ([Arg Term] -> Int -> ReduceM (Reduced MaybeReducedArgs Term))))))

Methods

from :: PrimFun -> Rep PrimFun x #

to :: Rep PrimFun x -> PrimFun #

NFData PrimFun Source #

Instance details

Methods

rnf :: PrimFun -> () #

type Rep PrimFun Source #

Instance details

type Rep PrimFun = D1 ('MetaData "PrimFun" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-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 "primFunArgOccurrences") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Occurrence]) :*: S1 ('MetaSel ('Just "primFunImplementation") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ([Arg Term] -> Int -> ReduceM (Reduced MaybeReducedArgs Term))))))

data RunMetaOccursCheck Source #

Constructors

RunMetaOccursCheck
DontRunMetaOccursCheck

Instances

Instances details

Generic RunMetaOccursCheck Source #

Instance details

Associated Types

type Rep RunMetaOccursCheck
Instance details Defined in Agda.TypeChecking.Monad.Base type Rep RunMetaOccursCheck = D1 ('MetaData "RunMetaOccursCheck" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "RunMetaOccursCheck" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "DontRunMetaOccursCheck" 'PrefixI 'False) (U1 :: Type -> Type))

Methods

from :: RunMetaOccursCheck -> Rep RunMetaOccursCheck x #

to :: Rep RunMetaOccursCheck x -> RunMetaOccursCheck #

Show RunMetaOccursCheck Source #

Instance details

Methods

showsPrec :: Int -> RunMetaOccursCheck -> ShowS #

show :: RunMetaOccursCheck -> String #

showList :: [RunMetaOccursCheck] -> ShowS #

NFData RunMetaOccursCheck Source #

Instance details

Methods

rnf :: RunMetaOccursCheck -> () #

Eq RunMetaOccursCheck Source #

Instance details

Methods

(==) :: RunMetaOccursCheck -> RunMetaOccursCheck -> Bool #

(/=) :: RunMetaOccursCheck -> RunMetaOccursCheck -> Bool #

Ord RunMetaOccursCheck Source #

Instance details

Methods

compare :: RunMetaOccursCheck -> RunMetaOccursCheck -> Ordering #

(<) :: RunMetaOccursCheck -> RunMetaOccursCheck -> Bool #

(<=) :: RunMetaOccursCheck -> RunMetaOccursCheck -> Bool #

(>) :: RunMetaOccursCheck -> RunMetaOccursCheck -> Bool #

(>=) :: RunMetaOccursCheck -> RunMetaOccursCheck -> Bool #

max :: RunMetaOccursCheck -> RunMetaOccursCheck -> RunMetaOccursCheck #

min :: RunMetaOccursCheck -> RunMetaOccursCheck -> RunMetaOccursCheck #

type Rep RunMetaOccursCheck Source #

Instance details

type Rep RunMetaOccursCheck = D1 ('MetaData "RunMetaOccursCheck" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "RunMetaOccursCheck" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "DontRunMetaOccursCheck" 'PrefixI 'False) (U1 :: Type -> Type))

data CompareAs Source #

We can either compare two terms at a given type, or compare two types without knowing (or caring about) their sorts.

Constructors

AsTermsOf Type	`Type` should not be `Size`. But currently, we do not rely on this invariant.
AsSizes	Replaces `AsTermsOf Size`.
AsTypes

Instances

Instances details

Pretty CompareAs Source #

Instance details

Methods

pretty :: CompareAs -> Doc Source #

prettyPrec :: Int -> CompareAs -> Doc Source #

prettyList :: [CompareAs] -> Doc Source #

TermLike CompareAs Source #

Instance details

Methods

traverseTermM :: Monad m => (Term -> m Term) -> CompareAs -> m CompareAs Source #

foldTerm :: Monoid m => (Term -> m) -> CompareAs -> m Source #

AllMetas CompareAs Source #

Instance details

Methods

allMetas :: Monoid m => (MetaId -> m) -> CompareAs -> m Source #

Free CompareAs Source #

Instance details

Methods

freeVars' :: IsVarSet a c => CompareAs -> FreeM a c Source #

MentionsMeta CompareAs Source #

Instance details

Methods

mentionsMetas :: HashSet MetaId -> CompareAs -> Bool Source #

IsSizeType CompareAs Source #

Instance details

Defined in Agda.TypeChecking.Monad.SizedTypes

Methods

isSizeType :: (HasOptions m, HasBuiltins m) => CompareAs -> m (Maybe BoundedSize) Source #

PrettyTCM CompareAs Source #

Instance details

Defined in Agda.TypeChecking.Pretty

Methods

prettyTCM :: MonadPretty m => CompareAs -> m Doc Source #

Instantiate CompareAs Source #

Instance details

Defined in Agda.TypeChecking.Reduce

Methods

instantiate' :: CompareAs -> ReduceM CompareAs Source #

InstantiateFull CompareAs Source #

Instance details

Defined in Agda.TypeChecking.Reduce

Methods

instantiateFull' :: CompareAs -> ReduceM CompareAs Source #

IsMeta CompareAs Source #

Instance details

Defined in Agda.TypeChecking.Reduce

Methods

isMeta :: CompareAs -> Maybe MetaId Source #

Normalise CompareAs Source #

Instance details

Defined in Agda.TypeChecking.Reduce

Methods

normalise' :: CompareAs -> ReduceM CompareAs Source #

Reduce CompareAs Source #

Instance details

Defined in Agda.TypeChecking.Reduce

Methods

reduce' :: CompareAs -> ReduceM CompareAs Source #

reduceB' :: CompareAs -> ReduceM (Blocked CompareAs) Source #

Simplify CompareAs Source #

Instance details

Defined in Agda.TypeChecking.Reduce

Methods

simplify' :: CompareAs -> ReduceM CompareAs

Subst CompareAs Source #

Instance details

Associated Types

type SubstArg CompareAs
Instance details Defined in Agda.TypeChecking.Substitute type SubstArg CompareAs = Term

Methods

applySubst :: Substitution' (SubstArg CompareAs) -> CompareAs -> CompareAs Source #

Generic CompareAs Source #

Instance details

Associated Types

type Rep CompareAs

Instance details

type Rep CompareAs = D1 ('MetaData "CompareAs" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "AsTermsOf" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type)) :+: (C1 ('MetaCons "AsSizes" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "AsTypes" 'PrefixI 'False) (U1 :: Type -> Type)))

Methods

from :: CompareAs -> Rep CompareAs x #

to :: Rep CompareAs x -> CompareAs #

Show CompareAs Source #

Instance details

Methods

showsPrec :: Int -> CompareAs -> ShowS #

show :: CompareAs -> String #

showList :: [CompareAs] -> ShowS #

NFData CompareAs Source #

Instance details

Methods

rnf :: CompareAs -> () #

type SubstArg CompareAs Source #

Instance details

type SubstArg CompareAs = Term

type Rep CompareAs Source #

Instance details

type Rep CompareAs = D1 ('MetaData "CompareAs" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "AsTermsOf" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type)) :+: (C1 ('MetaCons "AsSizes" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "AsTypes" 'PrefixI 'False) (U1 :: Type -> Type)))

data CompareDirection Source #

An extension of Comparison to >=.

Constructors

DirEq
DirLeq
DirGeq

Instances

Instances details

Pretty CompareDirection Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods pretty :: CompareDirection -> Doc Source # prettyPrec :: Int -> CompareDirection -> Doc Source # prettyList :: [CompareDirection] -> Doc Source #
Show CompareDirection Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods showsPrec :: Int -> CompareDirection -> ShowS # show :: CompareDirection -> String # showList :: [CompareDirection] -> ShowS #
Eq CompareDirection Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods (==) :: CompareDirection -> CompareDirection -> Bool # (/=) :: CompareDirection -> CompareDirection -> Bool #

class Monad m => MonadBlock (m :: Type -> Type) where Source #

Minimal complete definition

catchPatternErr

Methods

patternViolation :: Blocker -> m a Source #

`patternViolation b` aborts the current computation

default patternViolation :: forall (t :: (Type -> Type) -> Type -> Type) (n :: Type -> Type) a. (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

Instances details

MonadBlock TCM Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods patternViolation :: Blocker -> TCM a Source # catchPatternErr :: (Blocker -> TCM a) -> TCM a -> TCM a Source #
MonadBlock NLM Source #
Instance details Defined in Agda.TypeChecking.Rewriting.NonLinMatch Methods patternViolation :: Blocker -> NLM a Source # catchPatternErr :: (Blocker -> NLM a) -> NLM a -> NLM a Source #
Monad m => MonadBlock (PureConversionT m) Source #
Instance details Defined in Agda.TypeChecking.Conversion.Pure Methods patternViolation :: Blocker -> PureConversionT m a Source # catchPatternErr :: (Blocker -> PureConversionT m a) -> PureConversionT m a -> PureConversionT m a Source #
Monad m => MonadBlock (BlockT m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods patternViolation :: Blocker -> BlockT m a Source # catchPatternErr :: (Blocker -> BlockT m a) -> BlockT m a -> BlockT m a Source #
MonadBlock m => MonadBlock (MaybeT m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods patternViolation :: Blocker -> MaybeT m a Source # catchPatternErr :: (Blocker -> MaybeT m a) -> MaybeT m a -> MaybeT m a Source #
Monad m => MonadBlock (ExceptT TCErr m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods patternViolation :: Blocker -> ExceptT TCErr m a Source # catchPatternErr :: (Blocker -> ExceptT TCErr m a) -> ExceptT TCErr m a -> ExceptT TCErr m a Source #
MonadBlock m => MonadBlock (ReaderT e m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods patternViolation :: Blocker -> ReaderT e m a Source # catchPatternErr :: (Blocker -> ReaderT e m a) -> ReaderT e m a -> ReaderT e m a Source #

data Reduced no yes Source #

Constructors

NoReduction no
YesReduction Simplification yes

Instances

Instances details

Functor (Reduced no) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods fmap :: (a -> b) -> Reduced no a -> Reduced no b # (<$) :: a -> Reduced no b -> Reduced no a #

data IsReduced Source #

Three cases: 1. not reduced, 2. reduced, but blocked, 3. reduced, not blocked.

Constructors

NotReduced
Reduced (Blocked ())

data ProblemConstraint Source #

Constructors

PConstr
Fields constraintProblems :: Set ProblemId constraintUnblocker :: Blocker theConstraint :: Closure Constraint

Instances

Instances details

HasRange ProblemConstraint Source #

Instance details

MentionsMeta ProblemConstraint Source #

Methods

getRange :: ProblemConstraint -> Range Source #

Reify ProblemConstraint Source #

Instance details

Defined in Agda.Interaction.BasicOps

Associated Types

type ReifiesTo ProblemConstraint
Instance details Defined in Agda.Interaction.BasicOps type ReifiesTo ProblemConstraint = Closure (OutputForm Expr Expr)

Methods

reify :: MonadReify m => ProblemConstraint -> m (ReifiesTo ProblemConstraint) Source #

reifyWhen :: MonadReify m => Bool -> ProblemConstraint -> m (ReifiesTo ProblemConstraint) Source #

Instance details

InstantiateFull ProblemConstraint Source #

Methods

mentionsMetas :: HashSet MetaId -> ProblemConstraint -> Bool Source #

PrettyTCM ProblemConstraint Source #

Instance details

Defined in Agda.TypeChecking.Pretty.Constraint

Methods

prettyTCM :: MonadPretty m => ProblemConstraint -> m Doc Source #

Instance details

Defined in Agda.TypeChecking.Reduce

Methods

instantiateFull' :: ProblemConstraint -> ReduceM ProblemConstraint Source #

Normalise ProblemConstraint Source #

Instance details

Defined in Agda.TypeChecking.Reduce

Methods

normalise' :: ProblemConstraint -> ReduceM ProblemConstraint Source #

Simplify ProblemConstraint Source #

Instance details

Defined in Agda.TypeChecking.Reduce

Methods

simplify' :: ProblemConstraint -> ReduceM ProblemConstraint

Generic ProblemConstraint Source #

Instance details

Associated Types

type Rep ProblemConstraint

Instance details

type Rep ProblemConstraint = D1 ('MetaData "ProblemConstraint" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "PConstr" 'PrefixI 'True) (S1 ('MetaSel ('Just "constraintProblems") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Set ProblemId)) :*: (S1 ('MetaSel ('Just "constraintUnblocker") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Blocker) :*: S1 ('MetaSel ('Just "theConstraint") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Closure Constraint)))))

Methods

from :: ProblemConstraint -> Rep ProblemConstraint x #

to :: Rep ProblemConstraint x -> ProblemConstraint #

Show ProblemConstraint Source #

Instance details

Methods

showsPrec :: Int -> ProblemConstraint -> ShowS #

show :: ProblemConstraint -> String #

showList :: [ProblemConstraint] -> ShowS #

NFData ProblemConstraint Source #

Instance details

Methods

rnf :: ProblemConstraint -> () #

type ReifiesTo ProblemConstraint Source #

Instance details

Defined in Agda.Interaction.BasicOps

type ReifiesTo ProblemConstraint = Closure (OutputForm Expr Expr)

type Rep ProblemConstraint Source #

Instance details

type Rep ProblemConstraint = D1 ('MetaData "ProblemConstraint" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "PConstr" 'PrefixI 'True) (S1 ('MetaSel ('Just "constraintProblems") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Set ProblemId)) :*: (S1 ('MetaSel ('Just "constraintUnblocker") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Blocker) :*: S1 ('MetaSel ('Just "theConstraint") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Closure Constraint)))))

data NLPat Source #

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 `f es`
PLam ArgInfo (Abs NLPat)	Matches `λ x → t`
PPi (Dom NLPType) (Abs NLPType)	Matches `(x : A) → B`
PSort NLPSort	Matches a sort of the given shape.
PBoundVar !Int PElims	Matches `x es` where x is a lambda-bound variable
PTerm Term	Matches the term modulo β (ideally βη).

Instances

Instances details

TermLike NLPat Source #

Instance details

Methods

traverseTermM :: Monad m => (Term -> m Term) -> NLPat -> m NLPat Source #

foldTerm :: Monoid m => (Term -> m) -> NLPat -> m Source #

AllMetas NLPat Source #

Instance details

Methods

allMetas :: Monoid m => (MetaId -> m) -> NLPat -> m Source #

NamesIn NLPat Source #

Instance details

Methods

namesAndMetasIn' :: Monoid m => (Either QName MetaId -> m) -> NLPat -> m Source #

KillRange NLPat Source #

Instance details

Methods

killRange :: KillRangeT NLPat Source #

Free NLPat Source #

Only computes free variables that are not bound (see nlPatVars), i.e., those in a PTerm.

Instance details

Defined in Agda.TypeChecking.Rewriting.NonLinPattern

Methods

freeVars' :: IsVarSet a c => NLPat -> FreeM a c Source #

PrettyTCM NLPat Source #

Instance details

Defined in Agda.TypeChecking.Pretty

Methods

prettyTCM :: MonadPretty m => NLPat -> m Doc Source #

InstantiateFull NLPat Source #

Instance details

Defined in Agda.TypeChecking.Reduce

Methods

instantiateFull' :: NLPat -> ReduceM NLPat Source #

GetMatchables NLPat Source #

Instance details

Defined in Agda.TypeChecking.Rewriting.NonLinPattern

Methods

getMatchables :: NLPat -> [QName] Source #

NLPatVars NLPat Source #

Instance details

Defined in Agda.TypeChecking.Rewriting.NonLinPattern

Methods

nlPatVarsUnder :: Int -> NLPat -> IntSet Source #

nlPatVars :: NLPat -> IntSet Source #

EmbPrj NLPat Source #

Instance details

Defined in Agda.TypeChecking.Serialise.Instances.Internal

Methods

icode :: NLPat -> S Int32 Source #

icod_ :: NLPat -> S Int32 Source #

value :: Int32 -> R NLPat Source #

Subst NLPat Source #

Instance details

Associated Types

type SubstArg NLPat
Instance details Defined in Agda.TypeChecking.Substitute type SubstArg NLPat = NLPat

Methods

applySubst :: Substitution' (SubstArg NLPat) -> NLPat -> NLPat Source #

DeBruijn NLPat Source #

Instance details

Methods

deBruijnVar :: Int -> NLPat Source #

debruijnNamedVar :: String -> Int -> NLPat Source #

deBruijnView :: NLPat -> Maybe Int Source #

Generic NLPat Source #

Instance details

Associated Types

type Rep NLPat

Instance details

Methods

from :: NLPat -> Rep NLPat x #

to :: Rep NLPat x -> NLPat #

Show NLPat Source #

Instance details

Methods

showsPrec :: Int -> NLPat -> ShowS #

show :: NLPat -> String #

showList :: [NLPat] -> ShowS #

NFData NLPat Source #

Instance details

Methods

rnf :: NLPat -> () #

Match NLPat Level Source #

Instance details

Methods

match :: Relevance -> Telescope -> Telescope -> TypeOf Level -> NLPat -> Level -> NLM () Source #

Match NLPat Term Source #

Instance details

Methods

match :: Relevance -> Telescope -> Telescope -> TypeOf Term -> NLPat -> Term -> NLM () Source #

NLPatToTerm NLPat Level Source #

Instance details

Defined in Agda.TypeChecking.Rewriting.NonLinPattern

Methods

nlPatToTerm :: PureTCM m => NLPat -> m Level Source #

NLPatToTerm NLPat Term Source #

Instance details

Defined in Agda.TypeChecking.Rewriting.NonLinPattern

Methods

nlPatToTerm :: PureTCM m => NLPat -> m Term Source #

PatternFrom Level NLPat Source #

Instance details

Defined in Agda.TypeChecking.Rewriting.NonLinPattern

Methods

patternFrom :: Relevance -> Int -> TypeOf Level -> Level -> TCM NLPat Source #

PatternFrom Term NLPat Source #

Instance details

Defined in Agda.TypeChecking.Rewriting.NonLinPattern

Methods

patternFrom :: Relevance -> Int -> TypeOf Term -> Term -> TCM NLPat Source #

PatternFrom Elims [Elim' NLPat] Source #

Instance details

Defined in Agda.TypeChecking.Rewriting.NonLinPattern

Methods

patternFrom :: Relevance -> Int -> TypeOf Elims -> Elims -> TCM [Elim' NLPat] Source #

PrettyTCM (Type' NLPat) Source #

Instance details

Defined in Agda.TypeChecking.Pretty

Methods

prettyTCM :: MonadPretty m => Type' NLPat -> m Doc Source #

PrettyTCM (Elim' NLPat) Source #

Instance details

Defined in Agda.TypeChecking.Pretty

Methods

prettyTCM :: MonadPretty m => Elim' NLPat -> m Doc Source #

Match [Elim' NLPat] Elims Source #

Instance details

Methods

match :: Relevance -> Telescope -> Telescope -> TypeOf Elims -> [Elim' NLPat] -> Elims -> NLM () Source #

ToNLPat (Arg DeBruijnPattern) (Elim' NLPat) Source #

Instance details

Defined in Agda.TypeChecking.Rewriting.Clause

Methods

toNLPat :: Arg DeBruijnPattern -> Elim' NLPat Source #

ToNLPat (NamedArg DeBruijnPattern) (Elim' NLPat) Source #

Instance details

Defined in Agda.TypeChecking.Rewriting.Clause

Methods

toNLPat :: NamedArg DeBruijnPattern -> Elim' NLPat Source #

type TypeOf NLPat Source #

Instance details

type TypeOf NLPat = Type

type SubstArg NLPat Source #

Instance details

type SubstArg NLPat = NLPat

type Rep NLPat Source #

Instance details

type TypeOf [Elim' NLPat] Source #

Instance details

type TypeOf [Elim' NLPat] = (Type, Elims -> Term)

class Monad m => MonadFresh i (m :: Type -> Type) where Source #

Minimal complete definition

Nothing

Methods

fresh :: m i Source #

default fresh :: forall (t :: (Type -> Type) -> Type -> Type) (n :: Type -> Type). (MonadTrans t, MonadFresh i n, t n ~ m) => m i Source #

Instances

Instances details

MonadFresh NameId AbsToCon Source #
Instance details Defined in Agda.Syntax.Translation.AbstractToConcrete Methods fresh :: AbsToCon NameId Source #
HasFresh i => MonadFresh i TCM Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods fresh :: TCM i Source #
Monad m => MonadFresh NameId (PureConversionT m) Source #
Instance details Defined in Agda.TypeChecking.Conversion.Pure Methods fresh :: PureConversionT m NameId Source #
Monad m => MonadFresh ProblemId (PureConversionT m) Source #
Instance details Defined in Agda.TypeChecking.Conversion.Pure Methods fresh :: PureConversionT m ProblemId Source #
Monad m => MonadFresh Int (PureConversionT m) Source #
Instance details Defined in Agda.TypeChecking.Conversion.Pure Methods fresh :: PureConversionT m Int Source #
MonadFresh i m => MonadFresh i (ListT m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods fresh :: ListT m i Source #
MonadFresh i m => MonadFresh i (IdentityT m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods fresh :: IdentityT m i Source #
MonadFresh i m => MonadFresh i (ReaderT r m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods fresh :: ReaderT r m i Source #
MonadFresh i m => MonadFresh i (StateT s m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods fresh :: StateT s m i Source #

pattern Axiom :: Bool -> Defn Source #

newtype Fields Source #

Constructors

Fields [(Name, Type)]

Instances

Instances details

Null Fields Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods empty :: Fields Source # null :: Fields -> Bool Source #

data ForeignCode Source #

Constructors

ForeignCode Range String

Instances

Instances details

EmbPrj ForeignCode Source #

Instance details

Defined in Agda.TypeChecking.Serialise.Instances.Compilers

Methods

icode :: ForeignCode -> S Int32 Source #

icod_ :: ForeignCode -> S Int32 Source #

value :: Int32 -> R ForeignCode Source #

Generic ForeignCode Source #

Instance details

Associated Types

type Rep ForeignCode

Instance details

type Rep ForeignCode = D1 ('MetaData "ForeignCode" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-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)))

Methods

from :: ForeignCode -> Rep ForeignCode x #

to :: Rep ForeignCode x -> ForeignCode #

Show ForeignCode Source #

Instance details

Methods

showsPrec :: Int -> ForeignCode -> ShowS #

show :: ForeignCode -> String #

showList :: [ForeignCode] -> ShowS #

NFData ForeignCode Source #

Instance details

Methods

rnf :: ForeignCode -> () #

type Rep ForeignCode Source #

Instance details

type Rep ForeignCode = D1 ('MetaData "ForeignCode" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-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)))

defOpaque :: Definition -> IsOpaque Source #

data LetBinding Source #

Constructors

LetBinding
Fields letOrigin :: Origin letTerm :: Term letType :: Dom Type

Instances

Instances details

InstantiateFull LetBinding Source #

Instance details

Defined in Agda.TypeChecking.Reduce

Methods

instantiateFull' :: LetBinding -> ReduceM LetBinding Source #

Subst LetBinding Source #

Instance details

Associated Types

type SubstArg LetBinding
Instance details Defined in Agda.TypeChecking.Substitute type SubstArg LetBinding = Term

Methods

applySubst :: Substitution' (SubstArg LetBinding) -> LetBinding -> LetBinding Source #

Generic LetBinding Source #

Instance details

Associated Types

type Rep LetBinding

Instance details

type Rep LetBinding = D1 ('MetaData "LetBinding" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "LetBinding" 'PrefixI 'True) (S1 ('MetaSel ('Just "letOrigin") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Origin) :*: (S1 ('MetaSel ('Just "letTerm") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term) :*: S1 ('MetaSel ('Just "letType") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Dom Type)))))

Methods

from :: LetBinding -> Rep LetBinding x #

to :: Rep LetBinding x -> LetBinding #

Show LetBinding Source #

Instance details

Methods

showsPrec :: Int -> LetBinding -> ShowS #

show :: LetBinding -> String #

showList :: [LetBinding] -> ShowS #

NFData LetBinding Source #

Instance details

Methods

rnf :: LetBinding -> () #

type SubstArg LetBinding Source #

Instance details

type SubstArg LetBinding = Term

type Rep LetBinding Source #

Instance details

type Rep LetBinding = D1 ('MetaData "LetBinding" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "LetBinding" 'PrefixI 'True) (S1 ('MetaSel ('Just "letOrigin") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Origin) :*: (S1 ('MetaSel ('Just "letTerm") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term) :*: S1 ('MetaSel ('Just "letType") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Dom Type)))))

newtype Section Source #

Constructors

Section
Fields _secTelescope :: Telescope

Instances

Instances details

Pretty Section Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods pretty :: Section -> Doc Source # prettyPrec :: Int -> Section -> Doc Source # prettyList :: [Section] -> Doc Source #
NamesIn Section Source #
Instance details Defined in Agda.Syntax.Internal.Names Methods namesAndMetasIn' :: Monoid m => (Either QName MetaId -> m) -> Section -> m Source #
KillRange Section Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods killRange :: KillRangeT Section Source #
KillRange Sections Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods killRange :: KillRangeT Sections Source #
InstantiateFull Section Source #
Instance details Defined in Agda.TypeChecking.Reduce Methods instantiateFull' :: Section -> ReduceM Section Source #
EmbPrj Section Source #
Instance details Defined in Agda.TypeChecking.Serialise.Instances.Internal Methods icode :: Section -> S Int32 Source # icod_ :: Section -> S Int32 Source # value :: Int32 -> R Section Source #
Show Section Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods showsPrec :: Int -> Section -> ShowS # show :: Section -> String # showList :: [Section] -> ShowS #
NFData Section Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods rnf :: Section -> () #
Eq Section Source #
Instance details Defined in Agda.TypeChecking.Substitute Methods (==) :: Section -> Section -> Bool # (/=) :: Section -> Section -> Bool #

data PreScopeState Source #

Constructors

PreScopeState

Fields

stPreTokens :: !HighlightingInfo
Highlighting info for tokens and Happy parser warnings (but not for those tokens/warnings for which highlighting exists in stPostSyntaxInfo).
stPreImports :: !Signature
Imported declared identifiers. Those most not be serialized!
stPreImportedModules :: !(Set TopLevelModuleName)
The top-level modules imported by the current module.
stPreModuleToSource :: !ModuleToSource
stPreVisitedModules :: !VisitedModules
stPreScope :: !ScopeInfo
stPrePatternSyns :: !PatternSynDefns
Pattern synonyms of the current file. Serialized.
stPrePatternSynImports :: !PatternSynDefns
Imported pattern synonyms. Must not be serialized!
stPreGeneralizedVars :: !(Maybe (Set QName))
Collected generalizable variables; used during scope checking of terms
stPrePragmaOptions :: !PragmaOptions
Options applying to the current file. OPTIONS pragmas only affect this field.
stPreImportedBuiltins :: !(BuiltinThings PrimFun)
stPreImportedDisplayForms :: !DisplayForms
Display forms added by someone else to imported identifiers
stPreImportedInstanceDefs :: !InstanceTable
stPreForeignCode :: !(Map BackendName ForeignCodeStack)
{-# FOREIGN #-} code that should be included in the compiled output. Does not include code for imported modules.
stPreFreshInteractionId :: !InteractionId
stPreImportedUserWarnings :: !(Map QName Text)
Imported UserWarnings, not to be stored in the Interface
stPreLocalUserWarnings :: !(Map QName Text)
Locally defined UserWarnings, to be stored in the Interface
stPreWarningOnImport :: !(Maybe Text)
Whether the current module should raise a warning when opened
stPreImportedPartialDefs :: !(Set QName)
Imported partial definitions, not to be stored in the Interface
stPreProjectConfigs :: !(Map FilePath ProjectConfig)
Map from directories to paths of closest enclosing .agda-lib files (or Nothing if there are none).
stPreAgdaLibFiles :: !(Map FilePath AgdaLibFile)
Contents of .agda-lib files that have already been parsed.
stPreImportedMetaStore :: !RemoteMetaStore
Used for meta-variables from other modules.
stPreCopiedNames :: !(HashMap QName QName)
Associates a copied name (the key) to its original name (the value). Computed by the scope checker, used to compute opaque blocks.
stPreNameCopies :: !(HashMap QName (HashSet QName))
Associates an original name (the key) to all its copies (the value). Computed by the scope checker, used to compute opaque blocks.

Instances

Instances details

Generic PreScopeState Source #

Instance details

Associated Types

type Rep PreScopeState

Instance details

Methods

from :: PreScopeState -> Rep PreScopeState x #

to :: Rep PreScopeState x -> PreScopeState #

NFData PreScopeState Source #

This instance could be optimised, some things are guaranteed to be forced.

Instance details

Methods

rnf :: PreScopeState -> () #

type Rep PreScopeState Source #

Instance details

data PostScopeState Source #

Constructors

PostScopeState

Fields

stPostSyntaxInfo :: !HighlightingInfo
Highlighting info.
stPostDisambiguatedNames :: !DisambiguatedNames
Disambiguation carried out by the type checker. Maps position of first name character to disambiguated QName for each AmbiguousQName already passed by the type checker.
stPostOpenMetaStore :: !LocalMetaStore
Used for open meta-variables.
stPostSolvedMetaStore :: !LocalMetaStore
Used for local, instantiated meta-variables.
stPostInteractionPoints :: !InteractionPoints
stPostAwakeConstraints :: !Constraints
stPostSleepingConstraints :: !Constraints
stPostDirty :: !Bool
Dirty when a constraint is added, used to prevent pointer update. Currently unused.
stPostOccursCheckDefs :: !(Set QName)
Definitions to be considered during occurs check. Initialized to the current mutual block before the check. During occurs check, we remove definitions from this set as soon we have checked them.
stPostSignature :: !Signature
Declared identifiers of the current file. These will be serialized after successful type checking.
stPostModuleCheckpoints :: !(Map ModuleName CheckpointId)
For each module remember the checkpoint corresponding to the orignal context of the module parameters.
stPostImportsDisplayForms :: !DisplayForms
Display forms we add for imported identifiers
stPostCurrentModule :: !(Maybe (ModuleName, TopLevelModuleName))
The current module is available after it has been type checked.
stPostInstanceDefs :: !TempInstanceTable
stPostConcreteNames :: !ConcreteNames
Map keeping track of concrete names assigned to each abstract name (can be more than one name in case the first one is shadowed)
stPostUsedNames :: !(Map RawName (DList RawName))
Map keeping track for each name root (= name w/o numeric suffixes) what names with the same root have been used during a TC computation. This information is used to build the ShadowingNames map.
stPostShadowingNames :: !(Map Name (DList RawName))
Map keeping track for each (abstract) name the list of all (raw) names that it could maybe be shadowed by.
stPostStatistics :: !Statistics
Counters to collect various statistics about meta variables etc. Only for current file.
stPostTCWarnings :: ![TCWarning]
stPostMutualBlocks :: !(Map MutualId MutualBlock)
stPostLocalBuiltins :: !(BuiltinThings PrimFun)
stPostFreshMetaId :: !MetaId
stPostFreshMutualId :: !MutualId
stPostFreshProblemId :: !ProblemId
stPostFreshCheckpointId :: !CheckpointId
stPostFreshInt :: !Int
stPostFreshNameId :: !NameId
stPostFreshOpaqueId :: !OpaqueId
stPostAreWeCaching :: !Bool
stPostPostponeInstanceSearch :: !Bool
stPostConsideringInstance :: !Bool
stPostInstantiateBlocking :: !Bool
Should we instantiate away blocking metas? This can produce ill-typed terms but they are often more readable. See issue #3606. Best set to True only for calls to pretty*/reify to limit unwanted reductions.
stPostLocalPartialDefs :: !(Set QName)
Local partial definitions, to be stored in the Interface
stPostOpaqueBlocks :: Map OpaqueId OpaqueBlock
Associates opaque identifiers to their actual blocks.
stPostOpaqueIds :: Map QName OpaqueId
Associates each opaque QName to the block it was defined in.

Instances

Instances details

Generic PostScopeState Source #

Instance details

Associated Types

type Rep PostScopeState

Instance details

Methods

from :: PostScopeState -> Rep PostScopeState x #

to :: Rep PostScopeState x -> PostScopeState #

NFData PostScopeState Source #

This instance could be optimised, some things are guaranteed to be forced.

Instance details

Methods

rnf :: PostScopeState -> () #

type Rep PostScopeState Source #

Instance details

LensCommandLineOptions PersistentTCState Source #

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

stDecodedModules :: !DecodedModules
stPersistentTopLevelModuleNames :: !(BiMap RawTopLevelModuleName ModuleNameHash)
Module name hashes for top-level module names (and vice versa).
stPersistentOptions :: CommandLineOptions
stInteractionOutputCallback :: InteractionOutputCallback
Callback function to call when there is a response to give to the interactive frontend. See the documentation of InteractionOutputCallback.
stBenchmark :: !Benchmark
Structure to track how much CPU time was spent on which Agda phase. Needs to be a strict field to avoid space leaks!
stAccumStatistics :: !Statistics
Should be strict field.
stPersistLoadedFileCache :: !(Maybe LoadedFileCache)
Cached typechecking state from the last loaded file. Should be Nothing when checking imports.
stPersistBackends :: [Backend]
Current backends with their options

Instances

Instances details

Instance details

LensIncludePaths PersistentTCState Source #

Methods

getCommandLineOptions :: PersistentTCState -> CommandLineOptions Source #

setCommandLineOptions :: CommandLineOptions -> PersistentTCState -> PersistentTCState Source #

mapCommandLineOptions :: (CommandLineOptions -> CommandLineOptions) -> PersistentTCState -> PersistentTCState Source #

Instance details

LensPersistentVerbosity PersistentTCState Source #

Methods

getIncludePaths :: PersistentTCState -> [FilePath] Source #

setIncludePaths :: [FilePath] -> PersistentTCState -> PersistentTCState Source #

mapIncludePaths :: ([FilePath] -> [FilePath]) -> PersistentTCState -> PersistentTCState Source #

getAbsoluteIncludePaths :: PersistentTCState -> [AbsolutePath] Source #

setAbsoluteIncludePaths :: [AbsolutePath] -> PersistentTCState -> PersistentTCState Source #

mapAbsoluteIncludePaths :: ([AbsolutePath] -> [AbsolutePath]) -> PersistentTCState -> PersistentTCState Source #

Instance details

LensSafeMode PersistentTCState Source #

Methods

getPersistentVerbosity :: PersistentTCState -> PersistentVerbosity Source #

setPersistentVerbosity :: PersistentVerbosity -> PersistentTCState -> PersistentTCState Source #

mapPersistentVerbosity :: (PersistentVerbosity -> PersistentVerbosity) -> PersistentTCState -> PersistentTCState Source #

Instance details

Methods

getSafeMode :: PersistentTCState -> SafeMode Source #

setSafeMode :: SafeMode -> PersistentTCState -> PersistentTCState Source #

mapSafeMode :: (SafeMode -> SafeMode) -> PersistentTCState -> PersistentTCState Source #

Generic PersistentTCState Source #

Instance details

Associated Types

type Rep PersistentTCState

Instance details

type Rep PersistentTCState = D1 ('MetaData "PersistentTCState" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "PersistentTCSt" 'PrefixI 'True) (((S1 ('MetaSel ('Just "stDecodedModules") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 DecodedModules) :*: S1 ('MetaSel ('Just "stPersistentTopLevelModuleNames") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (BiMap RawTopLevelModuleName ModuleNameHash))) :*: (S1 ('MetaSel ('Just "stPersistentOptions") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 CommandLineOptions) :*: S1 ('MetaSel ('Just "stInteractionOutputCallback") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 InteractionOutputCallback))) :*: ((S1 ('MetaSel ('Just "stBenchmark") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Benchmark) :*: S1 ('MetaSel ('Just "stAccumStatistics") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Statistics)) :*: (S1 ('MetaSel ('Just "stPersistLoadedFileCache") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (Maybe LoadedFileCache)) :*: S1 ('MetaSel ('Just "stPersistBackends") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Backend])))))

Methods

from :: PersistentTCState -> Rep PersistentTCState x #

to :: Rep PersistentTCState x -> PersistentTCState #

NFData PersistentTCState Source #

Instance details

Methods

rnf :: PersistentTCState -> () #

type Rep PersistentTCState Source #

Instance details

type Rep PersistentTCState = D1 ('MetaData "PersistentTCState" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "PersistentTCSt" 'PrefixI 'True) (((S1 ('MetaSel ('Just "stDecodedModules") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 DecodedModules) :*: S1 ('MetaSel ('Just "stPersistentTopLevelModuleNames") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (BiMap RawTopLevelModuleName ModuleNameHash))) :*: (S1 ('MetaSel ('Just "stPersistentOptions") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 CommandLineOptions) :*: S1 ('MetaSel ('Just "stInteractionOutputCallback") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 InteractionOutputCallback))) :*: ((S1 ('MetaSel ('Just "stBenchmark") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Benchmark) :*: S1 ('MetaSel ('Just "stAccumStatistics") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Statistics)) :*: (S1 ('MetaSel ('Just "stPersistLoadedFileCache") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (Maybe LoadedFileCache)) :*: S1 ('MetaSel ('Just "stPersistBackends") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Backend])))))

type VisitedModules = Map TopLevelModuleName ModuleInfo Source #

type BuiltinThings pf = Map SomeBuiltin (Builtin pf) Source #

type DisplayForms = HashMap QName [LocalDisplayForm] Source #

type InstanceTable = Map QName (Set QName) Source #

The instance table is a Map associating to every name of recorddata typepostulate its list of instances

newtype ForeignCodeStack Source #

Foreign code fragments are stored in reversed order to support efficient appending: head points to the latest pragma in module.

Constructors

ForeignCodeStack
Fields getForeignCodeStack :: [ForeignCode]

Instances

Instances details

EmbPrj ForeignCodeStack Source #

Instance details

Defined in Agda.TypeChecking.Serialise.Instances.Compilers

Methods

icode :: ForeignCodeStack -> S Int32 Source #

icod_ :: ForeignCodeStack -> S Int32 Source #

value :: Int32 -> R ForeignCodeStack Source #

Generic ForeignCodeStack Source #

Instance details

Associated Types

type Rep ForeignCodeStack
Instance details Defined in Agda.TypeChecking.Monad.Base type Rep ForeignCodeStack = D1 ('MetaData "ForeignCodeStack" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'True) (C1 ('MetaCons "ForeignCodeStack" 'PrefixI 'True) (S1 ('MetaSel ('Just "getForeignCodeStack") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [ForeignCode])))

Methods

from :: ForeignCodeStack -> Rep ForeignCodeStack x #

to :: Rep ForeignCodeStack x -> ForeignCodeStack #

Show ForeignCodeStack Source #

Instance details

Methods

showsPrec :: Int -> ForeignCodeStack -> ShowS #

show :: ForeignCodeStack -> String #

showList :: [ForeignCodeStack] -> ShowS #

NFData ForeignCodeStack Source #

Instance details

Methods

rnf :: ForeignCodeStack -> () #

type Rep ForeignCodeStack Source #

Instance details

DisambiguatedName NameKind QName

type Rep ForeignCodeStack = D1 ('MetaData "ForeignCodeStack" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'True) (C1 ('MetaCons "ForeignCodeStack" 'PrefixI 'True) (S1 ('MetaSel ('Just "getForeignCodeStack") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [ForeignCode])))

type RemoteMetaStore = HashMap MetaId RemoteMetaVariable Source #

Used for meta-variables from other modules (and in Interfaces).

data DisambiguatedName Source #

Name disambiguation for the sake of highlighting.

Constructors

Instances

Instances details

Generic DisambiguatedName Source #

Instance details

Associated Types

type Rep DisambiguatedName

Instance details

type Rep DisambiguatedName = D1 ('MetaData "DisambiguatedName" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-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)))

Methods

from :: DisambiguatedName -> Rep DisambiguatedName x #

to :: Rep DisambiguatedName x -> DisambiguatedName #

NFData DisambiguatedName Source #

Instance details

Methods

rnf :: DisambiguatedName -> () #

type Rep DisambiguatedName Source #

Instance details

type Rep DisambiguatedName = D1 ('MetaData "DisambiguatedName" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-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)))

type DisambiguatedNames = IntMap DisambiguatedName Source #

type ConcreteNames = Map Name [Name] Source #

type LocalMetaStore = Map MetaId MetaVariable Source #

Used for meta-variables from the current module.

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)

newtype CheckpointId Source #

Constructors

CheckpointId Int

Instances

Instances details

Pretty CheckpointId Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods pretty :: CheckpointId -> Doc Source # prettyPrec :: Int -> CheckpointId -> Doc Source # prettyList :: [CheckpointId] -> Doc Source #
HasFresh CheckpointId Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods freshLens :: Lens' TCState CheckpointId Source # nextFresh' :: CheckpointId -> CheckpointId Source #
PrettyTCM CheckpointId Source #
Instance details Defined in Agda.TypeChecking.Pretty Methods prettyTCM :: MonadPretty m => CheckpointId -> m Doc Source #
EmbPrj CheckpointId Source #
Instance details Defined in Agda.TypeChecking.Serialise.Instances.Internal Methods icode :: CheckpointId -> S Int32 Source # icod_ :: CheckpointId -> S Int32 Source # value :: Int32 -> R CheckpointId Source #
Enum CheckpointId Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods succ :: CheckpointId -> CheckpointId # pred :: CheckpointId -> CheckpointId # toEnum :: Int -> CheckpointId # fromEnum :: CheckpointId -> Int # enumFrom :: CheckpointId -> [CheckpointId] # enumFromThen :: CheckpointId -> CheckpointId -> [CheckpointId] # enumFromTo :: CheckpointId -> CheckpointId -> [CheckpointId] # enumFromThenTo :: CheckpointId -> CheckpointId -> CheckpointId -> [CheckpointId] #
Num CheckpointId Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods (+) :: CheckpointId -> CheckpointId -> CheckpointId # (-) :: CheckpointId -> CheckpointId -> CheckpointId # (*) :: CheckpointId -> CheckpointId -> CheckpointId # negate :: CheckpointId -> CheckpointId # abs :: CheckpointId -> CheckpointId # signum :: CheckpointId -> CheckpointId # fromInteger :: Integer -> CheckpointId #
Integral CheckpointId Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods quot :: CheckpointId -> CheckpointId -> CheckpointId # rem :: CheckpointId -> CheckpointId -> CheckpointId # div :: CheckpointId -> CheckpointId -> CheckpointId # mod :: CheckpointId -> CheckpointId -> CheckpointId # quotRem :: CheckpointId -> CheckpointId -> (CheckpointId, CheckpointId) # divMod :: CheckpointId -> CheckpointId -> (CheckpointId, CheckpointId) # toInteger :: CheckpointId -> Integer #
Real CheckpointId Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods toRational :: CheckpointId -> Rational #
Show CheckpointId Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods showsPrec :: Int -> CheckpointId -> ShowS # show :: CheckpointId -> String # showList :: [CheckpointId] -> ShowS #
NFData CheckpointId Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods rnf :: CheckpointId -> () #
Eq CheckpointId Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods (==) :: CheckpointId -> CheckpointId -> Bool # (/=) :: CheckpointId -> CheckpointId -> Bool #
Ord CheckpointId Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods compare :: CheckpointId -> CheckpointId -> Ordering # (<) :: CheckpointId -> CheckpointId -> Bool # (<=) :: CheckpointId -> CheckpointId -> Bool # (>) :: CheckpointId -> CheckpointId -> Bool # (>=) :: CheckpointId -> CheckpointId -> Bool # max :: CheckpointId -> CheckpointId -> CheckpointId # min :: CheckpointId -> CheckpointId -> CheckpointId #

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.

newtype MutualId Source #

Constructors

MutId Int32

Instances

Instances details

KillRange MutualId Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods killRange :: KillRangeT MutualId Source #
HasFresh MutualId Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods freshLens :: Lens' TCState MutualId Source # nextFresh' :: MutualId -> MutualId Source #
EmbPrj MutualId Source #
Instance details Defined in Agda.TypeChecking.Serialise.Instances.Internal Methods icode :: MutualId -> S Int32 Source # icod_ :: MutualId -> S Int32 Source # value :: Int32 -> R MutualId Source #
Enum MutualId Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods succ :: MutualId -> MutualId # pred :: MutualId -> MutualId # toEnum :: Int -> MutualId # fromEnum :: MutualId -> Int # enumFrom :: MutualId -> [MutualId] # enumFromThen :: MutualId -> MutualId -> [MutualId] # enumFromTo :: MutualId -> MutualId -> [MutualId] # enumFromThenTo :: MutualId -> MutualId -> MutualId -> [MutualId] #
Num MutualId Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods (+) :: MutualId -> MutualId -> MutualId # (-) :: MutualId -> MutualId -> MutualId # (*) :: MutualId -> MutualId -> MutualId # negate :: MutualId -> MutualId # abs :: MutualId -> MutualId # signum :: MutualId -> MutualId # fromInteger :: Integer -> MutualId #
Show MutualId Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods showsPrec :: Int -> MutualId -> ShowS # show :: MutualId -> String # showList :: [MutualId] -> ShowS #
NFData MutualId Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods rnf :: MutualId -> () #
Eq MutualId Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods (==) :: MutualId -> MutualId -> Bool # (/=) :: MutualId -> MutualId -> Bool #
Ord MutualId Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods compare :: MutualId -> MutualId -> Ordering # (<) :: MutualId -> MutualId -> Bool # (<=) :: MutualId -> MutualId -> Bool # (>) :: MutualId -> MutualId -> Bool # (>=) :: MutualId -> MutualId -> Bool # max :: MutualId -> MutualId -> MutualId # min :: MutualId -> MutualId -> MutualId #

data MutualBlock Source #

A mutual block of names in the signature.

Constructors

MutualBlock
Fields mutualInfo :: MutualInfo The original info of the mutual block. mutualNames :: Set QName

Instances

Instances details

Null MutualBlock Source #

Instance details

Methods

empty :: MutualBlock Source #

null :: MutualBlock -> Bool Source #

Generic MutualBlock Source #

Instance details

Associated Types

type Rep MutualBlock

Instance details

type Rep MutualBlock = D1 ('MetaData "MutualBlock" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "MutualBlock" 'PrefixI 'True) (S1 ('MetaSel ('Just "mutualInfo") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 MutualInfo) :*: S1 ('MetaSel ('Just "mutualNames") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Set QName))))

Methods

from :: MutualBlock -> Rep MutualBlock x #

to :: Rep MutualBlock x -> MutualBlock #

Show MutualBlock Source #

Instance details

Methods

showsPrec :: Int -> MutualBlock -> ShowS #

show :: MutualBlock -> String #

showList :: [MutualBlock] -> ShowS #

NFData MutualBlock Source #

Instance details

Methods

rnf :: MutualBlock -> () #

Eq MutualBlock Source #

Instance details

Methods

(==) :: MutualBlock -> MutualBlock -> Bool #

(/=) :: MutualBlock -> MutualBlock -> Bool #

type Rep MutualBlock Source #

Instance details

type Rep MutualBlock = D1 ('MetaData "MutualBlock" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "MutualBlock" 'PrefixI 'True) (S1 ('MetaSel ('Just "mutualInfo") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 MutualInfo) :*: S1 ('MetaSel ('Just "mutualNames") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Set QName))))

data OpaqueBlock Source #

A block of opaque definitions.

Constructors

OpaqueBlock

Fields

opaqueId :: !OpaqueId
Unique identifier for this block.
opaqueUnfolding :: HashSet QName
Set of names we are allowed to unfold. After scope-checking, this set should be transitively closed.
opaqueDecls :: HashSet QName
Declarations contained in this abstract block.
opaqueParent :: Maybe OpaqueId
Pointer to an enclosing opaque block, if one exists.
opaqueRange :: Range
Where is this opaque block?

Instances

Instances details

Pretty OpaqueBlock Source #

Instance details

Methods

pretty :: OpaqueBlock -> Doc Source #

prettyPrec :: Int -> OpaqueBlock -> Doc Source #

prettyList :: [OpaqueBlock] -> Doc Source #

EmbPrj OpaqueBlock Source #

Instance details

Defined in Agda.TypeChecking.Serialise.Instances.Internal

Methods

icode :: OpaqueBlock -> S Int32 Source #

icod_ :: OpaqueBlock -> S Int32 Source #

value :: Int32 -> R OpaqueBlock Source #

Generic OpaqueBlock Source #

Instance details

Associated Types

type Rep OpaqueBlock

Instance details

type Rep OpaqueBlock = D1 ('MetaData "OpaqueBlock" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "OpaqueBlock" 'PrefixI 'True) ((S1 ('MetaSel ('Just "opaqueId") 'SourceUnpack 'SourceStrict 'DecidedStrict) (Rec0 OpaqueId) :*: S1 ('MetaSel ('Just "opaqueUnfolding") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (HashSet QName))) :*: (S1 ('MetaSel ('Just "opaqueDecls") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (HashSet QName)) :*: (S1 ('MetaSel ('Just "opaqueParent") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe OpaqueId)) :*: S1 ('MetaSel ('Just "opaqueRange") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Range)))))

Methods

from :: OpaqueBlock -> Rep OpaqueBlock x #

to :: Rep OpaqueBlock x -> OpaqueBlock #

Show OpaqueBlock Source #

Instance details

Methods

showsPrec :: Int -> OpaqueBlock -> ShowS #

show :: OpaqueBlock -> String #

showList :: [OpaqueBlock] -> ShowS #

NFData OpaqueBlock Source #

Instance details

Methods

rnf :: OpaqueBlock -> () #

Eq OpaqueBlock Source #

Instance details

Methods

(==) :: OpaqueBlock -> OpaqueBlock -> Bool #

(/=) :: OpaqueBlock -> OpaqueBlock -> Bool #

Hashable OpaqueBlock Source #

Instance details

Methods

hashWithSalt :: Int -> OpaqueBlock -> Int

hash :: OpaqueBlock -> Int

type Rep OpaqueBlock Source #

Instance details

type Rep OpaqueBlock = D1 ('MetaData "OpaqueBlock" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "OpaqueBlock" 'PrefixI 'True) ((S1 ('MetaSel ('Just "opaqueId") 'SourceUnpack 'SourceStrict 'DecidedStrict) (Rec0 OpaqueId) :*: S1 ('MetaSel ('Just "opaqueUnfolding") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (HashSet QName))) :*: (S1 ('MetaSel ('Just "opaqueDecls") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (HashSet QName)) :*: (S1 ('MetaSel ('Just "opaqueParent") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe OpaqueId)) :*: S1 ('MetaSel ('Just "opaqueRange") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Range)))))

type DecodedModules = Map TopLevelModuleName ModuleInfo Source #

data LoadedFileCache Source #

Constructors

LoadedFileCache
Fields lfcCached :: !CachedTypeCheckLog lfcCurrent :: !CurrentTypeCheckLog

Instances

Instances details

Generic LoadedFileCache Source #

Instance details

Associated Types

type Rep LoadedFileCache

Instance details

type Rep LoadedFileCache = D1 ('MetaData "LoadedFileCache" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-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)))

Methods

from :: LoadedFileCache -> Rep LoadedFileCache x #

to :: Rep LoadedFileCache x -> LoadedFileCache #

NFData LoadedFileCache Source #

Instance details

Methods

rnf :: LoadedFileCache -> () #

type Rep LoadedFileCache Source #

Instance details

type Rep LoadedFileCache = D1 ('MetaData "LoadedFileCache" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-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)))

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.

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).

initPersistentState :: PersistentTCState Source #

Empty persistent state.

initialMetaId :: MetaId Source #

An initial MetaId.

initPreScopeState :: PreScopeState Source #

Empty state of type checker.

emptySignature :: Signature Source #

initPostScopeState :: PostScopeState Source #

stTokens :: Lens' TCState HighlightingInfo Source #

stImports :: Lens' TCState Signature Source #

stImportedModules :: Lens' TCState (Set TopLevelModuleName) Source #

stVisitedModules :: Lens' TCState VisitedModules Source #

stScope :: Lens' TCState ScopeInfo Source #

stPatternSyns :: Lens' TCState PatternSynDefns Source #

stPatternSynImports :: Lens' TCState PatternSynDefns Source #

stGeneralizedVars :: Lens' TCState (Maybe (Set QName)) Source #

stPragmaOptions :: Lens' TCState PragmaOptions Source #

stImportedBuiltins :: Lens' TCState (BuiltinThings PrimFun) Source #

stForeignCode :: Lens' TCState (Map BackendName ForeignCodeStack) Source #

stFreshInteractionId :: Lens' TCState InteractionId Source #

stImportedUserWarnings :: Lens' TCState (Map QName Text) Source #

stLocalUserWarnings :: Lens' TCState (Map QName Text) Source #

getUserWarnings :: ReadTCState m => m (Map QName Text) Source #

useR :: ReadTCState m => Lens' TCState a -> m a Source #

stWarningOnImport :: Lens' TCState (Maybe Text) Source #

stImportedPartialDefs :: Lens' TCState (Set QName) Source #

stLocalPartialDefs :: Lens' TCState (Set QName) Source #

getPartialDefs :: ReadTCState m => m (Set QName) Source #

stLoadedFileCache :: Lens' TCState (Maybe LoadedFileCache) Source #

stBackends :: Lens' TCState [Backend] Source #

stProjectConfigs :: Lens' TCState (Map FilePath ProjectConfig) Source #

stAgdaLibFiles :: Lens' TCState (Map FilePath AgdaLibFile) Source #

stTopLevelModuleNames :: Lens' TCState (BiMap RawTopLevelModuleName ModuleNameHash) Source #

stImportedMetaStore :: Lens' TCState RemoteMetaStore Source #

stCopiedNames :: Lens' TCState (HashMap QName QName) Source #

stNameCopies :: Lens' TCState (HashMap QName (HashSet QName)) Source #

stFreshNameId :: Lens' TCState NameId Source #

stFreshOpaqueId :: Lens' TCState OpaqueId Source #

stOpaqueBlocks :: Lens' TCState (Map OpaqueId OpaqueBlock) Source #

stOpaqueIds :: Lens' TCState (Map QName OpaqueId) Source #

stSyntaxInfo :: Lens' TCState HighlightingInfo Source #

stDisambiguatedNames :: Lens' TCState DisambiguatedNames Source #

stOpenMetaStore :: Lens' TCState LocalMetaStore Source #

stSolvedMetaStore :: Lens' TCState LocalMetaStore Source #

stInteractionPoints :: Lens' TCState InteractionPoints Source #

stAwakeConstraints :: Lens' TCState Constraints Source #

stSleepingConstraints :: Lens' TCState Constraints Source #

stDirty :: Lens' TCState Bool Source #

stOccursCheckDefs :: Lens' TCState (Set QName) Source #

stSignature :: Lens' TCState Signature Source #

stModuleCheckpoints :: Lens' TCState (Map ModuleName CheckpointId) Source #

stImportsDisplayForms :: Lens' TCState DisplayForms Source #

stImportedDisplayForms :: Lens' TCState DisplayForms Source #

stCurrentModule :: Lens' TCState (Maybe (ModuleName, TopLevelModuleName)) Source #

Note that the lens is "strict".

stImportedInstanceDefs :: Lens' TCState InstanceTable Source #

stInstanceDefs :: Lens' TCState TempInstanceTable Source #

stConcreteNames :: Lens' TCState ConcreteNames Source #

stUsedNames :: Lens' TCState (Map RawName (DList RawName)) Source #

stShadowingNames :: Lens' TCState (Map Name (DList RawName)) Source #

stStatistics :: Lens' TCState Statistics Source #

stTCWarnings :: Lens' TCState [TCWarning] Source #

stMutualBlocks :: Lens' TCState (Map MutualId MutualBlock) Source #

stLocalBuiltins :: Lens' TCState (BuiltinThings PrimFun) Source #

stFreshMetaId :: Lens' TCState MetaId Source #

stFreshMutualId :: Lens' TCState MutualId Source #

stFreshProblemId :: Lens' TCState ProblemId Source #

stFreshCheckpointId :: Lens' TCState CheckpointId Source #

stFreshInt :: Lens' TCState Int Source #

stAreWeCaching :: Lens' TCState Bool Source #

stPostponeInstanceSearch :: Lens' TCState Bool Source #

stConsideringInstance :: Lens' TCState Bool Source #

stInstantiateBlocking :: Lens' TCState Bool Source #

stBuiltinThings :: TCState -> BuiltinThings PrimFun Source #

unionBuiltin :: Builtin a -> Builtin a -> Builtin a Source #

Union two Builtins. Only defined for BuiltinRewriteRelations.

class Enum i => HasFresh i where Source #

Minimal complete definition

freshLens

Methods

freshLens :: Lens' TCState i Source #

nextFresh' :: i -> i Source #

Instances

Instances details

HasFresh InteractionId Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods freshLens :: Lens' TCState InteractionId Source # nextFresh' :: InteractionId -> InteractionId Source #
HasFresh MetaId Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods freshLens :: Lens' TCState MetaId Source # nextFresh' :: MetaId -> MetaId Source #
HasFresh NameId Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods freshLens :: Lens' TCState NameId Source # nextFresh' :: NameId -> NameId Source #
HasFresh OpaqueId Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods freshLens :: Lens' TCState OpaqueId Source # nextFresh' :: OpaqueId -> OpaqueId Source #
HasFresh ProblemId Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods freshLens :: Lens' TCState ProblemId Source # nextFresh' :: ProblemId -> ProblemId Source #
HasFresh CheckpointId Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods freshLens :: Lens' TCState CheckpointId Source # nextFresh' :: CheckpointId -> CheckpointId Source #
HasFresh MutualId Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods freshLens :: Lens' TCState MutualId Source # nextFresh' :: MutualId -> MutualId Source #
HasFresh Int Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods freshLens :: Lens' TCState Int Source # nextFresh' :: Int -> Int Source #

nextFresh :: HasFresh i => TCState -> (i, TCState) Source #

freshName :: MonadFresh NameId m => Range -> String -> m Name Source #

freshNoName :: MonadFresh NameId m => Range -> m Name Source #

freshNoName_ :: MonadFresh NameId m => m Name Source #

freshRecordName :: MonadFresh NameId m => m Name Source #

class FreshName a where Source #

Create a fresh name from a.

Methods

freshName_ :: MonadFresh NameId m => a -> m Name Source #

Instances

Instances details

FreshName Range Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods freshName_ :: MonadFresh NameId m => Range -> m Name Source #
FreshName String Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods freshName_ :: MonadFresh NameId m => String -> m Name Source #
FreshName () Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods freshName_ :: MonadFresh NameId m => () -> m Name Source #
FreshName (Range, String) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods freshName_ :: MonadFresh NameId m => (Range, String) -> m Name Source #

class Monad m => MonadStConcreteNames (m :: Type -> Type) 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

runStConcreteNames

Methods

runStConcreteNames :: StateT ConcreteNames m a -> m a Source #

useConcreteNames :: m ConcreteNames Source #

modifyConcreteNames :: (ConcreteNames -> ConcreteNames) -> m () Source #

Instances

Instances details

MonadStConcreteNames AbsToCon Source #
Instance details Defined in Agda.Syntax.Translation.AbstractToConcrete Methods runStConcreteNames :: StateT ConcreteNames AbsToCon a -> AbsToCon a Source # useConcreteNames :: AbsToCon ConcreteNames Source # modifyConcreteNames :: (ConcreteNames -> ConcreteNames) -> AbsToCon () Source #
MonadStConcreteNames TCM Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods runStConcreteNames :: StateT ConcreteNames TCM a -> TCM a Source # useConcreteNames :: TCM ConcreteNames Source # modifyConcreteNames :: (ConcreteNames -> ConcreteNames) -> TCM () Source #
ReadTCState m => MonadStConcreteNames (PureConversionT m) Source #
Instance details Defined in Agda.TypeChecking.Conversion.Pure Methods runStConcreteNames :: StateT ConcreteNames (PureConversionT m) a -> PureConversionT m a Source # useConcreteNames :: PureConversionT m ConcreteNames Source # modifyConcreteNames :: (ConcreteNames -> ConcreteNames) -> PureConversionT m () Source #
MonadStConcreteNames m => MonadStConcreteNames (IdentityT m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods runStConcreteNames :: StateT ConcreteNames (IdentityT m) a -> IdentityT m a Source # useConcreteNames :: IdentityT m ConcreteNames Source # modifyConcreteNames :: (ConcreteNames -> ConcreteNames) -> IdentityT m () Source #
MonadStConcreteNames m => MonadStConcreteNames (ReaderT r m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods runStConcreteNames :: StateT ConcreteNames (ReaderT r m) a -> ReaderT r m a Source # useConcreteNames :: ReaderT r m ConcreteNames Source # modifyConcreteNames :: (ConcreteNames -> ConcreteNames) -> ReaderT r m () Source #
MonadStConcreteNames m => MonadStConcreteNames (StateT s m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods runStConcreteNames :: StateT ConcreteNames (StateT s m) a -> StateT s m a Source # useConcreteNames :: StateT s m ConcreteNames Source # modifyConcreteNames :: (ConcreteNames -> ConcreteNames) -> StateT s m () Source #

stateTCLensM :: MonadTCState m => Lens' TCState a -> (a -> m (r, a)) -> m r Source #

Modify a part of the state monadically, and return some result.

data ModuleCheckMode Source #

Distinguishes between type-checked and scope-checked interfaces when stored in the map of VisitedModules.

Constructors

ModuleScopeChecked
ModuleTypeChecked

Instances

Instances details

Bounded ModuleCheckMode Source #

Instance details

Methods

minBound :: ModuleCheckMode #

maxBound :: ModuleCheckMode #

Enum ModuleCheckMode Source #

Instance details

Methods

succ :: ModuleCheckMode -> ModuleCheckMode #

pred :: ModuleCheckMode -> ModuleCheckMode #

toEnum :: Int -> ModuleCheckMode #

fromEnum :: ModuleCheckMode -> Int #

enumFrom :: ModuleCheckMode -> [ModuleCheckMode] #

enumFromThen :: ModuleCheckMode -> ModuleCheckMode -> [ModuleCheckMode] #

enumFromTo :: ModuleCheckMode -> ModuleCheckMode -> [ModuleCheckMode] #

enumFromThenTo :: ModuleCheckMode -> ModuleCheckMode -> ModuleCheckMode -> [ModuleCheckMode] #

Generic ModuleCheckMode Source #

Instance details

Associated Types

type Rep ModuleCheckMode
Instance details Defined in Agda.TypeChecking.Monad.Base type Rep ModuleCheckMode = D1 ('MetaData "ModuleCheckMode" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "ModuleScopeChecked" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "ModuleTypeChecked" 'PrefixI 'False) (U1 :: Type -> Type))

Methods

from :: ModuleCheckMode -> Rep ModuleCheckMode x #

to :: Rep ModuleCheckMode x -> ModuleCheckMode #

Show ModuleCheckMode Source #

Instance details

Methods

showsPrec :: Int -> ModuleCheckMode -> ShowS #

show :: ModuleCheckMode -> String #

showList :: [ModuleCheckMode] -> ShowS #

NFData ModuleCheckMode Source #

Instance details

Methods

rnf :: ModuleCheckMode -> () #

Eq ModuleCheckMode Source #

Instance details

Methods

(==) :: ModuleCheckMode -> ModuleCheckMode -> Bool #

(/=) :: ModuleCheckMode -> ModuleCheckMode -> Bool #

Ord ModuleCheckMode Source #

Instance details

Methods

compare :: ModuleCheckMode -> ModuleCheckMode -> Ordering #

(<) :: ModuleCheckMode -> ModuleCheckMode -> Bool #

(<=) :: ModuleCheckMode -> ModuleCheckMode -> Bool #

(>) :: ModuleCheckMode -> ModuleCheckMode -> Bool #

(>=) :: ModuleCheckMode -> ModuleCheckMode -> Bool #

max :: ModuleCheckMode -> ModuleCheckMode -> ModuleCheckMode #

min :: ModuleCheckMode -> ModuleCheckMode -> ModuleCheckMode #

type Rep ModuleCheckMode Source #

Instance details

type Rep ModuleCheckMode = D1 ('MetaData "ModuleCheckMode" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "ModuleScopeChecked" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "ModuleTypeChecked" 'PrefixI 'False) (U1 :: Type -> Type))

iFullHash :: Interface -> Hash Source #

Combines the source hash and the (full) hashes of the imported modules.

intSignature :: Lens' Interface Signature Source #

A lens for the iSignature field of the Interface type.

class LensClosure b a | b -> a where Source #

Methods

lensClosure :: Lens' b (Closure a) Source #

Instances

Instances details

LensClosure MetaInfo Range Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods lensClosure :: Lens' MetaInfo (Closure Range) Source #
LensClosure MetaVariable Range Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods lensClosure :: Lens' MetaVariable (Closure Range) Source #
LensClosure (Closure a) a Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods lensClosure :: Lens' (Closure a) (Closure a) Source #

class LensTCEnv a where Source #

Methods

lensTCEnv :: Lens' a TCEnv Source #

Instances

Instances details

LensTCEnv TCEnv Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods lensTCEnv :: Lens' TCEnv TCEnv Source #
LensTCEnv (Closure a) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods lensTCEnv :: Lens' (Closure a) TCEnv Source #

buildClosure :: (MonadTCEnv m, ReadTCState m) => a -> m (Closure a) Source #

data WhyCheckModality Source #

Why are we performing a modality check?

Constructors

ConstructorType	Because --without-K is enabled, so the types of data constructors must be usable at the context's modality.
IndexedClause	Because --without-K is enabled, so the result type of clauses must be usable at the context's modality.
IndexedClauseArg Name Name	Because --without-K is enabled, so any argument (second name) which mentions a dotted argument (first name) must have a type which is usable at the context's modality.
GeneratedClause	Because we double-check the --cubical-compatible clauses. This is an internal error!

Instances

Instances details

Generic WhyCheckModality Source #

Instance details

Associated Types

type Rep WhyCheckModality

Instance details

type Rep WhyCheckModality = D1 ('MetaData "WhyCheckModality" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) ((C1 ('MetaCons "ConstructorType" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "IndexedClause" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "IndexedClauseArg" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name)) :+: C1 ('MetaCons "GeneratedClause" 'PrefixI 'False) (U1 :: Type -> Type)))

Methods

from :: WhyCheckModality -> Rep WhyCheckModality x #

to :: Rep WhyCheckModality x -> WhyCheckModality #

Show WhyCheckModality Source #

Instance details

Methods

showsPrec :: Int -> WhyCheckModality -> ShowS #

show :: WhyCheckModality -> String #

showList :: [WhyCheckModality] -> ShowS #

NFData WhyCheckModality Source #

Instance details

Methods

rnf :: WhyCheckModality -> () #

type Rep WhyCheckModality Source #

Instance details

type Rep WhyCheckModality = D1 ('MetaData "WhyCheckModality" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) ((C1 ('MetaCons "ConstructorType" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "IndexedClause" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "IndexedClauseArg" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name)) :+: C1 ('MetaCons "GeneratedClause" 'PrefixI 'False) (U1 :: Type -> Type)))

data IsForced Source #

Information about whether an argument is forced by the type of a function.

Constructors

Forced
NotForced

Instances

Instances details

KillRange IsForced Source #

Instance details

Methods

killRange :: KillRangeT IsForced Source #

PrettyTCM IsForced Source #

Instance details

Defined in Agda.TypeChecking.Pretty

Methods

prettyTCM :: MonadPretty m => IsForced -> m Doc Source #

ChooseFlex IsForced Source #

Instance details

Defined in Agda.TypeChecking.Rules.LHS.Problem

Methods

chooseFlex :: IsForced -> IsForced -> FlexChoice Source #

EmbPrj IsForced Source #

Instance details

Defined in Agda.TypeChecking.Serialise.Instances.Internal

Methods

icode :: IsForced -> S Int32 Source #

icod_ :: IsForced -> S Int32 Source #

value :: Int32 -> R IsForced Source #

Generic IsForced Source #

Instance details

Associated Types

type Rep IsForced
Instance details Defined in Agda.TypeChecking.Monad.Base type Rep IsForced = D1 ('MetaData "IsForced" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "Forced" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "NotForced" 'PrefixI 'False) (U1 :: Type -> Type))

Methods

from :: IsForced -> Rep IsForced x #

to :: Rep IsForced x -> IsForced #

Show IsForced Source #

Instance details

Methods

showsPrec :: Int -> IsForced -> ShowS #

show :: IsForced -> String #

showList :: [IsForced] -> ShowS #

NFData IsForced Source #

Instance details

Methods

rnf :: IsForced -> () #

Eq IsForced Source #

Instance details

Methods

(==) :: IsForced -> IsForced -> Bool #

(/=) :: IsForced -> IsForced -> Bool #

type Rep IsForced Source #

Instance details

type Rep IsForced = D1 ('MetaData "IsForced" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "Forced" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "NotForced" 'PrefixI 'False) (U1 :: Type -> Type))

data Candidate Source #

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 candidateKind :: CandidateKind candidateTerm :: Term candidateType :: Type candidateOverlappable :: Bool

Instances

Instances details

Free Candidate Source #

Instance details

Methods

freeVars' :: IsVarSet a c => Candidate -> FreeM a c Source #

PrettyTCM Candidate Source #

Instance details

Defined in Agda.TypeChecking.Pretty

Methods

prettyTCM :: MonadPretty m => Candidate -> m Doc Source #

Instantiate Candidate Source #

Instance details

Defined in Agda.TypeChecking.Reduce

Methods

instantiate' :: Candidate -> ReduceM Candidate Source #

InstantiateFull Candidate Source #

Instance details

Defined in Agda.TypeChecking.Reduce

Methods

instantiateFull' :: Candidate -> ReduceM Candidate Source #

Normalise Candidate Source #

Instance details

Defined in Agda.TypeChecking.Reduce

Methods

normalise' :: Candidate -> ReduceM Candidate Source #

Reduce Candidate Source #

Instance details

Defined in Agda.TypeChecking.Reduce

Methods

reduce' :: Candidate -> ReduceM Candidate Source #

reduceB' :: Candidate -> ReduceM (Blocked Candidate) Source #

Simplify Candidate Source #

Instance details

Defined in Agda.TypeChecking.Reduce

Methods

simplify' :: Candidate -> ReduceM Candidate

Subst Candidate Source #

Instance details

Associated Types

type SubstArg Candidate
Instance details Defined in Agda.TypeChecking.Substitute type SubstArg Candidate = Term

Methods

applySubst :: Substitution' (SubstArg Candidate) -> Candidate -> Candidate Source #

Generic Candidate Source #

Instance details

Associated Types

type Rep Candidate

Instance details

type Rep Candidate = D1 ('MetaData "Candidate" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "Candidate" 'PrefixI 'True) ((S1 ('MetaSel ('Just "candidateKind") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 CandidateKind) :*: S1 ('MetaSel ('Just "candidateTerm") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term)) :*: (S1 ('MetaSel ('Just "candidateType") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type) :*: S1 ('MetaSel ('Just "candidateOverlappable") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool))))

Methods

from :: Candidate -> Rep Candidate x #

to :: Rep Candidate x -> Candidate #

Show Candidate Source #

Instance details

Methods

showsPrec :: Int -> Candidate -> ShowS #

show :: Candidate -> String #

showList :: [Candidate] -> ShowS #

NFData Candidate Source #

Instance details

Methods

rnf :: Candidate -> () #

Eq Candidate Source #

Instance details

Methods

(==) :: Candidate -> Candidate -> Bool #

(/=) :: Candidate -> Candidate -> Bool #

type SubstArg Candidate Source #

Instance details

type SubstArg Candidate = Term

type Rep Candidate Source #

Instance details

type Rep Candidate = D1 ('MetaData "Candidate" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "Candidate" 'PrefixI 'True) ((S1 ('MetaSel ('Just "candidateKind") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 CandidateKind) :*: S1 ('MetaSel ('Just "candidateTerm") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term)) :*: (S1 ('MetaSel ('Just "candidateType") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type) :*: S1 ('MetaSel ('Just "candidateOverlappable") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool))))

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

data Judgement a Source #

Parametrized since it is used without MetaId when creating a new meta.

Constructors

HasType
Fields jMetaId :: a jComparison :: Comparison are we checking (`CmpLeq`) or inferring (`CmpEq`) the type? jMetaType :: Type
IsSort
Fields jMetaId :: a jMetaType :: Type

Instances

Instances details

Pretty a => Pretty (Judgement a) Source #

Instance details

Methods

pretty :: Judgement a -> Doc Source #

prettyPrec :: Int -> Judgement a -> Doc Source #

prettyList :: [Judgement a] -> Doc Source #

PrettyTCM a => PrettyTCM (Judgement a) Source #

Instance details

Defined in Agda.TypeChecking.Pretty

Methods

prettyTCM :: MonadPretty m => Judgement a -> m Doc Source #

InstantiateFull (Judgement MetaId) Source #

Instance details

Defined in Agda.TypeChecking.Reduce

Methods

instantiateFull' :: Judgement MetaId -> ReduceM (Judgement MetaId) Source #

EmbPrj a => EmbPrj (Judgement a) Source #

Instance details

Defined in Agda.TypeChecking.Serialise.Instances.Internal

Methods

icode :: Judgement a -> S Int32 Source #

icod_ :: Judgement a -> S Int32 Source #

value :: Int32 -> R (Judgement a) Source #

Generic (Judgement a) Source #

Instance details

Associated Types

type Rep (Judgement a)

Instance details

type Rep (Judgement a) = D1 ('MetaData "Judgement" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "HasType" 'PrefixI 'True) (S1 ('MetaSel ('Just "jMetaId") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: (S1 ('MetaSel ('Just "jComparison") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Comparison) :*: S1 ('MetaSel ('Just "jMetaType") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type))) :+: C1 ('MetaCons "IsSort" 'PrefixI 'True) (S1 ('MetaSel ('Just "jMetaId") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "jMetaType") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type)))

Methods

from :: Judgement a -> Rep (Judgement a) x #

to :: Rep (Judgement a) x -> Judgement a #

Show a => Show (Judgement a) Source #

Instance details

Methods

showsPrec :: Int -> Judgement a -> ShowS #

show :: Judgement a -> String #

showList :: [Judgement a] -> ShowS #

NFData a => NFData (Judgement a) Source #

Instance details

Methods

rnf :: Judgement a -> () #

type Rep (Judgement a) Source #

Instance details

type Rep (Judgement a) = D1 ('MetaData "Judgement" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "HasType" 'PrefixI 'True) (S1 ('MetaSel ('Just "jMetaId") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: (S1 ('MetaSel ('Just "jComparison") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Comparison) :*: S1 ('MetaSel ('Just "jMetaType") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type))) :+: C1 ('MetaCons "IsSort" 'PrefixI 'True) (S1 ('MetaSel ('Just "jMetaId") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Just "jMetaType") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type)))

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

Instances details

KillRange DoGeneralize Source #

Instance details

Methods

killRange :: KillRangeT DoGeneralize Source #

EmbPrj DoGeneralize Source #

Instance details

Defined in Agda.TypeChecking.Serialise.Instances.Internal

Methods

icode :: DoGeneralize -> S Int32 Source #

icod_ :: DoGeneralize -> S Int32 Source #

value :: Int32 -> R DoGeneralize Source #

Generic DoGeneralize Source #

Instance details

Associated Types

type Rep DoGeneralize
Instance details Defined in Agda.TypeChecking.Monad.Base type Rep DoGeneralize = D1 ('MetaData "DoGeneralize" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "YesGeneralizeVar" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "YesGeneralizeMeta" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "NoGeneralize" 'PrefixI 'False) (U1 :: Type -> Type)))

Methods

from :: DoGeneralize -> Rep DoGeneralize x #

to :: Rep DoGeneralize x -> DoGeneralize #

Show DoGeneralize Source #

Instance details

Methods

showsPrec :: Int -> DoGeneralize -> ShowS #

show :: DoGeneralize -> String #

showList :: [DoGeneralize] -> ShowS #

NFData DoGeneralize Source #

Instance details

Methods

rnf :: DoGeneralize -> () #

Eq DoGeneralize Source #

Instance details

Methods

(==) :: DoGeneralize -> DoGeneralize -> Bool #

(/=) :: DoGeneralize -> DoGeneralize -> Bool #

Ord DoGeneralize Source #

Instance details

Methods

compare :: DoGeneralize -> DoGeneralize -> Ordering #

(<) :: DoGeneralize -> DoGeneralize -> Bool #

(<=) :: DoGeneralize -> DoGeneralize -> Bool #

(>) :: DoGeneralize -> DoGeneralize -> Bool #

(>=) :: DoGeneralize -> DoGeneralize -> Bool #

max :: DoGeneralize -> DoGeneralize -> DoGeneralize #

min :: DoGeneralize -> DoGeneralize -> DoGeneralize #

type Rep DoGeneralize Source #

Instance details

type Rep DoGeneralize = D1 ('MetaData "DoGeneralize" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "YesGeneralizeVar" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "YesGeneralizeMeta" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "NoGeneralize" 'PrefixI 'False) (U1 :: Type -> Type)))

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 genvalCheckpoint :: CheckpointId genvalTerm :: Term genvalType :: Type

Instances

Instances details

Generic GeneralizedValue Source #

Instance details

Associated Types

type Rep GeneralizedValue

Instance details

type Rep GeneralizedValue = D1 ('MetaData "GeneralizedValue" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "GeneralizedValue" 'PrefixI 'True) (S1 ('MetaSel ('Just "genvalCheckpoint") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 CheckpointId) :*: (S1 ('MetaSel ('Just "genvalTerm") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term) :*: S1 ('MetaSel ('Just "genvalType") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type))))

Methods

from :: GeneralizedValue -> Rep GeneralizedValue x #

to :: Rep GeneralizedValue x -> GeneralizedValue #

Show GeneralizedValue Source #

Instance details

Methods

showsPrec :: Int -> GeneralizedValue -> ShowS #

show :: GeneralizedValue -> String #

showList :: [GeneralizedValue] -> ShowS #

NFData GeneralizedValue Source #

Instance details

Methods

rnf :: GeneralizedValue -> () #

type Rep GeneralizedValue Source #

Instance details

type Rep GeneralizedValue = D1 ('MetaData "GeneralizedValue" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "GeneralizedValue" 'PrefixI 'True) (S1 ('MetaSel ('Just "genvalCheckpoint") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 CheckpointId) :*: (S1 ('MetaSel ('Just "genvalTerm") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term) :*: S1 ('MetaSel ('Just "genvalType") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type))))

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

Instances details

Show MetaPriority Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods showsPrec :: Int -> MetaPriority -> ShowS # show :: MetaPriority -> String # showList :: [MetaPriority] -> ShowS #
NFData MetaPriority Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods rnf :: MetaPriority -> () #
Eq MetaPriority Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods (==) :: MetaPriority -> MetaPriority -> Bool # (/=) :: MetaPriority -> MetaPriority -> Bool #
Ord MetaPriority Source #
Instance details 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 Listener Source #

Constructors

EtaExpand MetaId
CheckConstraint Nat ProblemConstraint

Instances

Instances details

Generic Listener Source #

Instance details

Associated Types

type Rep Listener

Instance details

type Rep Listener = D1 ('MetaData "Listener" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-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)))

Methods

from :: Listener -> Rep Listener x #

to :: Rep Listener x -> Listener #

NFData Listener Source #

Instance details

Methods

rnf :: Listener -> () #

Eq Listener Source #

Instance details

Methods

(==) :: Listener -> Listener -> Bool #

(/=) :: Listener -> Listener -> Bool #

Ord Listener Source #

Instance details

Methods

compare :: Listener -> Listener -> Ordering #

(<) :: Listener -> Listener -> Bool #

(<=) :: Listener -> Listener -> Bool #

(>) :: Listener -> Listener -> Bool #

(>=) :: Listener -> Listener -> Bool #

max :: Listener -> Listener -> Listener #

min :: Listener -> Listener -> Listener #

type Rep Listener Source #

Instance details

type Rep Listener = D1 ('MetaData "Listener" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-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 Frozen Source #

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

Instances

Instances details

Generic Frozen Source #

Instance details

Associated Types

type Rep Frozen
Instance details Defined in Agda.TypeChecking.Monad.Base type Rep Frozen = D1 ('MetaData "Frozen" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "Frozen" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "Instantiable" 'PrefixI 'False) (U1 :: Type -> Type))

Methods

from :: Frozen -> Rep Frozen x #

to :: Rep Frozen x -> Frozen #

Show Frozen Source #

Instance details

Methods

showsPrec :: Int -> Frozen -> ShowS #

show :: Frozen -> String #

showList :: [Frozen] -> ShowS #

NFData Frozen Source #

Instance details

Methods

rnf :: Frozen -> () #

Eq Frozen Source #

Instance details

Methods

(==) :: Frozen -> Frozen -> Bool #

(/=) :: Frozen -> Frozen -> Bool #

type Rep Frozen Source #

Instance details

type Rep Frozen = D1 ('MetaData "Frozen" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "Frozen" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "Instantiable" 'PrefixI 'False) (U1 :: Type -> Type))

data Instantiation Source #

Meta-variable instantiations.

Constructors

Instantiation
Fields instTel :: [Arg String] The solution is abstracted over these free variables. instBody :: Term The body of the solution.

Instances

Instances details

InstantiateFull Instantiation Source #

Instance details

Defined in Agda.TypeChecking.Reduce

Methods

instantiateFull' :: Instantiation -> ReduceM Instantiation Source #

EmbPrj Instantiation Source #

Instance details

Defined in Agda.TypeChecking.Serialise.Instances.Internal

Methods

icode :: Instantiation -> S Int32 Source #

icod_ :: Instantiation -> S Int32 Source #

value :: Int32 -> R Instantiation Source #

Generic Instantiation Source #

Instance details

Associated Types

type Rep Instantiation

Instance details

type Rep Instantiation = D1 ('MetaData "Instantiation" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "Instantiation" 'PrefixI 'True) (S1 ('MetaSel ('Just "instTel") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Arg String]) :*: S1 ('MetaSel ('Just "instBody") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term)))

Methods

from :: Instantiation -> Rep Instantiation x #

to :: Rep Instantiation x -> Instantiation #

Show Instantiation Source #

Instance details

Methods

showsPrec :: Int -> Instantiation -> ShowS #

show :: Instantiation -> String #

showList :: [Instantiation] -> ShowS #

NFData Instantiation Source #

Instance details

Methods

rnf :: Instantiation -> () #

type Rep Instantiation Source #

Instance details

type Rep Instantiation = D1 ('MetaData "Instantiation" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "Instantiation" 'PrefixI 'True) (S1 ('MetaSel ('Just "instTel") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Arg String]) :*: S1 ('MetaSel ('Just "instBody") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term)))

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	`(λ (xs : t₀) → e) : t` This is not an instance of `CheckExpr` as the domain type has already been checked. For example, when checking `(λ (x y : Fin _) → e) : (x : Fin n) → ?` we want to postpone `(λ (y : Fin n) → e) : ?` where `Fin n` is a `Type` rather than an `Expr`.
DoQuoteTerm Comparison Term Type	Quote the given term and check type against `Term`

Instances

Instances details

PrettyTCM TypeCheckingProblem Source #

Instance details

Defined in Agda.TypeChecking.Pretty

Methods

prettyTCM :: MonadPretty m => TypeCheckingProblem -> m Doc Source #

Generic TypeCheckingProblem Source #

Instance details

Associated Types

type Rep TypeCheckingProblem

Instance details

Methods

from :: TypeCheckingProblem -> Rep TypeCheckingProblem x #

to :: Rep TypeCheckingProblem x -> TypeCheckingProblem #

NFData TypeCheckingProblem Source #

Instance details

Methods

rnf :: TypeCheckingProblem -> () #

type Rep TypeCheckingProblem Source #

Instance details

LensModality RemoteMetaVariable Source #

data RemoteMetaVariable Source #

Information about remote meta-variables.

Remote meta-variables are meta-variables originating in other modules. These meta-variables are always instantiated. We do not retain all the information about a local meta-variable when creating an interface:

The mvPriority field is not needed, because the meta-variable cannot be instantiated.
The mvFrozen field is not needed, because there is no point in freezing instantiated meta-variables.
The mvListeners field is not needed, because no meta-variable should be listening to this one.
The mvTwin field is not needed, because the meta-variable has already been instantiated.
The mvPermutation is currently removed, but could be retained if it turns out to be useful for something.
The only part of the mvInfo field that is kept is the miModality field. The miMetaOccursCheck and miGeneralizable fields are omitted, because the meta-variable has already been instantiated. The Range that is part of the miClosRange field and the miNameSuggestion field are omitted because instantiated meta-variables are typically not presented to users. Finally the Closure part of the miClosRange field is omitted because it can be large (at least if we ignore potential sharing).

Constructors

RemoteMetaVariable
Fields rmvInstantiation :: Instantiation rmvModality :: Modality rmvJudgement :: Judgement MetaId

Instances

Instances details

Instance details

LensQuantity RemoteMetaVariable Source #

Methods

getModality :: RemoteMetaVariable -> Modality Source #

setModality :: Modality -> RemoteMetaVariable -> RemoteMetaVariable Source #

mapModality :: (Modality -> Modality) -> RemoteMetaVariable -> RemoteMetaVariable Source #

Instance details

LensRelevance RemoteMetaVariable Source #

Methods

getQuantity :: RemoteMetaVariable -> Quantity Source #

setQuantity :: Quantity -> RemoteMetaVariable -> RemoteMetaVariable Source #

mapQuantity :: (Quantity -> Quantity) -> RemoteMetaVariable -> RemoteMetaVariable Source #

Instance details

InstantiateFull RemoteMetaVariable Source #

Methods

getRelevance :: RemoteMetaVariable -> Relevance Source #

setRelevance :: Relevance -> RemoteMetaVariable -> RemoteMetaVariable Source #

mapRelevance :: (Relevance -> Relevance) -> RemoteMetaVariable -> RemoteMetaVariable Source #

Instance details

Defined in Agda.TypeChecking.Reduce

Methods

instantiateFull' :: RemoteMetaVariable -> ReduceM RemoteMetaVariable Source #

EmbPrj RemoteMetaVariable Source #

Instance details

Defined in Agda.TypeChecking.Serialise.Instances.Internal

Methods

icode :: RemoteMetaVariable -> S Int32 Source #

icod_ :: RemoteMetaVariable -> S Int32 Source #

value :: Int32 -> R RemoteMetaVariable Source #

Generic RemoteMetaVariable Source #

Instance details

Associated Types

type Rep RemoteMetaVariable

Instance details

type Rep RemoteMetaVariable = D1 ('MetaData "RemoteMetaVariable" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "RemoteMetaVariable" 'PrefixI 'True) (S1 ('MetaSel ('Just "rmvInstantiation") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Instantiation) :*: (S1 ('MetaSel ('Just "rmvModality") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Modality) :*: S1 ('MetaSel ('Just "rmvJudgement") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Judgement MetaId)))))

Methods

from :: RemoteMetaVariable -> Rep RemoteMetaVariable x #

to :: Rep RemoteMetaVariable x -> RemoteMetaVariable #

Show RemoteMetaVariable Source #

Instance details

Methods

showsPrec :: Int -> RemoteMetaVariable -> ShowS #

show :: RemoteMetaVariable -> String #

showList :: [RemoteMetaVariable] -> ShowS #

NFData RemoteMetaVariable Source #

Instance details

Methods

rnf :: RemoteMetaVariable -> () #

type Rep RemoteMetaVariable Source #

Instance details

type Rep RemoteMetaVariable = D1 ('MetaData "RemoteMetaVariable" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "RemoteMetaVariable" 'PrefixI 'True) (S1 ('MetaSel ('Just "rmvInstantiation") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Instantiation) :*: (S1 ('MetaSel ('Just "rmvModality") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Modality) :*: S1 ('MetaSel ('Just "rmvJudgement") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Judgement MetaId)))))

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 PrincipalArgTypeMetas Source #

Constructors

PrincipalArgTypeMetas
Fields patmMetas :: Args metas created for hidden and instance arguments in the principal argument's type patmRemainder :: Type principal argument's type, stripped of hidden and instance arguments

Instances

Instances details

Generic PrincipalArgTypeMetas Source #

Instance details

Associated Types

type Rep PrincipalArgTypeMetas

Instance details

type Rep PrincipalArgTypeMetas = D1 ('MetaData "PrincipalArgTypeMetas" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-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)))

Methods

from :: PrincipalArgTypeMetas -> Rep PrincipalArgTypeMetas x #

to :: Rep PrincipalArgTypeMetas x -> PrincipalArgTypeMetas #

NFData PrincipalArgTypeMetas Source #

Instance details

Methods

rnf :: PrincipalArgTypeMetas -> () #

type Rep PrincipalArgTypeMetas Source #

Instance details

type Rep PrincipalArgTypeMetas = D1 ('MetaData "PrincipalArgTypeMetas" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-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 ExpandHidden Source #

Constructors

ExpandLast	Add implicit arguments in the end until type is no longer hidden `Pi`.
DontExpandLast	Do not append implicit arguments.
ReallyDontExpandLast	Makes `doExpandLast` have no effect. Used to avoid implicit insertion of arguments to metavariables.

Instances

Instances details

Generic ExpandHidden Source #

Instance details

Associated Types

type Rep ExpandHidden
Instance details Defined in Agda.TypeChecking.Monad.Base type Rep ExpandHidden = D1 ('MetaData "ExpandHidden" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-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)))

Methods

from :: ExpandHidden -> Rep ExpandHidden x #

to :: Rep ExpandHidden x -> ExpandHidden #

NFData ExpandHidden Source #

Instance details

Methods

rnf :: ExpandHidden -> () #

Eq ExpandHidden Source #

Instance details

Methods

(==) :: ExpandHidden -> ExpandHidden -> Bool #

(/=) :: ExpandHidden -> ExpandHidden -> Bool #

type Rep ExpandHidden Source #

Instance details

type Rep ExpandHidden = D1 ('MetaData "ExpandHidden" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-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 ArgsCheckState a Source #

Constructors

ACState
Fields acRanges :: [Maybe Range] Ranges of checked arguments, where present. e.g. inserted implicits have no correponding abstract syntax. acElims :: Elims Checked and inserted arguments so far. acConstraints :: [Maybe (Abs Constraint)] Constraints for the head so far, i.e. before applying the correponding elim. acType :: Type Type for the rest of the application. acData :: a

Instances

Instances details

Show a => Show (ArgsCheckState a) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods showsPrec :: Int -> ArgsCheckState a -> ShowS # show :: ArgsCheckState a -> String # showList :: [ArgsCheckState a] -> ShowS #

type MetaNameSuggestion = String Source #

Name suggestion for meta variable. Empty string means no suggestion.

suffixNameSuggestion :: MetaNameSuggestion -> ArgName -> MetaNameSuggestion Source #

Append an ArgName to a MetaNameSuggestion, for computing the name suggestions of eta-expansion metas. If the MetaNameSuggestion is empty or an underscore, the field name is taken as the suggestion.

normalMetaPriority :: MetaPriority Source #

lowMetaPriority :: MetaPriority Source #

highMetaPriority :: MetaPriority Source #

getMetaScope :: MetaVariable -> ScopeInfo Source #

getMetaEnv :: MetaVariable -> TCEnv Source #

getMetaSig :: MetaVariable -> Signature Source #

metaFrozen :: Lens' MetaVariable Frozen Source #

_mvInfo :: Lens' MetaVariable MetaInfo Source #

aModeToDef :: AbstractMode -> Maybe IsAbstract Source #

aDefToMode :: IsAbstract -> AbstractMode Source #

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
Fields ipRange :: Range The position of the interaction point. ipMeta :: Maybe MetaId The meta variable, if any, holding the type etc. ipSolved :: Bool Has this interaction point already been solved? ipClause :: IPClause The clause of the interaction point (if any). Used for case splitting. ipBoundary :: IPBoundary

Instances

Instances details

HasTag InteractionPoint Source #

Instance details

Associated Types

type Tag InteractionPoint
Instance details Defined in Agda.TypeChecking.Monad.Base type Tag InteractionPoint = MetaId

Methods

tag :: InteractionPoint -> Maybe (Tag InteractionPoint) Source #

Generic InteractionPoint Source #

Instance details

Associated Types

type Rep InteractionPoint

Instance details

type Rep InteractionPoint = D1 ('MetaData "InteractionPoint" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "InteractionPoint" 'PrefixI 'True) ((S1 ('MetaSel ('Just "ipRange") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Range) :*: S1 ('MetaSel ('Just "ipMeta") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe MetaId))) :*: (S1 ('MetaSel ('Just "ipSolved") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool) :*: (S1 ('MetaSel ('Just "ipClause") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 IPClause) :*: S1 ('MetaSel ('Just "ipBoundary") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 IPBoundary)))))

Methods

from :: InteractionPoint -> Rep InteractionPoint x #

to :: Rep InteractionPoint x -> InteractionPoint #

NFData InteractionPoint Source #

Instance details

Methods

rnf :: InteractionPoint -> () #

NFData InteractionPoints Source #

Instance details

Methods

rnf :: InteractionPoints -> () #

Eq InteractionPoint Source #

Instance details

Methods

(==) :: InteractionPoint -> InteractionPoint -> Bool #

(/=) :: InteractionPoint -> InteractionPoint -> Bool #

type Tag InteractionPoint Source #

Instance details

type Tag InteractionPoint = MetaId

type Rep InteractionPoint Source #

Instance details

type Rep InteractionPoint = D1 ('MetaData "InteractionPoint" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "InteractionPoint" 'PrefixI 'True) ((S1 ('MetaSel ('Just "ipRange") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Range) :*: S1 ('MetaSel ('Just "ipMeta") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe MetaId))) :*: (S1 ('MetaSel ('Just "ipSolved") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool) :*: (S1 ('MetaSel ('Just "ipClause") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 IPClause) :*: S1 ('MetaSel ('Just "ipBoundary") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 IPBoundary)))))

data IPClause Source #

Which clause is an interaction point located in?

Constructors

IPClause
Fields ipcQName :: QName The name of the function. ipcClauseNo :: Int The number of the clause of this function. ipcType :: Type The type of the function ipcWithSub :: Maybe Substitution Module parameter substitution ipcClause :: SpineClause The original AST clause. ipcClosure :: Closure () Environment for rechecking the clause.
IPNoClause	The interaction point is not in the rhs of a clause.

Instances

Instances details

Generic IPClause Source #

Instance details

Associated Types

type Rep IPClause

Instance details

type Rep IPClause = D1 ('MetaData "IPClause" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "IPClause" 'PrefixI 'True) ((S1 ('MetaSel ('Just "ipcQName") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName) :*: (S1 ('MetaSel ('Just "ipcClauseNo") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Int) :*: S1 ('MetaSel ('Just "ipcType") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type))) :*: (S1 ('MetaSel ('Just "ipcWithSub") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe Substitution)) :*: (S1 ('MetaSel ('Just "ipcClause") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 SpineClause) :*: S1 ('MetaSel ('Just "ipcClosure") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Closure ()))))) :+: C1 ('MetaCons "IPNoClause" 'PrefixI 'False) (U1 :: Type -> Type))

Methods

from :: IPClause -> Rep IPClause x #

to :: Rep IPClause x -> IPClause #

NFData IPClause Source #

Instance details

Methods

rnf :: IPClause -> () #

Eq IPClause Source #

Instance details

Methods

(==) :: IPClause -> IPClause -> Bool #

(/=) :: IPClause -> IPClause -> Bool #

type Rep IPClause Source #

Instance details

type Rep IPClause = D1 ('MetaData "IPClause" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "IPClause" 'PrefixI 'True) ((S1 ('MetaSel ('Just "ipcQName") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName) :*: (S1 ('MetaSel ('Just "ipcClauseNo") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Int) :*: S1 ('MetaSel ('Just "ipcType") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type))) :*: (S1 ('MetaSel ('Just "ipcWithSub") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe Substitution)) :*: (S1 ('MetaSel ('Just "ipcClause") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 SpineClause) :*: S1 ('MetaSel ('Just "ipcClosure") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Closure ()))))) :+: C1 ('MetaCons "IPNoClause" 'PrefixI 'False) (U1 :: Type -> Type))

type IPBoundary = IPBoundary' Term Source #

newtype IPBoundary' t Source #

Constructors

IPBoundary
Fields getBoundary :: Map (IntMap Bool) t

Instances

Instances details

Foldable IPBoundary' Source #

Instance details

Methods

fold :: Monoid m => IPBoundary' m -> m #

foldMap :: Monoid m => (a -> m) -> IPBoundary' a -> m #

foldMap' :: Monoid m => (a -> m) -> IPBoundary' a -> m #

foldr :: (a -> b -> b) -> b -> IPBoundary' a -> b #

foldr' :: (a -> b -> b) -> b -> IPBoundary' a -> b #

foldl :: (b -> a -> b) -> b -> IPBoundary' a -> b #

foldl' :: (b -> a -> b) -> b -> IPBoundary' a -> b #

foldr1 :: (a -> a -> a) -> IPBoundary' a -> a #

foldl1 :: (a -> a -> a) -> IPBoundary' a -> a #

toList :: IPBoundary' a -> [a] #

null :: IPBoundary' a -> Bool #

length :: IPBoundary' a -> Int #

elem :: Eq a => a -> IPBoundary' a -> Bool #

maximum :: Ord a => IPBoundary' a -> a #

minimum :: Ord a => IPBoundary' a -> a #

sum :: Num a => IPBoundary' a -> a #

product :: Num a => IPBoundary' a -> a #

Traversable IPBoundary' Source #

Instance details

Methods

traverse :: Applicative f => (a -> f b) -> IPBoundary' a -> f (IPBoundary' b) #

sequenceA :: Applicative f => IPBoundary' (f a) -> f (IPBoundary' a) #

mapM :: Monad m => (a -> m b) -> IPBoundary' a -> m (IPBoundary' b) #

sequence :: Monad m => IPBoundary' (m a) -> m (IPBoundary' a) #

Functor IPBoundary' Source #

Instance details

Methods

fmap :: (a -> b) -> IPBoundary' a -> IPBoundary' b #

(<$) :: a -> IPBoundary' b -> IPBoundary' a #

ToConcrete a => ToConcrete (IPBoundary' a) Source #

Instance details

Defined in Agda.Interaction.BasicOps

Associated Types

type ConOfAbs (IPBoundary' a)
Instance details Defined in Agda.Interaction.BasicOps type ConOfAbs (IPBoundary' a) = IPBoundary' (ConOfAbs a)

Methods

toConcrete :: IPBoundary' a -> AbsToCon (ConOfAbs (IPBoundary' a)) Source #

bindToConcrete :: IPBoundary' a -> (ConOfAbs (IPBoundary' a) -> AbsToCon b) -> AbsToCon b Source #

Reify a => Reify (IPBoundary' a) Source #

Instance details

Defined in Agda.Interaction.BasicOps

Associated Types

type ReifiesTo (IPBoundary' a)
Instance details Defined in Agda.Interaction.BasicOps type ReifiesTo (IPBoundary' a) = IPBoundary' (ReifiesTo a)

Methods

reify :: MonadReify m => IPBoundary' a -> m (ReifiesTo (IPBoundary' a)) Source #

reifyWhen :: MonadReify m => Bool -> IPBoundary' a -> m (ReifiesTo (IPBoundary' a)) Source #

Instantiate t => Instantiate (IPBoundary' t) Source #

Instance details

Defined in Agda.TypeChecking.Reduce

Methods

instantiate' :: IPBoundary' t -> ReduceM (IPBoundary' t) Source #

InstantiateFull t => InstantiateFull (IPBoundary' t) Source #

Instance details

Defined in Agda.TypeChecking.Reduce

Methods

instantiateFull' :: IPBoundary' t -> ReduceM (IPBoundary' t) Source #

Normalise t => Normalise (IPBoundary' t) Source #

Instance details

Defined in Agda.TypeChecking.Reduce

Methods

normalise' :: IPBoundary' t -> ReduceM (IPBoundary' t) Source #

Reduce t => Reduce (IPBoundary' t) Source #

Instance details

Defined in Agda.TypeChecking.Reduce

Methods

reduce' :: IPBoundary' t -> ReduceM (IPBoundary' t) Source #

reduceB' :: IPBoundary' t -> ReduceM (Blocked (IPBoundary' t)) Source #

Simplify t => Simplify (IPBoundary' t) Source #

Instance details

Defined in Agda.TypeChecking.Reduce

Methods

simplify' :: IPBoundary' t -> ReduceM (IPBoundary' t)

Generic (IPBoundary' t) Source #

Instance details

Associated Types

type Rep (IPBoundary' t)
Instance details Defined in Agda.TypeChecking.Monad.Base type Rep (IPBoundary' t) = D1 ('MetaData "IPBoundary'" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'True) (C1 ('MetaCons "IPBoundary" 'PrefixI 'True) (S1 ('MetaSel ('Just "getBoundary") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Map (IntMap Bool) t))))

Methods

from :: IPBoundary' t -> Rep (IPBoundary' t) x #

to :: Rep (IPBoundary' t) x -> IPBoundary' t #

Show t => Show (IPBoundary' t) Source #

Instance details

Methods

showsPrec :: Int -> IPBoundary' t -> ShowS #

show :: IPBoundary' t -> String #

showList :: [IPBoundary' t] -> ShowS #

NFData t => NFData (IPBoundary' t) Source #

Instance details

Methods

rnf :: IPBoundary' t -> () #

type ConOfAbs (IPBoundary' a) Source #

Instance details

Defined in Agda.Interaction.BasicOps

type ConOfAbs (IPBoundary' a) = IPBoundary' (ConOfAbs a)

type ReifiesTo (IPBoundary' a) Source #

Instance details

Defined in Agda.Interaction.BasicOps

type ReifiesTo (IPBoundary' a) = IPBoundary' (ReifiesTo a)

type Rep (IPBoundary' t) Source #

Instance details

type Rep (IPBoundary' t) = D1 ('MetaData "IPBoundary'" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'True) (C1 ('MetaCons "IPBoundary" 'PrefixI 'True) (S1 ('MetaSel ('Just "getBoundary") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Map (IntMap Bool) t))))

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

Instances details

Generic Overapplied Source #

Instance details

Associated Types

type Rep Overapplied
Instance details Defined in Agda.TypeChecking.Monad.Base type Rep Overapplied = D1 ('MetaData "Overapplied" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "Overapplied" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "NotOverapplied" 'PrefixI 'False) (U1 :: Type -> Type))

Methods

from :: Overapplied -> Rep Overapplied x #

to :: Rep Overapplied x -> Overapplied #

Show Overapplied Source #

Instance details

Methods

showsPrec :: Int -> Overapplied -> ShowS #

show :: Overapplied -> String #

showList :: [Overapplied] -> ShowS #

NFData Overapplied Source #

Instance details

Methods

rnf :: Overapplied -> () #

Eq Overapplied Source #

Instance details

Methods

(==) :: Overapplied -> Overapplied -> Bool #

(/=) :: Overapplied -> Overapplied -> Bool #

type Rep Overapplied Source #

Instance details

type Rep Overapplied = D1 ('MetaData "Overapplied" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "Overapplied" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "NotOverapplied" 'PrefixI 'False) (U1 :: Type -> Type))

type Sections = Map ModuleName Section Source #

type RewriteRuleMap = HashMap QName RewriteRules Source #

sigSections :: Lens' Signature Sections Source #

sigDefinitions :: Lens' Signature Definitions Source #

sigRewriteRules :: Lens' Signature RewriteRuleMap Source #

type LocalDisplayForm = Open DisplayForm Source #

secTelescope :: Lens' Section Telescope Source #

data DisplayTerm Source #

A structured presentation of a Term for reification into Syntax.

Constructors

DWithApp DisplayTerm [DisplayTerm] Elims	`(f vs \| ws) es`. The first `DisplayTerm` is the parent function `f` with its args `vs`. The list of `DisplayTerm`s are the with expressions `ws`. The `Elims` are additional arguments `es` (possible in case the with-application is of function type) or projections (if it is of record type).
DCon ConHead ConInfo [Arg DisplayTerm]	`c vs`.
DDef QName [Elim' DisplayTerm]	`d vs`.
DDot' Term Elims	`.(v es)`. See `DTerm'`.
DTerm' Term Elims	`v es`. This is a frozen elimination that is not always safe to run, because display forms may be ill-typed. (See issue #6476.)

Instances

Instances details

Pretty DisplayTerm Source #

Instance details

Methods

pretty :: DisplayTerm -> Doc Source #

prettyPrec :: Int -> DisplayTerm -> Doc Source #

prettyList :: [DisplayTerm] -> Doc Source #

NamesIn DisplayTerm Source #

Instance details

Methods

namesAndMetasIn' :: Monoid m => (Either QName MetaId -> m) -> DisplayTerm -> m Source #

KillRange DisplayTerm Source #

Instance details

Methods

killRange :: KillRangeT DisplayTerm Source #

Reify DisplayTerm Source #

Instance details

Defined in Agda.Syntax.Translation.InternalToAbstract

Associated Types

type ReifiesTo DisplayTerm
Instance details Defined in Agda.Syntax.Translation.InternalToAbstract type ReifiesTo DisplayTerm = Expr

Methods

reify :: MonadReify m => DisplayTerm -> m (ReifiesTo DisplayTerm) Source #

reifyWhen :: MonadReify m => Bool -> DisplayTerm -> m (ReifiesTo DisplayTerm) Source #

Free DisplayTerm Source #

Instance details

Methods

freeVars' :: IsVarSet a c => DisplayTerm -> FreeM a c Source #

PrettyTCM DisplayTerm Source #

Instance details

Defined in Agda.TypeChecking.Pretty

Methods

prettyTCM :: MonadPretty m => DisplayTerm -> m Doc Source #

InstantiateFull DisplayTerm Source #

Instance details

Defined in Agda.TypeChecking.Reduce

Methods

instantiateFull' :: DisplayTerm -> ReduceM DisplayTerm Source #

EmbPrj DisplayTerm Source #

Instance details

Defined in Agda.TypeChecking.Serialise.Instances.Internal

Methods

icode :: DisplayTerm -> S Int32 Source #

icod_ :: DisplayTerm -> S Int32 Source #

value :: Int32 -> R DisplayTerm Source #

Apply DisplayTerm Source #

Instance details

Methods

apply :: DisplayTerm -> Args -> DisplayTerm Source #

applyE :: DisplayTerm -> Elims -> DisplayTerm Source #

Subst DisplayTerm Source #

Instance details

Associated Types

type SubstArg DisplayTerm
Instance details Defined in Agda.TypeChecking.Substitute type SubstArg DisplayTerm = Term

Methods

applySubst :: Substitution' (SubstArg DisplayTerm) -> DisplayTerm -> DisplayTerm Source #

Generic DisplayTerm Source #

Instance details

Associated Types

type Rep DisplayTerm

Instance details

Methods

from :: DisplayTerm -> Rep DisplayTerm x #

to :: Rep DisplayTerm x -> DisplayTerm #

Show DisplayTerm Source #

Instance details

Methods

showsPrec :: Int -> DisplayTerm -> ShowS #

show :: DisplayTerm -> String #

showList :: [DisplayTerm] -> ShowS #

NFData DisplayTerm Source #

Instance details

Methods

rnf :: DisplayTerm -> () #

PrettyTCM (Elim' DisplayTerm) Source #

Instance details

Defined in Agda.TypeChecking.Pretty

Methods

prettyTCM :: MonadPretty m => Elim' DisplayTerm -> m Doc Source #

type ReifiesTo DisplayTerm Source #

Instance details

Defined in Agda.Syntax.Translation.InternalToAbstract

type ReifiesTo DisplayTerm = Expr

type SubstArg DisplayTerm Source #

Instance details

type SubstArg DisplayTerm = Term

type Rep DisplayTerm Source #

Instance details

pattern DDot :: Term -> DisplayTerm Source #

pattern DTerm :: Term -> DisplayTerm Source #

defaultDisplayForm :: QName -> [LocalDisplayForm] Source #

By default, we have no display form.

type PElims = [Elim' NLPat] Source #

data NLPType Source #

Constructors

NLPType
Fields nlpTypeSort :: NLPSort nlpTypeUnEl :: NLPat

Instances

Instances details

TermLike NLPType Source #

Instance details

Methods

traverseTermM :: Monad m => (Term -> m Term) -> NLPType -> m NLPType Source #

foldTerm :: Monoid m => (Term -> m) -> NLPType -> m Source #

AllMetas NLPType Source #

Instance details

Methods

allMetas :: Monoid m => (MetaId -> m) -> NLPType -> m Source #

NamesIn NLPType Source #

Instance details

Methods

namesAndMetasIn' :: Monoid m => (Either QName MetaId -> m) -> NLPType -> m Source #

KillRange NLPType Source #

Instance details

Methods

killRange :: KillRangeT NLPType Source #

Free NLPType Source #

Instance details

Defined in Agda.TypeChecking.Rewriting.NonLinPattern

Methods

freeVars' :: IsVarSet a c => NLPType -> FreeM a c Source #

PrettyTCM NLPType Source #

Instance details

Defined in Agda.TypeChecking.Pretty

Methods

prettyTCM :: MonadPretty m => NLPType -> m Doc Source #

InstantiateFull NLPType Source #

Instance details

Defined in Agda.TypeChecking.Reduce

Methods

instantiateFull' :: NLPType -> ReduceM NLPType Source #

GetMatchables NLPType Source #

Instance details

Defined in Agda.TypeChecking.Rewriting.NonLinPattern

Methods

getMatchables :: NLPType -> [QName] Source #

NLPatVars NLPType Source #

Instance details

Defined in Agda.TypeChecking.Rewriting.NonLinPattern

Methods

nlPatVarsUnder :: Int -> NLPType -> IntSet Source #

nlPatVars :: NLPType -> IntSet Source #

EmbPrj NLPType Source #

Instance details

Defined in Agda.TypeChecking.Serialise.Instances.Internal

Methods

icode :: NLPType -> S Int32 Source #

icod_ :: NLPType -> S Int32 Source #

value :: Int32 -> R NLPType Source #

Subst NLPType Source #

Instance details

Associated Types

type SubstArg NLPType
Instance details Defined in Agda.TypeChecking.Substitute type SubstArg NLPType = NLPat

Methods

applySubst :: Substitution' (SubstArg NLPType) -> NLPType -> NLPType Source #

Generic NLPType Source #

Instance details

Associated Types

type Rep NLPType

Instance details

type Rep NLPType = D1 ('MetaData "NLPType" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "NLPType" 'PrefixI 'True) (S1 ('MetaSel ('Just "nlpTypeSort") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 NLPSort) :*: S1 ('MetaSel ('Just "nlpTypeUnEl") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 NLPat)))

Methods

from :: NLPType -> Rep NLPType x #

to :: Rep NLPType x -> NLPType #

Show NLPType Source #

Instance details

Methods

showsPrec :: Int -> NLPType -> ShowS #

show :: NLPType -> String #

showList :: [NLPType] -> ShowS #

NFData NLPType Source #

Instance details

Methods

rnf :: NLPType -> () #

Match NLPType Type Source #

Instance details

Methods

match :: Relevance -> Telescope -> Telescope -> TypeOf Type -> NLPType -> Type -> NLM () Source #

NLPatToTerm NLPType Type Source #

Instance details

Defined in Agda.TypeChecking.Rewriting.NonLinPattern

Methods

nlPatToTerm :: PureTCM m => NLPType -> m Type Source #

PatternFrom Type NLPType Source #

Instance details

Defined in Agda.TypeChecking.Rewriting.NonLinPattern

Methods

patternFrom :: Relevance -> Int -> TypeOf Type -> Type -> TCM NLPType Source #

type SubstArg NLPType Source #

Instance details

type SubstArg NLPType = NLPat

type Rep NLPType Source #

Instance details

type Rep NLPType = D1 ('MetaData "NLPType" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "NLPType" 'PrefixI 'True) (S1 ('MetaSel ('Just "nlpTypeSort") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 NLPSort) :*: S1 ('MetaSel ('Just "nlpTypeUnEl") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 NLPat)))

data NLPSort Source #

Constructors

PUniv Univ NLPat
PInf Univ Integer
PSizeUniv
PLockUniv
PLevelUniv
PIntervalUniv

Instances

Instances details

TermLike NLPSort Source #

Instance details

Methods

traverseTermM :: Monad m => (Term -> m Term) -> NLPSort -> m NLPSort Source #

foldTerm :: Monoid m => (Term -> m) -> NLPSort -> m Source #

AllMetas NLPSort Source #

Instance details

Methods

allMetas :: Monoid m => (MetaId -> m) -> NLPSort -> m Source #

NamesIn NLPSort Source #

Instance details

Methods

namesAndMetasIn' :: Monoid m => (Either QName MetaId -> m) -> NLPSort -> m Source #

KillRange NLPSort Source #

Instance details

Methods

killRange :: KillRangeT NLPSort Source #

Free NLPSort Source #

Instance details

Defined in Agda.TypeChecking.Rewriting.NonLinPattern

Methods

freeVars' :: IsVarSet a c => NLPSort -> FreeM a c Source #

PrettyTCM NLPSort Source #

Instance details

Defined in Agda.TypeChecking.Pretty

Methods

prettyTCM :: MonadPretty m => NLPSort -> m Doc Source #

InstantiateFull NLPSort Source #

Instance details

Defined in Agda.TypeChecking.Reduce

Methods

instantiateFull' :: NLPSort -> ReduceM NLPSort Source #

GetMatchables NLPSort Source #

Instance details

Defined in Agda.TypeChecking.Rewriting.NonLinPattern

Methods

getMatchables :: NLPSort -> [QName] Source #

NLPatVars NLPSort Source #

Instance details

Defined in Agda.TypeChecking.Rewriting.NonLinPattern

Methods

nlPatVarsUnder :: Int -> NLPSort -> IntSet Source #

nlPatVars :: NLPSort -> IntSet Source #

EmbPrj NLPSort Source #

Instance details

Defined in Agda.TypeChecking.Serialise.Instances.Internal

Methods

icode :: NLPSort -> S Int32 Source #

icod_ :: NLPSort -> S Int32 Source #

value :: Int32 -> R NLPSort Source #

Subst NLPSort Source #

Instance details

Associated Types

type SubstArg NLPSort
Instance details Defined in Agda.TypeChecking.Substitute type SubstArg NLPSort = NLPat

Methods

applySubst :: Substitution' (SubstArg NLPSort) -> NLPSort -> NLPSort Source #

Generic NLPSort Source #

Instance details

Associated Types

type Rep NLPSort

Instance details

type Rep NLPSort = D1 ('MetaData "NLPSort" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) ((C1 ('MetaCons "PUniv" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Univ) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 NLPat)) :+: (C1 ('MetaCons "PInf" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Univ) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Integer)) :+: C1 ('MetaCons "PSizeUniv" 'PrefixI 'False) (U1 :: Type -> Type))) :+: (C1 ('MetaCons "PLockUniv" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "PLevelUniv" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "PIntervalUniv" 'PrefixI 'False) (U1 :: Type -> Type))))

Methods

from :: NLPSort -> Rep NLPSort x #

to :: Rep NLPSort x -> NLPSort #

Show NLPSort Source #

Instance details

Methods

showsPrec :: Int -> NLPSort -> ShowS #

show :: NLPSort -> String #

showList :: [NLPSort] -> ShowS #

NFData NLPSort Source #

Instance details

Methods

rnf :: NLPSort -> () #

Match NLPSort Sort Source #

Instance details

Methods

match :: Relevance -> Telescope -> Telescope -> TypeOf Sort -> NLPSort -> Sort -> NLM () Source #

NLPatToTerm NLPSort Sort Source #

Instance details

Defined in Agda.TypeChecking.Rewriting.NonLinPattern

Methods

nlPatToTerm :: PureTCM m => NLPSort -> m Sort Source #

PatternFrom Sort NLPSort Source #

Instance details

Defined in Agda.TypeChecking.Rewriting.NonLinPattern

Methods

patternFrom :: Relevance -> Int -> TypeOf Sort -> Sort -> TCM NLPSort Source #

type SubstArg NLPSort Source #

Instance details

type SubstArg NLPSort = NLPat

type Rep NLPSort Source #

Instance details

type Rep NLPSort = D1 ('MetaData "NLPSort" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) ((C1 ('MetaCons "PUniv" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Univ) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 NLPat)) :+: (C1 ('MetaCons "PInf" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Univ) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Integer)) :+: C1 ('MetaCons "PSizeUniv" 'PrefixI 'False) (U1 :: Type -> Type))) :+: (C1 ('MetaCons "PLockUniv" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "PLevelUniv" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "PIntervalUniv" 'PrefixI 'False) (U1 :: Type -> Type))))

pattern PType :: NLPat -> NLPSort Source #

pattern PProp :: NLPat -> NLPSort Source #

pattern PSSet :: NLPat -> NLPSort Source #

data RewriteRule Source #

Rewrite rules can be added independently from function clauses.

Constructors

RewriteRule
Fields rewName :: QName Name of rewrite rule `q : Γ → f ps ≡ rhs` where `≡` is the rewrite relation. rewContext :: Telescope `Γ`. rewHead :: QName `f`. rewPats :: PElims `Γ ⊢ f ps : t`. rewRHS :: Term `Γ ⊢ rhs : t`. rewType :: Type `Γ ⊢ t`. rewFromClause :: Bool Was this rewrite rule created from a clause in the definition of the function?

Instances

Instances details

NamesIn RewriteRule Source #

Instance details

Methods

namesAndMetasIn' :: Monoid m => (Either QName MetaId -> m) -> RewriteRule -> m Source #

KillRange RewriteRule Source #

Instance details

Methods

killRange :: KillRangeT RewriteRule Source #

KillRange RewriteRuleMap Source #

Instance details

Methods

killRange :: KillRangeT RewriteRuleMap Source #

PrettyTCM RewriteRule Source #

Instance details

Defined in Agda.TypeChecking.Pretty

Methods

prettyTCM :: MonadPretty m => RewriteRule -> m Doc Source #

InstantiateFull RewriteRule Source #

Instance details

Defined in Agda.TypeChecking.Reduce

Methods

instantiateFull' :: RewriteRule -> ReduceM RewriteRule Source #

GetMatchables RewriteRule Source #

Instance details

Defined in Agda.TypeChecking.Rewriting.NonLinPattern

Methods

getMatchables :: RewriteRule -> [QName] Source #

EmbPrj RewriteRule Source #

Instance details

Defined in Agda.TypeChecking.Serialise.Instances.Internal

Methods

icode :: RewriteRule -> S Int32 Source #

icod_ :: RewriteRule -> S Int32 Source #

value :: Int32 -> R RewriteRule Source #

Abstract RewriteRule Source #

tel ⊢ (Γ ⊢ lhs ↦ rhs : t) becomes tel, Γ ⊢ lhs ↦ rhs : t) we do not need to change lhs, rhs, and t since they live in Γ. See 'Abstract Clause'.

Instance details

Methods

abstract :: Telescope -> RewriteRule -> RewriteRule Source #

Apply RewriteRule Source #

Instance details

Methods

apply :: RewriteRule -> Args -> RewriteRule Source #

applyE :: RewriteRule -> Elims -> RewriteRule Source #

Subst RewriteRule Source #

Instance details

Associated Types

type SubstArg RewriteRule
Instance details Defined in Agda.TypeChecking.Substitute type SubstArg RewriteRule = NLPat

Methods

applySubst :: Substitution' (SubstArg RewriteRule) -> RewriteRule -> RewriteRule Source #

Generic RewriteRule Source #

Instance details

Associated Types

type Rep RewriteRule

Instance details

type Rep RewriteRule = D1 ('MetaData "RewriteRule" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "RewriteRule" 'PrefixI 'True) ((S1 ('MetaSel ('Just "rewName") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName) :*: (S1 ('MetaSel ('Just "rewContext") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Telescope) :*: S1 ('MetaSel ('Just "rewHead") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName))) :*: ((S1 ('MetaSel ('Just "rewPats") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 PElims) :*: S1 ('MetaSel ('Just "rewRHS") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term)) :*: (S1 ('MetaSel ('Just "rewType") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type) :*: S1 ('MetaSel ('Just "rewFromClause") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool)))))

Methods

from :: RewriteRule -> Rep RewriteRule x #

to :: Rep RewriteRule x -> RewriteRule #

Show RewriteRule Source #

Instance details

Methods

showsPrec :: Int -> RewriteRule -> ShowS #

show :: RewriteRule -> String #

showList :: [RewriteRule] -> ShowS #

NFData RewriteRule Source #

Instance details

Methods

rnf :: RewriteRule -> () #

type SubstArg RewriteRule Source #

Instance details

type SubstArg RewriteRule = NLPat

type Rep RewriteRule Source #

Instance details

type Rep RewriteRule = D1 ('MetaData "RewriteRule" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "RewriteRule" 'PrefixI 'True) ((S1 ('MetaSel ('Just "rewName") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName) :*: (S1 ('MetaSel ('Just "rewContext") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Telescope) :*: S1 ('MetaSel ('Just "rewHead") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName))) :*: ((S1 ('MetaSel ('Just "rewPats") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 PElims) :*: S1 ('MetaSel ('Just "rewRHS") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term)) :*: (S1 ('MetaSel ('Just "rewType") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type) :*: S1 ('MetaSel ('Just "rewFromClause") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool)))))

data Defn Source #

Constructors

AxiomDefn AxiomData	Postulate.
DataOrRecSigDefn DataOrRecSigData	Data or record type signature that doesn't yet have a definition.
GeneralizableVar	Generalizable variable (introduced in `generalize` block).
AbstractDefn Defn	Returned by `getConstInfo` if definition is abstract.
FunctionDefn FunctionData
DatatypeDefn DatatypeData
RecordDefn RecordData
ConstructorDefn ConstructorData
PrimitiveDefn PrimitiveData	Primitive or builtin functions.
PrimitiveSortDefn PrimitiveSortData

Instances

Instances details

Pretty Defn Source #

Instance details

Methods

pretty :: Defn -> Doc Source #

prettyPrec :: Int -> Defn -> Doc Source #

prettyList :: [Defn] -> Doc Source #

NamesIn Defn Source #

Instance details

Methods

namesAndMetasIn' :: Monoid m => (Either QName MetaId -> m) -> Defn -> m Source #

KillRange Defn Source #

Instance details

Methods

killRange :: KillRangeT Defn Source #

Occurs Defn Source #

Instance details

Defined in Agda.TypeChecking.MetaVars.Occurs

Methods

occurs :: Defn -> OccursM Defn Source #

metaOccurs :: MetaId -> Defn -> TCM () Source #

InstantiateFull Defn Source #

Instance details

Defined in Agda.TypeChecking.Reduce

Methods

instantiateFull' :: Defn -> ReduceM Defn Source #

EmbPrj Defn Source #

Instance details

Defined in Agda.TypeChecking.Serialise.Instances.Internal

Methods

icode :: Defn -> S Int32 Source #

icod_ :: Defn -> S Int32 Source #

value :: Int32 -> R Defn Source #

Abstract Defn Source #

Instance details

Methods

abstract :: Telescope -> Defn -> Defn Source #

Apply Defn Source #

Instance details

Methods

apply :: Defn -> Args -> Defn Source #

applyE :: Defn -> Elims -> Defn Source #

Generic Defn Source #

Instance details

Associated Types

type Rep Defn

Instance details

Methods

from :: Defn -> Rep Defn x #

to :: Rep Defn x -> Defn #

Show Defn Source #

Instance details

Methods

showsPrec :: Int -> Defn -> ShowS #

show :: Defn -> String #

showList :: [Defn] -> ShowS #

NFData Defn Source #

Instance details

Methods

rnf :: Defn -> () #

type Rep Defn Source #

Instance details

data NumGeneralizableArgs Source #

Constructors

NoGeneralizableArgs
SomeGeneralizableArgs !Int	When lambda-lifting new args are generalizable if `SomeGeneralizableArgs`, also when the number is zero.

Instances

Instances details

KillRange NumGeneralizableArgs Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods killRange :: KillRangeT NumGeneralizableArgs Source #
EmbPrj NumGeneralizableArgs Source #
Instance details Defined in Agda.TypeChecking.Serialise.Instances.Internal Methods icode :: NumGeneralizableArgs -> S Int32 Source # icod_ :: NumGeneralizableArgs -> S Int32 Source # value :: Int32 -> R NumGeneralizableArgs Source #
Abstract NumGeneralizableArgs Source #
Instance details Defined in Agda.TypeChecking.Substitute Methods abstract :: Telescope -> NumGeneralizableArgs -> NumGeneralizableArgs Source #
Apply NumGeneralizableArgs Source #
Instance details Defined in Agda.TypeChecking.Substitute Methods apply :: NumGeneralizableArgs -> Args -> NumGeneralizableArgs Source # applyE :: NumGeneralizableArgs -> Elims -> NumGeneralizableArgs Source #
Show NumGeneralizableArgs Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods showsPrec :: Int -> NumGeneralizableArgs -> ShowS # show :: NumGeneralizableArgs -> String # showList :: [NumGeneralizableArgs] -> ShowS #
NFData NumGeneralizableArgs Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods rnf :: NumGeneralizableArgs -> () #

type CompiledRepresentation = Map BackendName [CompilerPragma] Source #

lensTheDef :: Lens' Definition Defn Source #

defaultDefn :: ArgInfo -> QName -> Type -> Language -> Defn -> Definition Source #

Create a definition with sensible defaults.

noCompiledRep :: CompiledRepresentation Source #

jsBackendName :: BackendName Source #

ghcBackendName :: BackendName Source #

type Face = [(Term, Bool)] Source #

data ExtLamInfo Source #

Additional information for extended lambdas.

Constructors

ExtLamInfo

Fields

extLamModule :: ModuleName
For complicated reasons the scope checker decides the QName of a pattern lambda, and thus its module. We really need to decide the module during type checking though, since if the lambda appears in a refined context the module picked by the scope checker has very much the wrong parameters.
extLamAbsurd :: Bool
Was this definition created from an absurd lambda λ ()?
extLamSys :: !(Maybe System)

Instances

Instances details

NamesIn ExtLamInfo Source #

Instance details

Methods

namesAndMetasIn' :: Monoid m => (Either QName MetaId -> m) -> ExtLamInfo -> m Source #

KillRange ExtLamInfo Source #

Instance details

Methods

killRange :: KillRangeT ExtLamInfo Source #

InstantiateFull ExtLamInfo Source #

Instance details

Defined in Agda.TypeChecking.Reduce

Methods

instantiateFull' :: ExtLamInfo -> ReduceM ExtLamInfo Source #

EmbPrj ExtLamInfo Source #

Instance details

Defined in Agda.TypeChecking.Serialise.Instances.Internal

Methods

icode :: ExtLamInfo -> S Int32 Source #

icod_ :: ExtLamInfo -> S Int32 Source #

value :: Int32 -> R ExtLamInfo Source #

Apply ExtLamInfo Source #

Instance details

Methods

apply :: ExtLamInfo -> Args -> ExtLamInfo Source #

applyE :: ExtLamInfo -> Elims -> ExtLamInfo Source #

Generic ExtLamInfo Source #

Instance details

Associated Types

type Rep ExtLamInfo

Instance details

type Rep ExtLamInfo = D1 ('MetaData "ExtLamInfo" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "ExtLamInfo" 'PrefixI 'True) (S1 ('MetaSel ('Just "extLamModule") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ModuleName) :*: (S1 ('MetaSel ('Just "extLamAbsurd") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool) :*: S1 ('MetaSel ('Just "extLamSys") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (Maybe System)))))

Methods

from :: ExtLamInfo -> Rep ExtLamInfo x #

to :: Rep ExtLamInfo x -> ExtLamInfo #

Show ExtLamInfo Source #

Instance details

Methods

showsPrec :: Int -> ExtLamInfo -> ShowS #

show :: ExtLamInfo -> String #

showList :: [ExtLamInfo] -> ShowS #

NFData ExtLamInfo Source #

Instance details

Methods

rnf :: ExtLamInfo -> () #

type Rep ExtLamInfo Source #

Instance details

type Rep ExtLamInfo = D1 ('MetaData "ExtLamInfo" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "ExtLamInfo" 'PrefixI 'True) (S1 ('MetaSel ('Just "extLamModule") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ModuleName) :*: (S1 ('MetaSel ('Just "extLamAbsurd") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool) :*: S1 ('MetaSel ('Just "extLamSys") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (Maybe System)))))

modifySystem :: (System -> System) -> ExtLamInfo -> ExtLamInfo Source #

data Projection Source #

Additional information for projection Functions.

Constructors

Projection

Fields

projProper :: Maybe QName
Nothing if only projection-like, Just r if record projection. The r is the name of the record type projected from. This field is updated by module application.
projOrig :: QName
The original projection name (current name could be from module application).
projFromType :: Arg QName
Type projected from. Original record type if projProper = Just{}. Also stores ArgInfo of the principal argument. This field is unchanged by module application.
projIndex :: Int
Index of the record argument. Start counting with 1, because 0 means that it is already applied to the record value. This can happen in module instantiation, but then either the record value is var 0, or funProjection == Nothing.
projLams :: ProjLams
Term t to be be applied to record parameters and record value. The parameters will be dropped. In case of a proper projection, a postfix projection application will be created: t = pars r -> r .p (Invariant: the number of abstractions equals projIndex.) In case of a projection-like function, just the function symbol is returned as Def: t = pars -> f.

Instances

Instances details

Pretty Projection Source #

Instance details

Methods

pretty :: Projection -> Doc Source #

prettyPrec :: Int -> Projection -> Doc Source #

prettyList :: [Projection] -> Doc Source #

KillRange Projection Source #

Instance details

Methods

killRange :: KillRangeT Projection Source #

EmbPrj Projection Source #

Instance details

Defined in Agda.TypeChecking.Serialise.Instances.Internal

Methods

icode :: Projection -> S Int32 Source #

icod_ :: Projection -> S Int32 Source #

value :: Int32 -> R Projection Source #

Abstract Projection Source #

Instance details

Methods

abstract :: Telescope -> Projection -> Projection Source #

Apply Projection Source #

Instance details

Methods

apply :: Projection -> Args -> Projection Source #

applyE :: Projection -> Elims -> Projection Source #

Generic Projection Source #

Instance details

Associated Types

type Rep Projection

Instance details

type Rep Projection = D1 ('MetaData "Projection" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "Projection" 'PrefixI 'True) ((S1 ('MetaSel ('Just "projProper") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe QName)) :*: S1 ('MetaSel ('Just "projOrig") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName)) :*: (S1 ('MetaSel ('Just "projFromType") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Arg QName)) :*: (S1 ('MetaSel ('Just "projIndex") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Int) :*: S1 ('MetaSel ('Just "projLams") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ProjLams)))))

Methods

from :: Projection -> Rep Projection x #

to :: Rep Projection x -> Projection #

Show Projection Source #

Instance details

Methods

showsPrec :: Int -> Projection -> ShowS #

show :: Projection -> String #

showList :: [Projection] -> ShowS #

NFData Projection Source #

Instance details

Methods

rnf :: Projection -> () #

type Rep Projection Source #

Instance details

type Rep Projection = D1 ('MetaData "Projection" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "Projection" 'PrefixI 'True) ((S1 ('MetaSel ('Just "projProper") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe QName)) :*: S1 ('MetaSel ('Just "projOrig") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName)) :*: (S1 ('MetaSel ('Just "projFromType") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Arg QName)) :*: (S1 ('MetaSel ('Just "projIndex") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Int) :*: S1 ('MetaSel ('Just "projLams") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ProjLams)))))

newtype ProjLams Source #

Abstractions to build projection function (dropping parameters).

Constructors

ProjLams
Fields getProjLams :: [Arg ArgName]

Instances

Instances details

Pretty ProjLams Source #

Instance details

Methods

pretty :: ProjLams -> Doc Source #

prettyPrec :: Int -> ProjLams -> Doc Source #

prettyList :: [ProjLams] -> Doc Source #

KillRange ProjLams Source #

Instance details

Methods

killRange :: KillRangeT ProjLams Source #

EmbPrj ProjLams Source #

Instance details

Defined in Agda.TypeChecking.Serialise.Instances.Internal

Methods

icode :: ProjLams -> S Int32 Source #

icod_ :: ProjLams -> S Int32 Source #

value :: Int32 -> R ProjLams Source #

Abstract ProjLams Source #

Instance details

Methods

abstract :: Telescope -> ProjLams -> ProjLams Source #

Apply ProjLams Source #

Instance details

Methods

apply :: ProjLams -> Args -> ProjLams Source #

applyE :: ProjLams -> Elims -> ProjLams Source #

Null ProjLams Source #

Instance details

Methods

empty :: ProjLams Source #

null :: ProjLams -> Bool Source #

Generic ProjLams Source #

Instance details

Associated Types

type Rep ProjLams
Instance details Defined in Agda.TypeChecking.Monad.Base type Rep ProjLams = D1 ('MetaData "ProjLams" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'True) (C1 ('MetaCons "ProjLams" 'PrefixI 'True) (S1 ('MetaSel ('Just "getProjLams") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Arg ArgName])))

Methods

from :: ProjLams -> Rep ProjLams x #

to :: Rep ProjLams x -> ProjLams #

Show ProjLams Source #

Instance details

Methods

showsPrec :: Int -> ProjLams -> ShowS #

show :: ProjLams -> String #

showList :: [ProjLams] -> ShowS #

NFData ProjLams Source #

Instance details

Methods

rnf :: ProjLams -> () #

type Rep ProjLams Source #

Instance details

CopatternMatchingAllowed EtaEquality Source #

type Rep ProjLams = D1 ('MetaData "ProjLams" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'True) (C1 ('MetaCons "ProjLams" 'PrefixI 'True) (S1 ('MetaSel ('Just "getProjLams") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Arg ArgName])))

projDropPars :: Projection -> ProjOrigin -> Term Source #

Building the projection function (which drops the parameters).

projArgInfo :: Projection -> ArgInfo Source #

The info of the principal (record) argument.

data EtaEquality Source #

Should a record type admit eta-equality?

Constructors

Specified	User specifed 'eta-equality' or 'no-eta-equality'.
Fields theEtaEquality :: !HasEta
Inferred	Positivity checker inferred whether eta is safe.
Fields theEtaEquality :: !HasEta

Instances

Instances details

Instance details

PatternMatchingAllowed EtaEquality Source #

Methods

copatternMatchingAllowed :: EtaEquality -> Bool Source #

Instance details

Methods

patternMatchingAllowed :: EtaEquality -> Bool Source #

KillRange EtaEquality Source #

Instance details

Methods

killRange :: KillRangeT EtaEquality Source #

EmbPrj EtaEquality Source #

Instance details

Defined in Agda.TypeChecking.Serialise.Instances.Internal

Methods

icode :: EtaEquality -> S Int32 Source #

icod_ :: EtaEquality -> S Int32 Source #

value :: Int32 -> R EtaEquality Source #

Generic EtaEquality Source #

Instance details

Associated Types

type Rep EtaEquality

Instance details

type Rep EtaEquality = D1 ('MetaData "EtaEquality" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "Specified" 'PrefixI 'True) (S1 ('MetaSel ('Just "theEtaEquality") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 HasEta)) :+: C1 ('MetaCons "Inferred" 'PrefixI 'True) (S1 ('MetaSel ('Just "theEtaEquality") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 HasEta)))

Methods

from :: EtaEquality -> Rep EtaEquality x #

to :: Rep EtaEquality x -> EtaEquality #

Show EtaEquality Source #

Instance details

Methods

showsPrec :: Int -> EtaEquality -> ShowS #

show :: EtaEquality -> String #

showList :: [EtaEquality] -> ShowS #

NFData EtaEquality Source #

Instance details

Methods

rnf :: EtaEquality -> () #

Eq EtaEquality Source #

Instance details

Methods

(==) :: EtaEquality -> EtaEquality -> Bool #

(/=) :: EtaEquality -> EtaEquality -> Bool #

type Rep EtaEquality Source #

Instance details

type Rep EtaEquality = D1 ('MetaData "EtaEquality" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "Specified" 'PrefixI 'True) (S1 ('MetaSel ('Just "theEtaEquality") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 HasEta)) :+: C1 ('MetaCons "Inferred" 'PrefixI 'True) (S1 ('MetaSel ('Just "theEtaEquality") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 HasEta)))

setEtaEquality :: EtaEquality -> HasEta -> EtaEquality Source #

Make sure we do not overwrite a user specification.

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

Instances details

KillRange FunctionFlag Source #

Instance details

Methods

killRange :: KillRangeT FunctionFlag Source #

EmbPrj FunctionFlag Source #

Instance details

Defined in Agda.TypeChecking.Serialise.Instances.Internal

Methods

icode :: FunctionFlag -> S Int32 Source #

icod_ :: FunctionFlag -> S Int32 Source #

value :: Int32 -> R FunctionFlag Source #

Enum FunctionFlag Source #

Instance details

Methods

succ :: FunctionFlag -> FunctionFlag #

pred :: FunctionFlag -> FunctionFlag #

toEnum :: Int -> FunctionFlag #

fromEnum :: FunctionFlag -> Int #

enumFrom :: FunctionFlag -> [FunctionFlag] #

enumFromThen :: FunctionFlag -> FunctionFlag -> [FunctionFlag] #

enumFromTo :: FunctionFlag -> FunctionFlag -> [FunctionFlag] #

enumFromThenTo :: FunctionFlag -> FunctionFlag -> FunctionFlag -> [FunctionFlag] #

Generic FunctionFlag Source #

Instance details

Associated Types

type Rep FunctionFlag
Instance details Defined in Agda.TypeChecking.Monad.Base type Rep FunctionFlag = D1 ('MetaData "FunctionFlag" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "FunStatic" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "FunInline" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "FunMacro" 'PrefixI 'False) (U1 :: Type -> Type)))

Methods

from :: FunctionFlag -> Rep FunctionFlag x #

to :: Rep FunctionFlag x -> FunctionFlag #

Show FunctionFlag Source #

Instance details

Methods

showsPrec :: Int -> FunctionFlag -> ShowS #

show :: FunctionFlag -> String #

showList :: [FunctionFlag] -> ShowS #

NFData FunctionFlag Source #

Instance details

Methods

rnf :: FunctionFlag -> () #

Eq FunctionFlag Source #

Instance details

Methods

(==) :: FunctionFlag -> FunctionFlag -> Bool #

(/=) :: FunctionFlag -> FunctionFlag -> Bool #

Ord FunctionFlag Source #

Instance details

Methods

compare :: FunctionFlag -> FunctionFlag -> Ordering #

(<) :: FunctionFlag -> FunctionFlag -> Bool #

(<=) :: FunctionFlag -> FunctionFlag -> Bool #

(>) :: FunctionFlag -> FunctionFlag -> Bool #

(>=) :: FunctionFlag -> FunctionFlag -> Bool #

max :: FunctionFlag -> FunctionFlag -> FunctionFlag #

min :: FunctionFlag -> FunctionFlag -> FunctionFlag #

type Rep FunctionFlag Source #

Instance details

type Rep FunctionFlag = D1 ('MetaData "FunctionFlag" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "FunStatic" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "FunInline" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "FunMacro" 'PrefixI 'False) (U1 :: Type -> Type)))

data CompKit Source #

Constructors

CompKit
Fields nameOfHComp :: Maybe QName nameOfTransp :: Maybe QName

Instances

Instances details

NamesIn CompKit Source #

Instance details

Methods

namesAndMetasIn' :: Monoid m => (Either QName MetaId -> m) -> CompKit -> m Source #

KillRange CompKit Source #

Instance details

Methods

killRange :: KillRangeT CompKit Source #

EmbPrj CompKit Source #

Instance details

Defined in Agda.TypeChecking.Serialise.Instances.Internal

Methods

icode :: CompKit -> S Int32 Source #

icod_ :: CompKit -> S Int32 Source #

value :: Int32 -> R CompKit Source #

Generic CompKit Source #

Instance details

Associated Types

type Rep CompKit

Instance details

type Rep CompKit = D1 ('MetaData "CompKit" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-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))))

Methods

from :: CompKit -> Rep CompKit x #

to :: Rep CompKit x -> CompKit #

Show CompKit Source #

Instance details

Methods

showsPrec :: Int -> CompKit -> ShowS #

show :: CompKit -> String #

showList :: [CompKit] -> ShowS #

NFData CompKit Source #

Instance details

Methods

rnf :: CompKit -> () #

Eq CompKit Source #

Instance details

Methods

(==) :: CompKit -> CompKit -> Bool #

(/=) :: CompKit -> CompKit -> Bool #

Ord CompKit Source #

Instance details

Methods

compare :: CompKit -> CompKit -> Ordering #

(<) :: CompKit -> CompKit -> Bool #

(<=) :: CompKit -> CompKit -> Bool #

(>) :: CompKit -> CompKit -> Bool #

(>=) :: CompKit -> CompKit -> Bool #

max :: CompKit -> CompKit -> CompKit #

min :: CompKit -> CompKit -> CompKit #

type Rep CompKit Source #

Instance details

type Rep CompKit = D1 ('MetaData "CompKit" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-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))))

emptyCompKit :: CompKit Source #

defaultAxiom :: Defn Source #

constTranspAxiom :: Defn Source #

data AxiomData Source #

Constructors

AxiomData
Fields _axiomConstTransp :: Bool Can transp for this postulate be constant? Set to `True` for bultins like String.

Instances

Instances details

Generic AxiomData Source #

Instance details

Associated Types

type Rep AxiomData
Instance details Defined in Agda.TypeChecking.Monad.Base type Rep AxiomData = D1 ('MetaData "AxiomData" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "AxiomData" 'PrefixI 'True) (S1 ('MetaSel ('Just "_axiomConstTransp") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool)))

Methods

from :: AxiomData -> Rep AxiomData x #

to :: Rep AxiomData x -> AxiomData #

Show AxiomData Source #

Instance details

Methods

showsPrec :: Int -> AxiomData -> ShowS #

show :: AxiomData -> String #

showList :: [AxiomData] -> ShowS #

NFData AxiomData Source #

Instance details

Methods

rnf :: AxiomData -> () #

type Rep AxiomData Source #

Instance details

type Rep AxiomData = D1 ('MetaData "AxiomData" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "AxiomData" 'PrefixI 'True) (S1 ('MetaSel ('Just "_axiomConstTransp") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool)))

data DataOrRecSigData Source #

Constructors

DataOrRecSigData
Fields _datarecPars :: Int

Instances

Instances details

Pretty DataOrRecSigData Source #

Instance details

Methods

pretty :: DataOrRecSigData -> Doc Source #

prettyPrec :: Int -> DataOrRecSigData -> Doc Source #

prettyList :: [DataOrRecSigData] -> Doc Source #

Generic DataOrRecSigData Source #

Instance details

Associated Types

type Rep DataOrRecSigData
Instance details Defined in Agda.TypeChecking.Monad.Base type Rep DataOrRecSigData = D1 ('MetaData "DataOrRecSigData" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "DataOrRecSigData" 'PrefixI 'True) (S1 ('MetaSel ('Just "_datarecPars") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Int)))

Methods

from :: DataOrRecSigData -> Rep DataOrRecSigData x #

to :: Rep DataOrRecSigData x -> DataOrRecSigData #

Show DataOrRecSigData Source #

Instance details

Methods

showsPrec :: Int -> DataOrRecSigData -> ShowS #

show :: DataOrRecSigData -> String #

showList :: [DataOrRecSigData] -> ShowS #

NFData DataOrRecSigData Source #

Instance details

Methods

rnf :: DataOrRecSigData -> () #

type Rep DataOrRecSigData Source #

Instance details

type Rep DataOrRecSigData = D1 ('MetaData "DataOrRecSigData" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "DataOrRecSigData" 'PrefixI 'True) (S1 ('MetaSel ('Just "_datarecPars") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Int)))

data FunctionData Source #

Constructors

FunctionData

Fields

_funClauses :: [Clause]
_funCompiled :: Maybe CompiledClauses
Nothing while function is still type-checked. Just cc after type and coverage checking and translation to case trees.
_funSplitTree :: Maybe SplitTree
The split tree constructed by the coverage checker. Needed to re-compile the clauses after forcing translation.
_funTreeless :: Maybe Compiled
Intermediate representation for compiler backends.
_funCovering :: [Clause]
Covering clauses computed by coverage checking. Erased by (IApply) confluence checking(?)
_funInv :: FunctionInverse
_funMutual :: Maybe [QName]
Mutually recursive functions, datas and records. Does include this function. Empty list if not recursive. Nothing if not yet computed (by positivity checker).
_funAbstr :: IsAbstract
_funProjection :: Either ProjectionLikenessMissing Projection
Is it a record projection? If yes, then return the name of the record type and index of the record argument. Start counting with 1, because 0 means that it is already applied to the record. (Can happen in module instantiation.) This information is used in the termination checker.
_funErasure :: !Bool
Was --erasure in effect when the function was defined? (This can affect the type of a projection.)
_funFlags :: Set FunctionFlag
_funTerminates :: Maybe Bool
Has this function been termination checked? Did it pass?
_funExtLam :: Maybe ExtLamInfo
Is this function generated from an extended lambda? If yes, then return the number of hidden and non-hidden lambda-lifted arguments.
_funWith :: Maybe QName
Is this a generated with-function? If yes, then what's the name of the parent function?
_funIsKanOp :: Maybe QName
Is this a helper for one of the Kan operations (transp, hcomp) on data types/records? If so, for which data type?
_funOpaque :: IsOpaque
Is this function opaque? If so, and we're not in an opaque block that includes this function('s name), it will be treated abstractly.

Instances

Instances details

Pretty FunctionData Source #

Instance details

Methods

pretty :: FunctionData -> Doc Source #

prettyPrec :: Int -> FunctionData -> Doc Source #

prettyList :: [FunctionData] -> Doc Source #

Generic FunctionData Source #

Instance details

Associated Types

type Rep FunctionData

Instance details

Methods

from :: FunctionData -> Rep FunctionData x #

to :: Rep FunctionData x -> FunctionData #

Show FunctionData Source #

Instance details

Methods

showsPrec :: Int -> FunctionData -> ShowS #

show :: FunctionData -> String #

showList :: [FunctionData] -> ShowS #

NFData FunctionData Source #

Instance details

Methods

rnf :: FunctionData -> () #

type Rep FunctionData Source #

Instance details

data DatatypeData Source #

Constructors

DatatypeData

Fields

_dataPars :: Nat
Number of parameters.
_dataIxs :: Nat
Number of indices.
_dataClause :: Maybe Clause
This might be in an instantiated module.
_dataCons :: [QName]
Constructor names, ordered according to the order of their definition.
_dataSort :: Sort
_dataMutual :: Maybe [QName]
Mutually recursive functions, datas and records. Does include this data type. Empty if not recursive. Nothing if not yet computed (by positivity checker).
_dataAbstr :: IsAbstract
_dataPathCons :: [QName]
Path constructor names (subset of dataCons).
_dataTranspIx :: Maybe QName
If indexed datatype, name of the "index transport" function.
_dataTransp :: Maybe QName
Transport function, should be available for all datatypes in supported sorts.

Instances

Instances details

Pretty DatatypeData Source #

Instance details

Methods

pretty :: DatatypeData -> Doc Source #

prettyPrec :: Int -> DatatypeData -> Doc Source #

prettyList :: [DatatypeData] -> Doc Source #

Generic DatatypeData Source #

Instance details

Associated Types

type Rep DatatypeData

Instance details

Methods

from :: DatatypeData -> Rep DatatypeData x #

to :: Rep DatatypeData x -> DatatypeData #

Show DatatypeData Source #

Instance details

Methods

showsPrec :: Int -> DatatypeData -> ShowS #

show :: DatatypeData -> String #

showList :: [DatatypeData] -> ShowS #

NFData DatatypeData Source #

Instance details

Methods

rnf :: DatatypeData -> () #

type Rep DatatypeData Source #

Instance details

data RecordData Source #

Constructors

RecordData

Fields

_recPars :: Nat
Number of parameters.
_recClause :: Maybe Clause
Was this record type created by a module application? If yes, the clause is its definition (linking back to the original record type).
_recConHead :: ConHead
Constructor name and fields.
_recNamedCon :: Bool
Does this record have a constructor?
_recFields :: [Dom QName]
The record field names.
_recTel :: Telescope
The record field telescope. (Includes record parameters.) Note: TelV recTel _ == telView' recConType. Thus, recTel is redundant.
_recMutual :: Maybe [QName]
Mutually recursive functions, datas and records. Does include this record. Empty if not recursive. Nothing if not yet computed (by positivity checker).
_recEtaEquality' :: EtaEquality
Eta-expand at this record type? False for unguarded recursive records and coinductive records unless the user specifies otherwise.
_recPatternMatching :: PatternOrCopattern
In case eta-equality is off, do we allow pattern matching on the constructor or construction by copattern matching? Having both loses subject reduction, see issue #4560. After positivity checking, this field is obsolete, part of EtaEquality.
_recInduction :: Maybe Induction
Inductive or CoInductive? Matters only for recursive records. Nothing means that the user did not specify it, which is an error for recursive records.
_recTerminates :: Maybe Bool
'Just True' means that unfolding of the recursive record terminates, 'Just False' means that we have no evidence for termination, and Nothing means we have not run the termination checker yet.
_recAbstr :: IsAbstract
_recComp :: CompKit

Instances

Instances details

Pretty RecordData Source #

Instance details

Methods

pretty :: RecordData -> Doc Source #

prettyPrec :: Int -> RecordData -> Doc Source #

prettyList :: [RecordData] -> Doc Source #

Generic RecordData Source #

Instance details

Associated Types

type Rep RecordData

Instance details

Methods

from :: RecordData -> Rep RecordData x #

to :: Rep RecordData x -> RecordData #

Show RecordData Source #

Instance details

Methods

showsPrec :: Int -> RecordData -> ShowS #

show :: RecordData -> String #

showList :: [RecordData] -> ShowS #

NFData RecordData Source #

Instance details

Methods

rnf :: RecordData -> () #

type Rep RecordData Source #

Instance details

data ConstructorData Source #

Constructors

ConstructorData

Fields

_conPars :: Int
Number of parameters.
_conArity :: Int
Number of arguments (excluding parameters).
_conSrcCon :: ConHead
Name of (original) constructor and fields. (This might be in a module instance.)
_conData :: QName
Name of datatype or record type.
_conAbstr :: IsAbstract
_conComp :: CompKit
Cubical composition.
_conProj :: Maybe [QName]
Projections. Nothing if not yet computed.
_conForced :: [IsForced]
Which arguments are forced (i.e. determined by the type of the constructor)? Either this list is empty (if the forcing analysis isn't run), or its length is conArity.
_conErased :: Maybe [Bool]
Which arguments are erased at runtime (computed during compilation to treeless)? True means erased, False means retained. Nothing if no erasure analysis has been performed yet. The length of the list is conArity.
_conErasure :: !Bool
Was --erasure in effect when the constructor was defined? (This can affect the constructor's type.)
_conInline :: !Bool
Shall we translate the constructor on the root of the rhs into copattern matching on the lhs? Activated by INLINE pragma.

Instances

Instances details

Pretty ConstructorData Source #

Instance details

Methods

pretty :: ConstructorData -> Doc Source #

prettyPrec :: Int -> ConstructorData -> Doc Source #

prettyList :: [ConstructorData] -> Doc Source #

Generic ConstructorData Source #

Instance details

Associated Types

type Rep ConstructorData

Instance details

Methods

from :: ConstructorData -> Rep ConstructorData x #

to :: Rep ConstructorData x -> ConstructorData #

Show ConstructorData Source #

Instance details

Methods

showsPrec :: Int -> ConstructorData -> ShowS #

show :: ConstructorData -> String #

showList :: [ConstructorData] -> ShowS #

NFData ConstructorData Source #

Instance details

Methods

rnf :: ConstructorData -> () #

type Rep ConstructorData Source #

Instance details

data PrimitiveData Source #

Constructors

PrimitiveData

Fields

_primAbstr :: IsAbstract
_primName :: PrimitiveId
_primClauses :: [Clause]
null for primitive functions, not null for builtin functions.
_primInv :: FunctionInverse
Builtin functions can have inverses. For instance, natural number addition.
_primCompiled :: Maybe CompiledClauses
Nothing for primitive functions, Just something for builtin functions.
_primOpaque :: IsOpaque
Primitives can also live in opaque blocks.

Instances

Instances details

Pretty PrimitiveData Source #

Instance details

Methods

pretty :: PrimitiveData -> Doc Source #

prettyPrec :: Int -> PrimitiveData -> Doc Source #

prettyList :: [PrimitiveData] -> Doc Source #

Generic PrimitiveData Source #

Instance details

Associated Types

type Rep PrimitiveData

Instance details

type Rep PrimitiveData = D1 ('MetaData "PrimitiveData" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "PrimitiveData" 'PrefixI 'True) ((S1 ('MetaSel ('Just "_primAbstr") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 IsAbstract) :*: (S1 ('MetaSel ('Just "_primName") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 PrimitiveId) :*: S1 ('MetaSel ('Just "_primClauses") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Clause]))) :*: (S1 ('MetaSel ('Just "_primInv") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 FunctionInverse) :*: (S1 ('MetaSel ('Just "_primCompiled") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe CompiledClauses)) :*: S1 ('MetaSel ('Just "_primOpaque") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 IsOpaque)))))

Methods

from :: PrimitiveData -> Rep PrimitiveData x #

to :: Rep PrimitiveData x -> PrimitiveData #

Show PrimitiveData Source #

Instance details

Methods

showsPrec :: Int -> PrimitiveData -> ShowS #

show :: PrimitiveData -> String #

showList :: [PrimitiveData] -> ShowS #

NFData PrimitiveData Source #

Instance details

Methods

rnf :: PrimitiveData -> () #

type Rep PrimitiveData Source #

Instance details

type Rep PrimitiveData = D1 ('MetaData "PrimitiveData" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "PrimitiveData" 'PrefixI 'True) ((S1 ('MetaSel ('Just "_primAbstr") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 IsAbstract) :*: (S1 ('MetaSel ('Just "_primName") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 PrimitiveId) :*: S1 ('MetaSel ('Just "_primClauses") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Clause]))) :*: (S1 ('MetaSel ('Just "_primInv") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 FunctionInverse) :*: (S1 ('MetaSel ('Just "_primCompiled") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe CompiledClauses)) :*: S1 ('MetaSel ('Just "_primOpaque") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 IsOpaque)))))

data PrimitiveSortData Source #

Constructors

PrimitiveSortData
Fields _primSortName :: BuiltinSort _primSortSort :: Sort

Instances

Instances details

Pretty PrimitiveSortData Source #

Instance details

Methods

pretty :: PrimitiveSortData -> Doc Source #

prettyPrec :: Int -> PrimitiveSortData -> Doc Source #

prettyList :: [PrimitiveSortData] -> Doc Source #

Generic PrimitiveSortData Source #

Instance details

Associated Types

type Rep PrimitiveSortData

Instance details

type Rep PrimitiveSortData = D1 ('MetaData "PrimitiveSortData" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "PrimitiveSortData" 'PrefixI 'True) (S1 ('MetaSel ('Just "_primSortName") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 BuiltinSort) :*: S1 ('MetaSel ('Just "_primSortSort") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Sort)))

Methods

from :: PrimitiveSortData -> Rep PrimitiveSortData x #

to :: Rep PrimitiveSortData x -> PrimitiveSortData #

Show PrimitiveSortData Source #

Instance details

Methods

showsPrec :: Int -> PrimitiveSortData -> ShowS #

show :: PrimitiveSortData -> String #

showList :: [PrimitiveSortData] -> ShowS #

NFData PrimitiveSortData Source #

Instance details

Methods

rnf :: PrimitiveSortData -> () #

type Rep PrimitiveSortData Source #

Instance details

Pretty ProjectionLikenessMissing Source #

type Rep PrimitiveSortData = D1 ('MetaData "PrimitiveSortData" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "PrimitiveSortData" 'PrefixI 'True) (S1 ('MetaSel ('Just "_primSortName") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 BuiltinSort) :*: S1 ('MetaSel ('Just "_primSortSort") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Sort)))

pattern DataOrRecSig :: Int -> Defn Source #

pattern PrimitiveSort :: BuiltinSort -> Sort -> Defn Source #

axiomConstTransp :: Defn -> Bool Source #

datarecPars :: Defn -> Int Source #

data ProjectionLikenessMissing Source #

Indicates the reason behind a function having not been marked projection-like.

Constructors

MaybeProjection	Projection-likeness analysis has not run on this function yet. It may do so in the future.
NeverProjection	The user has requested that this function be not be marked projection-like. The analysis may already have run on this function, but the results have been discarded, and it will not be run again.

Instances

Instances details

Instance details

KillRange ProjectionLikenessMissing Source #

Methods

pretty :: ProjectionLikenessMissing -> Doc Source #

prettyPrec :: Int -> ProjectionLikenessMissing -> Doc Source #

prettyList :: [ProjectionLikenessMissing] -> Doc Source #

Instance details

EmbPrj ProjectionLikenessMissing Source #

Methods

killRange :: KillRangeT ProjectionLikenessMissing Source #

Instance details

Defined in Agda.TypeChecking.Serialise.Instances.Internal

Methods

icode :: ProjectionLikenessMissing -> S Int32 Source #

icod_ :: ProjectionLikenessMissing -> S Int32 Source #

value :: Int32 -> R ProjectionLikenessMissing Source #

Bounded ProjectionLikenessMissing Source #

Instance details

Enum ProjectionLikenessMissing Source #

Methods

minBound :: ProjectionLikenessMissing #

maxBound :: ProjectionLikenessMissing #

Instance details

Generic ProjectionLikenessMissing Source #

Instance details

Show ProjectionLikenessMissing Source #

Associated Types

type Rep ProjectionLikenessMissing
Instance details Defined in Agda.TypeChecking.Monad.Base type Rep ProjectionLikenessMissing = D1 ('MetaData "ProjectionLikenessMissing" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "MaybeProjection" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "NeverProjection" 'PrefixI 'False) (U1 :: Type -> Type))

Methods

from :: ProjectionLikenessMissing -> Rep ProjectionLikenessMissing x #

to :: Rep ProjectionLikenessMissing x -> ProjectionLikenessMissing #

Instance details

NFData ProjectionLikenessMissing Source #

Methods

showsPrec :: Int -> ProjectionLikenessMissing -> ShowS #

show :: ProjectionLikenessMissing -> String #

showList :: [ProjectionLikenessMissing] -> ShowS #

Instance details

Methods

rnf :: ProjectionLikenessMissing -> () #

type Rep ProjectionLikenessMissing Source #

Instance details

type Rep ProjectionLikenessMissing = D1 ('MetaData "ProjectionLikenessMissing" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "MaybeProjection" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "NeverProjection" 'PrefixI 'False) (U1 :: Type -> Type))

type FunctionInverse = FunctionInverse' Clause Source #

funClauses :: Defn -> [Clause] Source #

funCompiled :: Defn -> Maybe CompiledClauses Source #

funSplitTree :: Defn -> Maybe SplitTree Source #

funTreeless :: Defn -> Maybe Compiled Source #

funCovering :: Defn -> [Clause] Source #

funInv :: Defn -> FunctionInverse Source #

funMutual :: Defn -> Maybe [QName] Source #

funAbstr :: Defn -> IsAbstract Source #

funProjection :: Defn -> Either ProjectionLikenessMissing Projection Source #

funErasure :: Defn -> Bool Source #

funFlags :: Defn -> Set FunctionFlag Source #

funTerminates :: Defn -> Maybe Bool Source #

funExtLam :: Defn -> Maybe ExtLamInfo Source #

funWith :: Defn -> Maybe QName Source #

funIsKanOp :: Defn -> Maybe QName Source #

funOpaque :: Defn -> IsOpaque Source #

dataPars :: Defn -> Nat Source #

dataIxs :: Defn -> Nat Source #

dataClause :: Defn -> Maybe Clause Source #

dataCons :: Defn -> [QName] Source #

dataSort :: Defn -> Sort Source #

dataMutual :: Defn -> Maybe [QName] Source #

dataAbstr :: Defn -> IsAbstract Source #

dataPathCons :: Defn -> [QName] Source #

dataTranspIx :: Defn -> Maybe QName Source #

dataTransp :: Defn -> Maybe QName Source #

recPars :: Defn -> Nat Source #

recClause :: Defn -> Maybe Clause Source #

recConHead :: Defn -> ConHead Source #

recNamedCon :: Defn -> Bool Source #

recFields :: Defn -> [Dom QName] Source #

recTel :: Defn -> Telescope Source #

recMutual :: Defn -> Maybe [QName] Source #

recEtaEquality' :: Defn -> EtaEquality Source #

recPatternMatching :: Defn -> PatternOrCopattern Source #

recInduction :: Defn -> Maybe Induction Source #

recTerminates :: Defn -> Maybe Bool Source #

recAbstr :: Defn -> IsAbstract Source #

recComp :: Defn -> CompKit Source #

conPars :: Defn -> Int Source #

conArity :: Defn -> Int Source #

conSrcCon :: Defn -> ConHead Source #

conData :: Defn -> QName Source #

conAbstr :: Defn -> IsAbstract Source #

conComp :: Defn -> CompKit Source #

conProj :: Defn -> Maybe [QName] Source #

conForced :: Defn -> [IsForced] Source #

conErased :: Defn -> Maybe [Bool] Source #

conErasure :: Defn -> Bool Source #

conInline :: Defn -> Bool Source #

primAbstr :: Defn -> IsAbstract Source #

primName :: Defn -> PrimitiveId Source #

primClauses :: Defn -> [Clause] Source #

primInv :: Defn -> FunctionInverse Source #

primCompiled :: Defn -> Maybe CompiledClauses Source #

primOpaque :: Defn -> IsOpaque Source #

data BuiltinSort Source #

Constructors

SortUniv Univ
SortOmega Univ
SortIntervalUniv
SortLevelUniv

Instances

Instances details

KillRange BuiltinSort Source #

Instance details

Methods

killRange :: KillRangeT BuiltinSort Source #

EmbPrj BuiltinSort Source #

Instance details

Defined in Agda.TypeChecking.Serialise.Instances.Internal

Methods

icode :: BuiltinSort -> S Int32 Source #

icod_ :: BuiltinSort -> S Int32 Source #

value :: Int32 -> R BuiltinSort Source #

Generic BuiltinSort Source #

Instance details

Associated Types

type Rep BuiltinSort

Instance details

type Rep BuiltinSort = D1 ('MetaData "BuiltinSort" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) ((C1 ('MetaCons "SortUniv" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Univ)) :+: C1 ('MetaCons "SortOmega" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Univ))) :+: (C1 ('MetaCons "SortIntervalUniv" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "SortLevelUniv" 'PrefixI 'False) (U1 :: Type -> Type)))

Methods

from :: BuiltinSort -> Rep BuiltinSort x #

to :: Rep BuiltinSort x -> BuiltinSort #

Show BuiltinSort Source #

Instance details

Methods

showsPrec :: Int -> BuiltinSort -> ShowS #

show :: BuiltinSort -> String #

showList :: [BuiltinSort] -> ShowS #

NFData BuiltinSort Source #

Instance details

Methods

rnf :: BuiltinSort -> () #

Eq BuiltinSort Source #

Instance details

Methods

(==) :: BuiltinSort -> BuiltinSort -> Bool #

(/=) :: BuiltinSort -> BuiltinSort -> Bool #

type Rep BuiltinSort Source #

Instance details

InstantiateFull FunctionInverse Source #

type Rep BuiltinSort = D1 ('MetaData "BuiltinSort" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) ((C1 ('MetaCons "SortUniv" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Univ)) :+: C1 ('MetaCons "SortOmega" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Univ))) :+: (C1 ('MetaCons "SortIntervalUniv" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "SortLevelUniv" 'PrefixI 'False) (U1 :: Type -> Type)))

data BuiltinDescriptor Source #

Constructors

BuiltinData (TCM Type) [BuiltinId]
BuiltinDataCons (TCM Type)
BuiltinPrim PrimitiveId (Term -> TCM ())
BuiltinSort BuiltinSort
BuiltinPostulate Relevance (TCM Type)
BuiltinUnknown (Maybe (TCM Type)) (Term -> Type -> TCM ())	Builtin of any kind. Type can be checked (`Just t`) or inferred (`Nothing`). The second argument is the hook for the verification function.

primSortName :: Defn -> BuiltinSort Source #

primSortSort :: Defn -> Sort Source #

lensFunction :: Lens' Defn FunctionData Source #

lensConstructor :: Lens' Defn ConstructorData Source #

lensRecord :: Lens' Defn RecordData Source #

lensRecTel :: Lens' RecordData Telescope Source #

data FunctionInverse' c Source #

Constructors

NotInjective
Inverse (InversionMap c)

Instances

Instances details

DropArgs FunctionInverse Source #

Instance details

Defined in Agda.TypeChecking.DropArgs

Methods

dropArgs :: Int -> FunctionInverse -> FunctionInverse Source #

Instance details

Defined in Agda.TypeChecking.Reduce

Methods

instantiateFull' :: FunctionInverse -> ReduceM FunctionInverse Source #

Abstract FunctionInverse Source #

Instance details

Methods

abstract :: Telescope -> FunctionInverse -> FunctionInverse Source #

Apply FunctionInverse Source #

Instance details

Methods

apply :: FunctionInverse -> Args -> FunctionInverse Source #

applyE :: FunctionInverse -> Elims -> FunctionInverse Source #

Functor FunctionInverse' Source #

Instance details

Methods

fmap :: (a -> b) -> FunctionInverse' a -> FunctionInverse' b #

(<$) :: a -> FunctionInverse' b -> FunctionInverse' a #

Pretty c => Pretty (FunctionInverse' c) Source #

Instance details

Methods

pretty :: FunctionInverse' c -> Doc Source #

prettyPrec :: Int -> FunctionInverse' c -> Doc Source #

prettyList :: [FunctionInverse' c] -> Doc Source #

NamesIn a => NamesIn (FunctionInverse' a) Source #

Instance details

Methods

namesAndMetasIn' :: Monoid m => (Either QName MetaId -> m) -> FunctionInverse' a -> m Source #

KillRange c => KillRange (FunctionInverse' c) Source #

Instance details

Methods

killRange :: KillRangeT (FunctionInverse' c) Source #

EmbPrj a => EmbPrj (FunctionInverse' a) Source #

Instance details

Defined in Agda.TypeChecking.Serialise.Instances.Internal

Methods

icode :: FunctionInverse' a -> S Int32 Source #

icod_ :: FunctionInverse' a -> S Int32 Source #

value :: Int32 -> R (FunctionInverse' a) Source #

Generic (FunctionInverse' c) Source #

Instance details

Associated Types

type Rep (FunctionInverse' c)

Instance details

type Rep (FunctionInverse' c) = D1 ('MetaData "FunctionInverse'" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "NotInjective" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "Inverse" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (InversionMap c))))

Methods

from :: FunctionInverse' c -> Rep (FunctionInverse' c) x #

to :: Rep (FunctionInverse' c) x -> FunctionInverse' c #

Show c => Show (FunctionInverse' c) Source #

Instance details

Methods

showsPrec :: Int -> FunctionInverse' c -> ShowS #

show :: FunctionInverse' c -> String #

showList :: [FunctionInverse' c] -> ShowS #

NFData c => NFData (FunctionInverse' c) Source #

Instance details

Methods

rnf :: FunctionInverse' c -> () #

type Rep (FunctionInverse' c) Source #

Instance details

type Rep (FunctionInverse' c) = D1 ('MetaData "FunctionInverse'" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "NotInjective" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "Inverse" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (InversionMap c))))

recRecursive :: Defn -> Bool Source #

Is the record type recursive?

recEtaEquality :: Defn -> HasEta Source #

emptyFunctionData :: HasOptions m => m FunctionData Source #

A template for creating Function definitions, with sensible defaults.

emptyFunction :: HasOptions m => m Defn Source #

funFlag :: FunctionFlag -> Lens' Defn Bool Source #

funStatic :: Lens' Defn Bool Source #

funInline :: Lens' Defn Bool Source #

funMacro :: Lens' Defn Bool Source #

isMacro :: Defn -> Bool Source #

isEmptyFunction :: Defn -> Bool Source #

Checking whether we are dealing with a function yet to be defined.

isCopatternLHS :: [Clause] -> Bool Source #

recCon :: Defn -> QName Source #

defIsRecord :: Defn -> Bool Source #

defIsDataOrRecord :: Defn -> Bool Source #

defConstructors :: Defn -> [QName] Source #

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

Instances details

Null Simplification Source #

Instance details

Methods

empty :: Simplification Source #

null :: Simplification -> Bool Source #

Monoid Simplification Source #

Instance details

Methods

mempty :: Simplification #

mappend :: Simplification -> Simplification -> Simplification #

mconcat :: [Simplification] -> Simplification #

Semigroup Simplification Source #

Instance details

Methods

(<>) :: Simplification -> Simplification -> Simplification #

sconcat :: NonEmpty Simplification -> Simplification #

stimes :: Integral b => b -> Simplification -> Simplification #

Generic Simplification Source #

Instance details

Associated Types

type Rep Simplification
Instance details Defined in Agda.TypeChecking.Monad.Base type Rep Simplification = D1 ('MetaData "Simplification" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "YesSimplification" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "NoSimplification" 'PrefixI 'False) (U1 :: Type -> Type))

Methods

from :: Simplification -> Rep Simplification x #

to :: Rep Simplification x -> Simplification #

Show Simplification Source #

Instance details

Methods

showsPrec :: Int -> Simplification -> ShowS #

show :: Simplification -> String #

showList :: [Simplification] -> ShowS #

NFData Simplification Source #

Instance details

Methods

rnf :: Simplification -> () #

Eq Simplification Source #

Instance details

Methods

(==) :: Simplification -> Simplification -> Bool #

(/=) :: Simplification -> Simplification -> Bool #

type Rep Simplification Source #

Instance details

SmallSetElement AllowedReduction Source #

type Rep Simplification = D1 ('MetaData "Simplification" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "YesSimplification" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "NoSimplification" 'PrefixI 'False) (U1 :: Type -> Type))

redReturn :: a -> ReduceM (Reduced a' a) 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

data MaybeReduced a Source #

Constructors

MaybeRed
Fields isReduced :: IsReduced ignoreReduced :: a

Instances

Instances details

Functor MaybeReduced Source #
Instance details 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 #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods isProjElim :: MaybeReduced e -> Maybe (ProjOrigin, QName) Source #
PrettyTCM a => PrettyTCM (MaybeReduced a) Source #
Instance details Defined in Agda.TypeChecking.Pretty Methods prettyTCM :: MonadPretty m => MaybeReduced a -> m Doc Source #

type MaybeReducedArgs = [MaybeReduced (Arg Term)] Source #

type MaybeReducedElims = [MaybeReduced Elim] Source #

notReduced :: a -> MaybeReduced a Source #

reduced :: Blocked (Arg Term) -> MaybeReduced (Arg Term) Source #

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 `Level` terms.
TypeLevelReductions	Allow `allReductions` in types, even if not allowed at term level (used by confluence checker)
UnconfirmedReductions	Functions whose termination has not (yet) been confirmed.
NonTerminatingReductions	Functions that have failed termination checking.

Instances

Instances details

Instance details

Bounded AllowedReduction Source #

Instance details

Methods

minBound :: AllowedReduction #

maxBound :: AllowedReduction #

Enum AllowedReduction Source #

Instance details

Methods

succ :: AllowedReduction -> AllowedReduction #

pred :: AllowedReduction -> AllowedReduction #

toEnum :: Int -> AllowedReduction #

fromEnum :: AllowedReduction -> Int #

enumFrom :: AllowedReduction -> [AllowedReduction] #

enumFromThen :: AllowedReduction -> AllowedReduction -> [AllowedReduction] #

enumFromTo :: AllowedReduction -> AllowedReduction -> [AllowedReduction] #

enumFromThenTo :: AllowedReduction -> AllowedReduction -> AllowedReduction -> [AllowedReduction] #

Generic AllowedReduction Source #

Instance details

Associated Types

type Rep AllowedReduction

Instance details

type Rep AllowedReduction = D1 ('MetaData "AllowedReduction" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (((C1 ('MetaCons "ProjectionReductions" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "InlineReductions" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "CopatternReductions" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "FunctionReductions" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "RecursiveReductions" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "LevelReductions" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "TypeLevelReductions" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "UnconfirmedReductions" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "NonTerminatingReductions" 'PrefixI 'False) (U1 :: Type -> Type)))))

Methods

from :: AllowedReduction -> Rep AllowedReduction x #

to :: Rep AllowedReduction x -> AllowedReduction #

Ix AllowedReduction Source #

Instance details

Methods

range :: (AllowedReduction, AllowedReduction) -> [AllowedReduction] #

index :: (AllowedReduction, AllowedReduction) -> AllowedReduction -> Int #

unsafeIndex :: (AllowedReduction, AllowedReduction) -> AllowedReduction -> Int #

inRange :: (AllowedReduction, AllowedReduction) -> AllowedReduction -> Bool #

rangeSize :: (AllowedReduction, AllowedReduction) -> Int #

unsafeRangeSize :: (AllowedReduction, AllowedReduction) -> Int #

Show AllowedReduction Source #

Instance details

Methods

showsPrec :: Int -> AllowedReduction -> ShowS #

show :: AllowedReduction -> String #

showList :: [AllowedReduction] -> ShowS #

NFData AllowedReduction Source #

Instance details

Methods

rnf :: AllowedReduction -> () #

Eq AllowedReduction Source #

Instance details

Methods

(==) :: AllowedReduction -> AllowedReduction -> Bool #

(/=) :: AllowedReduction -> AllowedReduction -> Bool #

Ord AllowedReduction Source #

Instance details

Methods

compare :: AllowedReduction -> AllowedReduction -> Ordering #

(<) :: AllowedReduction -> AllowedReduction -> Bool #

(<=) :: AllowedReduction -> AllowedReduction -> Bool #

(>) :: AllowedReduction -> AllowedReduction -> Bool #

(>=) :: AllowedReduction -> AllowedReduction -> Bool #

max :: AllowedReduction -> AllowedReduction -> AllowedReduction #

min :: AllowedReduction -> AllowedReduction -> AllowedReduction #

type Rep AllowedReduction Source #

Instance details

type Rep AllowedReduction = D1 ('MetaData "AllowedReduction" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (((C1 ('MetaCons "ProjectionReductions" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "InlineReductions" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "CopatternReductions" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "FunctionReductions" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "RecursiveReductions" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "LevelReductions" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "TypeLevelReductions" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "UnconfirmedReductions" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "NonTerminatingReductions" 'PrefixI 'False) (U1 :: Type -> Type)))))

type AllowedReductions = SmallSet AllowedReduction Source #

allReductions :: AllowedReductions Source #

Not quite all reductions (skip non-terminating reductions)

reallyAllReductions :: AllowedReductions Source #

data ReduceDefs Source #

Constructors

OnlyReduceDefs (Set QName)
DontReduceDefs (Set QName)

Instances

Instances details

Generic ReduceDefs Source #

Instance details

Associated Types

type Rep ReduceDefs

Instance details

type Rep ReduceDefs = D1 ('MetaData "ReduceDefs" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "OnlyReduceDefs" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Set QName))) :+: C1 ('MetaCons "DontReduceDefs" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Set QName))))

Methods

from :: ReduceDefs -> Rep ReduceDefs x #

to :: Rep ReduceDefs x -> ReduceDefs #

NFData ReduceDefs Source #

Instance details

Methods

rnf :: ReduceDefs -> () #

type Rep ReduceDefs Source #

Instance details

type Rep ReduceDefs = D1 ('MetaData "ReduceDefs" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "OnlyReduceDefs" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Set QName))) :+: C1 ('MetaCons "DontReduceDefs" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Set QName))))

reduceAllDefs :: ReduceDefs Source #

locallyReduceDefs :: MonadTCEnv m => ReduceDefs -> m a -> m a Source #

locallyTC :: MonadTCEnv m => Lens' TCEnv a -> (a -> a) -> m b -> m b Source #

Modify the lens-indicated part of the TCEnv in a subcomputation.

eReduceDefs :: Lens' TCEnv ReduceDefs Source #

locallyReduceAllDefs :: MonadTCEnv m => m a -> m a Source #

shouldReduceDef :: MonadTCEnv m => QName -> m Bool Source #

asksTC :: MonadTCEnv m => (TCEnv -> a) -> m a Source #

toReduceDefs :: (Bool, [QName]) -> ReduceDefs Source #

fromReduceDefs :: ReduceDefs -> (Bool, [QName]) Source #

locallyReconstructed :: MonadTCEnv m => m a -> m a Source #

eReconstructed :: Lens' TCEnv Bool Source #

isReconstructed :: MonadTCEnv m => m Bool Source #

data PrimitiveImpl Source #

Primitives

Constructors

PrimImpl Type PrimFun

primFun :: QName -> Arity -> ([Arg Term] -> ReduceM (Reduced MaybeReducedArgs Term)) -> PrimFun Source #

defClauses :: Definition -> [Clause] Source #

defCompiled :: Definition -> Maybe CompiledClauses Source #

defParameters :: Definition -> Maybe Nat Source #

defInverse :: Definition -> FunctionInverse Source #

defCompilerPragmas :: BackendName -> Definition -> [CompilerPragma] Source #

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?

defForced :: Definition -> [IsForced] Source #

type InversionMap c = Map TermHead [c] Source #

data TermHead Source #

Constructors

SortHead
PiHead
ConsHead QName
VarHead Nat
UnknownHead

Instances

Instances details

Pretty TermHead Source #

Instance details

Methods

pretty :: TermHead -> Doc Source #

prettyPrec :: Int -> TermHead -> Doc Source #

prettyList :: [TermHead] -> Doc Source #

KillRange TermHead Source #

Instance details

Methods

killRange :: KillRangeT TermHead Source #

EmbPrj TermHead Source #

Instance details

Defined in Agda.TypeChecking.Serialise.Instances.Internal

Methods

icode :: TermHead -> S Int32 Source #

icod_ :: TermHead -> S Int32 Source #

value :: Int32 -> R TermHead Source #

Generic TermHead Source #

Instance details

Associated Types

type Rep TermHead

Instance details

type Rep TermHead = D1 ('MetaData "TermHead" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-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))))

Methods

from :: TermHead -> Rep TermHead x #

to :: Rep TermHead x -> TermHead #

Show TermHead Source #

Instance details

Methods

showsPrec :: Int -> TermHead -> ShowS #

show :: TermHead -> String #

showList :: [TermHead] -> ShowS #

NFData TermHead Source #

Instance details

Methods

rnf :: TermHead -> () #

Eq TermHead Source #

Instance details

Methods

(==) :: TermHead -> TermHead -> Bool #

(/=) :: TermHead -> TermHead -> Bool #

Ord TermHead Source #

Instance details

Methods

compare :: TermHead -> TermHead -> Ordering #

(<) :: TermHead -> TermHead -> Bool #

(<=) :: TermHead -> TermHead -> Bool #

(>) :: TermHead -> TermHead -> Bool #

(>=) :: TermHead -> TermHead -> Bool #

max :: TermHead -> TermHead -> TermHead #

min :: TermHead -> TermHead -> TermHead #

type Rep TermHead Source #

Instance details

type Rep TermHead = D1 ('MetaData "TermHead" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-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))))

pattern SortProp :: BuiltinSort Source #

pattern SortSet :: BuiltinSort Source #

pattern SortStrictSet :: BuiltinSort Source #

pattern SortPropOmega :: BuiltinSort Source #

pattern SortSetOmega :: BuiltinSort Source #

pattern SortStrictSetOmega :: BuiltinSort Source #

data BuiltinInfo Source #

Constructors

BuiltinInfo
Fields builtinName :: BuiltinId builtinDesc :: BuiltinDescriptor

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.

type LetBindings = Map Name (Open LetBinding) Source #

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

Instances details

Generic AbstractMode Source #

Instance details

Associated Types

type Rep AbstractMode
Instance details Defined in Agda.TypeChecking.Monad.Base type Rep AbstractMode = D1 ('MetaData "AbstractMode" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-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)))

Methods

from :: AbstractMode -> Rep AbstractMode x #

to :: Rep AbstractMode x -> AbstractMode #

Show AbstractMode Source #

Instance details

Methods

showsPrec :: Int -> AbstractMode -> ShowS #

show :: AbstractMode -> String #

showList :: [AbstractMode] -> ShowS #

NFData AbstractMode Source #

Instance details

Methods

rnf :: AbstractMode -> () #

Eq AbstractMode Source #

Instance details

Methods

(==) :: AbstractMode -> AbstractMode -> Bool #

(/=) :: AbstractMode -> AbstractMode -> Bool #

type Rep AbstractMode Source #

Instance details

type Rep AbstractMode = D1 ('MetaData "AbstractMode" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-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)))

data UnquoteFlags Source #

Constructors

UnquoteFlags
Fields _unquoteNormalise :: Bool

Instances

Instances details

Generic UnquoteFlags Source #

Instance details

Associated Types

type Rep UnquoteFlags
Instance details Defined in Agda.TypeChecking.Monad.Base type Rep UnquoteFlags = D1 ('MetaData "UnquoteFlags" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "UnquoteFlags" 'PrefixI 'True) (S1 ('MetaSel ('Just "_unquoteNormalise") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool)))

Methods

from :: UnquoteFlags -> Rep UnquoteFlags x #

to :: Rep UnquoteFlags x -> UnquoteFlags #

NFData UnquoteFlags Source #

Instance details

Methods

rnf :: UnquoteFlags -> () #

type Rep UnquoteFlags Source #

Instance details

type Rep UnquoteFlags = D1 ('MetaData "UnquoteFlags" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "UnquoteFlags" 'PrefixI 'True) (S1 ('MetaSel ('Just "_unquoteNormalise") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool)))

initEnv :: TCEnv Source #

defaultUnquoteFlags :: UnquoteFlags Source #

unquoteNormalise :: Lens' UnquoteFlags Bool Source #

eUnquoteNormalise :: Lens' TCEnv Bool Source #

eUnquoteFlags :: Lens' TCEnv UnquoteFlags Source #

eContext :: Lens' TCEnv Context Source #

eLetBindings :: Lens' TCEnv LetBindings Source #

eCurrentModule :: Lens' TCEnv ModuleName Source #

eCurrentPath :: Lens' TCEnv (Maybe AbsolutePath) Source #

eAnonymousModules :: Lens' TCEnv [(ModuleName, Nat)] Source #

eImportPath :: Lens' TCEnv [TopLevelModuleName] Source #

eMutualBlock :: Lens' TCEnv (Maybe MutualId) Source #

eTerminationCheck :: Lens' TCEnv (TerminationCheck ()) Source #

eCoverageCheck :: Lens' TCEnv CoverageCheck Source #

eMakeCase :: Lens' TCEnv Bool Source #

eSolvingConstraints :: Lens' TCEnv Bool Source #

eCheckingWhere :: Lens' TCEnv Bool Source #

eWorkingOnTypes :: Lens' TCEnv Bool Source #

eAssignMetas :: Lens' TCEnv Bool Source #

eActiveProblems :: Lens' TCEnv (Set ProblemId) Source #

eAbstractMode :: Lens' TCEnv AbstractMode Source #

eRelevance :: Lens' TCEnv Relevance Source #

eQuantity :: Lens' TCEnv Quantity Source #

Note that this lens does not satisfy all lens laws: If hard compile-time mode is enabled, then quantities other than zero are replaced by __IMPOSSIBLE__.

eHardCompileTimeMode :: Lens' TCEnv Bool Source #

eSplitOnStrict :: Lens' TCEnv Bool Source #

eDisplayFormsEnabled :: Lens' TCEnv Bool Source #

eFoldLetBindings :: Lens' TCEnv Bool Source #

eRange :: Lens' TCEnv Range Source #

eHighlightingRange :: Lens' TCEnv Range Source #

eCall :: Lens' TCEnv (Maybe (Closure Call)) Source #

eHighlightingLevel :: Lens' TCEnv HighlightingLevel Source #

eHighlightingMethod :: Lens' TCEnv HighlightingMethod Source #

eExpandLast :: Lens' TCEnv ExpandHidden Source #

eExpandLastBool :: Lens' TCEnv Bool Source #

isExpandLast :: ExpandHidden -> Bool Source #

toExpandLast :: Bool -> ExpandHidden Source #

eAppDef :: Lens' TCEnv (Maybe QName) Source #

eSimplification :: Lens' TCEnv Simplification Source #

eAllowedReductions :: Lens' TCEnv AllowedReductions Source #

eReduceDefsPair :: Lens' TCEnv (Bool, [QName]) Source #

eInjectivityDepth :: Lens' TCEnv Int Source #

eCompareBlocked :: Lens' TCEnv Bool Source #

ePrintDomainFreePi :: Lens' TCEnv Bool Source #

ePrintMetasBare :: Lens' TCEnv Bool Source #

eInsideDotPattern :: Lens' TCEnv Bool Source #

eInstanceDepth :: Lens' TCEnv Int Source #

eIsDebugPrinting :: Lens' TCEnv Bool Source #

ePrintingPatternLambdas :: Lens' TCEnv [QName] Source #

eCallByNeed :: Lens' TCEnv Bool Source #

eCurrentCheckpoint :: Lens' TCEnv CheckpointId Source #

eCheckpoints :: Lens' TCEnv (Map CheckpointId Substitution) Source #

eGeneralizeMetas :: Lens' TCEnv DoGeneralize Source #

eGeneralizedVars :: Lens' TCEnv (Map QName GeneralizedValue) Source #

eActiveBackendName :: Lens' TCEnv (Maybe BackendName) Source #

eConflComputingOverlap :: Lens' TCEnv Bool Source #

eCurrentlyElaborating :: Lens' TCEnv Bool Source #

currentModality :: MonadTCEnv m => m Modality Source #

The current modality. Note that the returned cohesion component is always unitCohesion.

viewTC :: MonadTCEnv m => Lens' TCEnv a -> m a Source #

type ContextEntry = Dom (Name, Type) Source #

onLetBindingType :: (Dom Type -> Dom Type) -> LetBinding -> LetBinding Source #

isDontExpandLast :: ExpandHidden -> Bool Source #

data CandidateKind Source #

Constructors

LocalCandidate
GlobalCandidate QName

Instances

Instances details

Generic CandidateKind Source #

Instance details

Associated Types

type Rep CandidateKind

Instance details

type Rep CandidateKind = D1 ('MetaData "CandidateKind" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "LocalCandidate" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "GlobalCandidate" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName)))

Methods

from :: CandidateKind -> Rep CandidateKind x #

to :: Rep CandidateKind x -> CandidateKind #

Show CandidateKind Source #

Instance details

Methods

showsPrec :: Int -> CandidateKind -> ShowS #

show :: CandidateKind -> String #

showList :: [CandidateKind] -> ShowS #

NFData CandidateKind Source #

Instance details

Methods

rnf :: CandidateKind -> () #

Eq CandidateKind Source #

Instance details

Methods

(==) :: CandidateKind -> CandidateKind -> Bool #

(/=) :: CandidateKind -> CandidateKind -> Bool #

type Rep CandidateKind Source #

Instance details

type Rep CandidateKind = D1 ('MetaData "CandidateKind" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "LocalCandidate" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "GlobalCandidate" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName)))

data TerminationError Source #

Information about a mutual block which did not pass the termination checker.

Constructors

TerminationError
Fields termErrFunctions :: [QName] The functions which failed to check. (May not include automatically generated functions.) termErrCalls :: [CallInfo] The problematic call sites.

Instances

Instances details

Generic TerminationError Source #

Instance details

Associated Types

type Rep TerminationError

Instance details

type Rep TerminationError = D1 ('MetaData "TerminationError" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "TerminationError" 'PrefixI 'True) (S1 ('MetaSel ('Just "termErrFunctions") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [QName]) :*: S1 ('MetaSel ('Just "termErrCalls") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [CallInfo])))

Methods

from :: TerminationError -> Rep TerminationError x #

to :: Rep TerminationError x -> TerminationError #

Show TerminationError Source #

Instance details

Methods

showsPrec :: Int -> TerminationError -> ShowS #

show :: TerminationError -> String #

showList :: [TerminationError] -> ShowS #

NFData TerminationError Source #

Instance details

Methods

rnf :: TerminationError -> () #

type Rep TerminationError Source #

Instance details

type Rep TerminationError = D1 ('MetaData "TerminationError" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "TerminationError" 'PrefixI 'True) (S1 ('MetaSel ('Just "termErrFunctions") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [QName]) :*: S1 ('MetaSel ('Just "termErrCalls") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [CallInfo])))

recordFieldWarningToError :: RecordFieldWarning -> TypeError Source #

warningName :: Warning -> WarningName Source #

isSourceCodeWarning :: WarningName -> Bool Source #

tcWarningOrigin :: TCWarning -> SrcFile Source #

data CallInfo Source #

Information about a call.

Constructors

CallInfo
Fields callInfoTarget :: QName Target function name. (Contains its range.) callInfoCall :: Closure Term To be formatted representation of the call.

Instances

Instances details

Pretty CallInfo Source #

We only show the name of the callee.

Instance details

Methods

pretty :: CallInfo -> Doc Source #

prettyPrec :: Int -> CallInfo -> Doc Source #

prettyList :: [CallInfo] -> Doc Source #

HasRange CallInfo Source #

Instance details

Methods

getRange :: CallInfo -> Range Source #

PrettyTCM CallInfo Source #

Instance details

Defined in Agda.TypeChecking.Pretty.Call

Methods

prettyTCM :: MonadPretty m => CallInfo -> m Doc Source #

Generic CallInfo Source #

Instance details

Associated Types

type Rep CallInfo

Instance details

type Rep CallInfo = D1 ('MetaData "CallInfo" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "CallInfo" 'PrefixI 'True) (S1 ('MetaSel ('Just "callInfoTarget") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName) :*: S1 ('MetaSel ('Just "callInfoCall") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Closure Term))))

Methods

from :: CallInfo -> Rep CallInfo x #

to :: Rep CallInfo x -> CallInfo #

Show CallInfo Source #

Instance details

Methods

showsPrec :: Int -> CallInfo -> ShowS #

show :: CallInfo -> String #

showList :: [CallInfo] -> ShowS #

NFData CallInfo Source #

Instance details

Methods

rnf :: CallInfo -> () #

type Rep CallInfo Source #

Instance details

type Rep CallInfo = D1 ('MetaData "CallInfo" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "CallInfo" 'PrefixI 'True) (S1 ('MetaSel ('Just "callInfoTarget") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName) :*: S1 ('MetaSel ('Just "callInfoCall") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Closure Term))))

data ErasedDatatypeReason Source #

The reason for an ErasedDatatype error.

Constructors

SeveralConstructors	There are several constructors.
NoErasedMatches	The flag `--erased-matches` is not used.
NoK	The K rule is not activated.

Instances

Instances details

Generic ErasedDatatypeReason Source #

Instance details

Associated Types

type Rep ErasedDatatypeReason

Instance details

type Rep ErasedDatatypeReason = D1 ('MetaData "ErasedDatatypeReason" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "SeveralConstructors" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "NoErasedMatches" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "NoK" 'PrefixI 'False) (U1 :: Type -> Type)))

Methods

from :: ErasedDatatypeReason -> Rep ErasedDatatypeReason x #

to :: Rep ErasedDatatypeReason x -> ErasedDatatypeReason #

Show ErasedDatatypeReason Source #

Instance details

Methods

showsPrec :: Int -> ErasedDatatypeReason -> ShowS #

show :: ErasedDatatypeReason -> String #

showList :: [ErasedDatatypeReason] -> ShowS #

NFData ErasedDatatypeReason Source #

Instance details

Methods

rnf :: ErasedDatatypeReason -> () #

type Rep ErasedDatatypeReason Source #

Instance details

type Rep ErasedDatatypeReason = D1 ('MetaData "ErasedDatatypeReason" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "SeveralConstructors" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "NoErasedMatches" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "NoK" 'PrefixI 'False) (U1 :: Type -> Type)))

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 ErasedDatatypeReason (Closure Type)	Data type, but in erased position.
CoinductiveDatatype (Closure Type)	Split on codata not allowed. UNUSED, but keep! -- \| NoRecordConstructor Type -- ^ record type, but no constructor
UnificationStuck
Fields cantSplitBlocker :: Maybe Blocker Blocking metavariable (if any) cantSplitConName :: QName Constructor. cantSplitTel :: Telescope Context for indices. cantSplitConIdx :: Args Inferred indices (from type of constructor). cantSplitGivenIdx :: Args Expected indices (from checking pattern). cantSplitFailures :: [UnificationFailure] Reason(s) why unification got stuck.
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

Instances details

PrettyTCM SplitError Source #

Instance details

Defined in Agda.TypeChecking.Errors

Methods

prettyTCM :: MonadPretty m => SplitError -> m Doc Source #

Generic SplitError Source #

Instance details

Associated Types

type Rep SplitError

Instance details

Methods

from :: SplitError -> Rep SplitError x #

to :: Rep SplitError x -> SplitError #

Show SplitError Source #

Instance details

Methods

showsPrec :: Int -> SplitError -> ShowS #

show :: SplitError -> String #

showList :: [SplitError] -> ShowS #

NFData SplitError Source #

Instance details

Methods

rnf :: SplitError -> () #

type Rep SplitError Source #

Instance details

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

Instances details

PrettyTCM UnificationFailure Source #

Instance details

Defined in Agda.TypeChecking.Errors

Methods

prettyTCM :: MonadPretty m => UnificationFailure -> m Doc Source #

Generic UnificationFailure Source #

Instance details

Associated Types

type Rep UnificationFailure

Instance details

Methods

from :: UnificationFailure -> Rep UnificationFailure x #

to :: Rep UnificationFailure x -> UnificationFailure #

Show UnificationFailure Source #

Instance details

Methods

showsPrec :: Int -> UnificationFailure -> ShowS #

show :: UnificationFailure -> String #

showList :: [UnificationFailure] -> ShowS #

NFData UnificationFailure Source #

Instance details

Methods

rnf :: UnificationFailure -> () #

type Rep UnificationFailure Source #

Instance details

data NegativeUnification Source #

Constructors

UnifyConflict Telescope Term Term
UnifyCycle Telescope Int Term

Instances

Instances details

PrettyTCM NegativeUnification Source #

Instance details

Defined in Agda.TypeChecking.Errors

Methods

prettyTCM :: MonadPretty m => NegativeUnification -> m Doc Source #

Generic NegativeUnification Source #

Instance details

Associated Types

type Rep NegativeUnification

Instance details

type Rep NegativeUnification = D1 ('MetaData "NegativeUnification" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "UnifyConflict" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Telescope) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term))) :+: C1 ('MetaCons "UnifyCycle" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Telescope) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Int) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term))))

Methods

from :: NegativeUnification -> Rep NegativeUnification x #

to :: Rep NegativeUnification x -> NegativeUnification #

Show NegativeUnification Source #

Instance details

Methods

showsPrec :: Int -> NegativeUnification -> ShowS #

show :: NegativeUnification -> String #

showList :: [NegativeUnification] -> ShowS #

NFData NegativeUnification Source #

Instance details

Methods

rnf :: NegativeUnification -> () #

type Rep NegativeUnification Source #

Instance details

type Rep NegativeUnification = D1 ('MetaData "NegativeUnification" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "UnifyConflict" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Telescope) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term))) :+: C1 ('MetaCons "UnifyCycle" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Telescope) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Int) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term))))

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

Instances details

Generic UnquoteError Source #

Instance details

Associated Types

type Rep UnquoteError

Instance details

Methods

from :: UnquoteError -> Rep UnquoteError x #

to :: Rep UnquoteError x -> UnquoteError #

Show UnquoteError Source #

Instance details

Methods

showsPrec :: Int -> UnquoteError -> ShowS #

show :: UnquoteError -> String #

showList :: [UnquoteError] -> ShowS #

NFData UnquoteError Source #

Instance details

Methods

rnf :: UnquoteError -> () #

type Rep UnquoteError Source #

Instance details

Generic IllegalRewriteRuleReason Source #

type DataOrRecordE = DataOrRecord' InductionAndEta Source #

data IllegalRewriteRuleReason Source #

Instances

Instances details

Instance details

Associated Types

type Rep IllegalRewriteRuleReason

Instance details

Methods

from :: IllegalRewriteRuleReason -> Rep IllegalRewriteRuleReason x #

to :: Rep IllegalRewriteRuleReason x -> IllegalRewriteRuleReason #

Show IllegalRewriteRuleReason Source #

Instance details

NFData IllegalRewriteRuleReason Source #

Methods

showsPrec :: Int -> IllegalRewriteRuleReason -> ShowS #

show :: IllegalRewriteRuleReason -> String #

showList :: [IllegalRewriteRuleReason] -> ShowS #

Instance details

Methods

rnf :: IllegalRewriteRuleReason -> () #

type Rep IllegalRewriteRuleReason Source #

Instance details

Generic IncorrectTypeForRewriteRelationReason Source #

data IncorrectTypeForRewriteRelationReason Source #

Constructors

ShouldAcceptAtLeastTwoArguments
FinalTwoArgumentsNotVisible
TypeDoesNotEndInSort Type Telescope

Instances

Instances details

Instance details

Associated Types

type Rep IncorrectTypeForRewriteRelationReason

Instance details

Show IncorrectTypeForRewriteRelationReason Source #

type Rep IncorrectTypeForRewriteRelationReason = D1 ('MetaData "IncorrectTypeForRewriteRelationReason" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "ShouldAcceptAtLeastTwoArguments" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "FinalTwoArgumentsNotVisible" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "TypeDoesNotEndInSort" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Telescope))))

Methods

from :: IncorrectTypeForRewriteRelationReason -> Rep IncorrectTypeForRewriteRelationReason x #

to :: Rep IncorrectTypeForRewriteRelationReason x -> IncorrectTypeForRewriteRelationReason #

Instance details

NFData IncorrectTypeForRewriteRelationReason Source #

Methods

showsPrec :: Int -> IncorrectTypeForRewriteRelationReason -> ShowS #

show :: IncorrectTypeForRewriteRelationReason -> String #

showList :: [IncorrectTypeForRewriteRelationReason] -> ShowS #

Instance details

Methods

rnf :: IncorrectTypeForRewriteRelationReason -> () #

type Rep IncorrectTypeForRewriteRelationReason Source #

Instance details

type Rep IncorrectTypeForRewriteRelationReason = D1 ('MetaData "IncorrectTypeForRewriteRelationReason" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "ShouldAcceptAtLeastTwoArguments" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "FinalTwoArgumentsNotVisible" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "TypeDoesNotEndInSort" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Telescope))))

data InductionAndEta Source #

Constructors

InductionAndEta
Fields recordInduction :: Maybe Induction recordEtaEquality :: EtaEquality

Instances

Instances details

Generic InductionAndEta Source #

Instance details

Associated Types

type Rep InductionAndEta

Instance details

type Rep InductionAndEta = D1 ('MetaData "InductionAndEta" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "InductionAndEta" 'PrefixI 'True) (S1 ('MetaSel ('Just "recordInduction") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe Induction)) :*: S1 ('MetaSel ('Just "recordEtaEquality") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 EtaEquality)))

Methods

from :: InductionAndEta -> Rep InductionAndEta x #

to :: Rep InductionAndEta x -> InductionAndEta #

Show InductionAndEta Source #

Instance details

Methods

showsPrec :: Int -> InductionAndEta -> ShowS #

show :: InductionAndEta -> String #

showList :: [InductionAndEta] -> ShowS #

NFData DataOrRecordE Source #

Instance details

Methods

rnf :: DataOrRecordE -> () #

NFData InductionAndEta Source #

Instance details

Methods

rnf :: InductionAndEta -> () #

type Rep InductionAndEta Source #

Instance details

type Rep InductionAndEta = D1 ('MetaData "InductionAndEta" "Agda.TypeChecking.Monad.Base" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "InductionAndEta" 'PrefixI 'True) (S1 ('MetaSel ('Just "recordInduction") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe Induction)) :*: S1 ('MetaSel ('Just "recordEtaEquality") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 EtaEquality)))

sizedTypesOption :: HasOptions m => m Bool Source #

guardednessOption :: HasOptions m => m Bool Source #

withoutKOption :: HasOptions m => m Bool Source #

cubicalCompatibleOption :: HasOptions m => m Bool Source #

enableCaching :: HasOptions m => m Bool Source #

data ReduceEnv Source #

Environment of the reduce monad.

Constructors

ReduceEnv
Fields redEnv :: TCEnv Read only access to environment. redSt :: TCState Read only access to state (signature, metas...). redPred :: Maybe (MetaId -> ReduceM Bool) An optional predicate that is used by `instantiate'` and `instantiateFull'`: meta-variables are only instantiated if they satisfy this predicate.

mapRedEnv :: (TCEnv -> TCEnv) -> ReduceEnv -> ReduceEnv Source #

mapRedSt :: (TCState -> TCState) -> ReduceEnv -> ReduceEnv Source #

mapRedEnvSt :: (TCEnv -> TCEnv) -> (TCState -> TCState) -> ReduceEnv -> ReduceEnv Source #

reduceEnv :: Lens' ReduceEnv TCEnv Source #

reduceSt :: Lens' ReduceEnv TCState Source #

onReduceEnv :: (ReduceEnv -> ReduceEnv) -> ReduceM a -> ReduceM a Source #

fmapReduce :: (a -> b) -> ReduceM a -> ReduceM b Source #

apReduce :: ReduceM (a -> b) -> ReduceM a -> ReduceM b Source #

thenReduce :: ReduceM a -> ReduceM b -> ReduceM b Source #

beforeReduce :: ReduceM a -> ReduceM b -> ReduceM a Source #

bindReduce :: ReduceM a -> (a -> ReduceM b) -> ReduceM b Source #

runReduceF :: (a -> ReduceM b) -> TCM (a -> b) Source #

localR :: (ReduceEnv -> ReduceEnv) -> ReduceM a -> ReduceM a Source #

newtype BlockT (m :: Type -> Type) a Source #

Constructors

BlockT
Fields unBlockT :: ExceptT Blocker m a

Instances

Instances details

MonadTrans BlockT Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods lift :: Monad m => m a -> BlockT m a #
HasOptions m => HasOptions (BlockT m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods pragmaOptions :: BlockT m PragmaOptions Source # commandLineOptions :: BlockT m CommandLineOptions Source #
Monad m => MonadBlock (BlockT m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods patternViolation :: Blocker -> BlockT m a Source # catchPatternErr :: (Blocker -> BlockT m a) -> BlockT m a -> BlockT m a Source #
MonadReduce m => MonadReduce (BlockT m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods liftReduce :: ReduceM a -> BlockT m a Source #
MonadTCEnv m => MonadTCEnv (BlockT m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods askTC :: BlockT m TCEnv Source # localTC :: (TCEnv -> TCEnv) -> BlockT m a -> BlockT m a Source #
MonadTCM m => MonadTCM (BlockT m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods liftTCM :: TCM a -> BlockT m a Source #
MonadTCState m => MonadTCState (BlockT m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods getTC :: BlockT m TCState Source # putTC :: TCState -> BlockT m () Source # modifyTC :: (TCState -> TCState) -> BlockT m () Source #
ReadTCState m => ReadTCState (BlockT m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods getTCState :: BlockT m TCState Source # locallyTCState :: Lens' TCState a -> (a -> a) -> BlockT m b -> BlockT m b Source # withTCState :: (TCState -> TCState) -> BlockT m a -> BlockT m a Source #
HasBuiltins m => HasBuiltins (BlockT m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Builtin Methods getBuiltinThing :: SomeBuiltin -> BlockT m (Maybe (Builtin PrimFun)) Source #
MonadAddContext m => MonadAddContext (BlockT m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Context Methods addCtx :: Name -> Dom Type -> BlockT m a -> BlockT m a Source # addLetBinding' :: Origin -> Name -> Term -> Dom Type -> BlockT m a -> BlockT m a Source # updateContext :: Substitution -> (Context -> Context) -> BlockT m a -> BlockT m a Source # withFreshName :: Range -> ArgName -> (Name -> BlockT m a) -> BlockT m a Source #
MonadDebug m => MonadDebug (BlockT m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Debug Methods formatDebugMessage :: VerboseKey -> VerboseLevel -> TCM Doc -> BlockT m String Source # traceDebugMessage :: VerboseKey -> VerboseLevel -> String -> BlockT m a -> BlockT m a Source # verboseBracket :: VerboseKey -> VerboseLevel -> String -> BlockT m a -> BlockT m a Source # getVerbosity :: BlockT m Verbosity Source # getProfileOptions :: BlockT m ProfileOptions Source # isDebugPrinting :: BlockT m Bool Source # nowDebugPrinting :: BlockT m a -> BlockT m a Source #
PureTCM m => PureTCM (BlockT m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Pure
HasConstInfo m => HasConstInfo (BlockT m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Signature Methods getConstInfo :: QName -> BlockT m Definition Source # getConstInfo' :: QName -> BlockT m (Either SigError Definition) Source # getRewriteRulesFor :: QName -> BlockT m RewriteRules Source #
MonadFail m => MonadFail (BlockT m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods fail :: String -> BlockT m a #
MonadIO m => MonadIO (BlockT m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods liftIO :: IO a -> BlockT m a #
Monad m => Applicative (BlockT m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods pure :: a -> BlockT m a # (<>) :: BlockT m (a -> b) -> BlockT m a -> BlockT m b # liftA2 :: (a -> b -> c) -> BlockT m a -> BlockT m b -> BlockT m c # (>) :: BlockT m a -> BlockT m b -> BlockT m b # (<*) :: BlockT m a -> BlockT m b -> BlockT m a #
Functor m => Functor (BlockT m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods fmap :: (a -> b) -> BlockT m a -> BlockT m b # (<$) :: a -> BlockT m b -> BlockT m a #
Monad m => Monad (BlockT m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods (>>=) :: BlockT m a -> (a -> BlockT m b) -> BlockT m b # (>>) :: BlockT m a -> BlockT m b -> BlockT m b # return :: a -> BlockT m a #

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' TCState a -> a -> m () infix 4 Source #

Overwrite the part of the TCState focused on by the lens.

setTCLens' :: MonadTCState m => Lens' TCState a -> a -> m () Source #

Overwrite the part of the TCState focused on by the lens (strictly).

modifyTCLens :: MonadTCState m => Lens' TCState a -> (a -> a) -> m () Source #

Modify the part of the TCState focused on by the lens.

modifyTCLens' :: MonadTCState m => Lens' TCState a -> (a -> a) -> m () Source #

Modify the part of the TCState focused on by the lens (strictly).

modifyTCLensM :: MonadTCState m => Lens' TCState a -> (a -> m a) -> m () Source #

Modify a part of the state monadically.

stateTCLens :: MonadTCState m => Lens' TCState a -> (a -> (r, a)) -> m r Source #

Modify the part of the TCState focused on by the lens, and return some result.

runBlocked :: Monad m => BlockT m a -> m (Either Blocker a) Source #

pureTCM :: forall (m :: Type -> Type) a. MonadIO m => (TCState -> TCEnv -> a) -> TCMT m a Source #

returnTCMT :: forall (m :: Type -> Type) a. Applicative m => a -> TCMT m a Source #

bindTCMT :: forall (m :: Type -> Type) a b. Monad m => TCMT m a -> (a -> TCMT m b) -> TCMT m b Source #

thenTCMT :: forall (m :: Type -> Type) a b. Applicative m => TCMT m a -> TCMT m b -> TCMT m b Source #

fmapTCMT :: forall (m :: Type -> Type) a b. Functor m => (a -> b) -> TCMT m a -> TCMT m b Source #

apTCMT :: forall (m :: Type -> Type) a b. Applicative m => TCMT m (a -> b) -> TCMT m a -> TCMT m b Source #

internalError :: (HasCallStack, MonadTCM tcm) => String -> tcm 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.

typeError' :: MonadTCError m => CallStack -> TypeError -> m 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.

genericDocError :: (HasCallStack, MonadTCError m) => Doc -> 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 TCM action (a TCM 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 :: Type -> Type) where Source #

Minimal complete definition

Nothing

Methods

pragmaOptions :: m PragmaOptions Source #

Returns the pragma options which are currently in effect.

default pragmaOptions :: forall (n :: Type -> Type) (t :: (Type -> Type) -> Type -> Type). (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 :: forall (n :: Type -> Type) (t :: (Type -> Type) -> Type -> Type). (HasOptions n, MonadTrans t, m ~ t n) => m CommandLineOptions Source #

Instances

Instances details

HasOptions IM Source #
Instance details Defined in Agda.Interaction.Monad Methods pragmaOptions :: IM PragmaOptions Source # commandLineOptions :: IM CommandLineOptions Source #
HasOptions AbsToCon Source #
Instance details Defined in Agda.Syntax.Translation.AbstractToConcrete Methods pragmaOptions :: AbsToCon PragmaOptions Source # commandLineOptions :: AbsToCon CommandLineOptions Source #
HasOptions TerM Source #
Instance details Defined in Agda.Termination.Monad Methods pragmaOptions :: TerM PragmaOptions Source # commandLineOptions :: TerM CommandLineOptions Source #
HasOptions ReduceM Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods pragmaOptions :: ReduceM PragmaOptions Source # commandLineOptions :: ReduceM CommandLineOptions Source #
HasOptions NLM Source #
Instance details Defined in Agda.TypeChecking.Rewriting.NonLinMatch Methods pragmaOptions :: NLM PragmaOptions Source # commandLineOptions :: NLM CommandLineOptions Source #
HasOptions m => HasOptions (PureConversionT m) Source #
Instance details Defined in Agda.TypeChecking.Conversion.Pure Methods pragmaOptions :: PureConversionT m PragmaOptions Source # commandLineOptions :: PureConversionT m CommandLineOptions Source #
HasOptions m => HasOptions (BlockT m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods pragmaOptions :: BlockT m PragmaOptions Source # commandLineOptions :: BlockT m CommandLineOptions Source #
MonadIO m => HasOptions (TCMT m) Source #
Instance details Defined in Agda.TypeChecking.Monad.Base Methods pragmaOptions :: TCMT m PragmaOptions Source # commandLineOptions :: TCMT m CommandLineOptions Source #
HasOptions m => HasOptions (NamesT m) Source #
Instance details Defined in Agda.TypeChecking.Names Methods pragmaOptions :: NamesT m PragmaOptions Source # commandLineOptions :: NamesT m CommandLineOptions Source #
HasOptions m => HasOptions (ListT m) Source #
Instance details Defined in Agda.Interaction.Options.HasOptions Methods pragmaOptions :: ListT m PragmaOptions Source # commandLineOptions :: ListT m CommandLineOptions Source #
HasOptions m => HasOptions (ChangeT m) Source #
Instance details Defined in Agda.Interaction.Options.HasOptions Methods pragmaOptions :: ChangeT m PragmaOptions Source # commandLineOptions :: ChangeT m CommandLineOptions Source #
HasOptions m => HasOptions (MaybeT m) Source #
Instance details Defined in Agda.Interaction.Options.HasOptions Methods pragmaOptions :: MaybeT m PragmaOptions Source # commandLineOptions :: MaybeT m CommandLineOptions Source #
HasOptions m => HasOptions (ExceptT e m) Source #
Instance details Defined in Agda.Interaction.Options.HasOptions Methods pragmaOptions :: ExceptT e m PragmaOptions Source # commandLineOptions :: ExceptT e m CommandLineOptions Source #
HasOptions m => HasOptions (IdentityT m) Source #
Instance details Defined in Agda.Interaction.Options.HasOptions Methods pragmaOptions :: IdentityT m PragmaOptions Source # commandLineOptions :: IdentityT m CommandLineOptions Source #
HasOptions m => HasOptions (ReaderT r m) Source #
Instance details Defined in Agda.Interaction.Options.HasOptions Methods pragmaOptions :: ReaderT r m PragmaOptions Source # commandLineOptions :: ReaderT r m CommandLineOptions Source #
HasOptions m => HasOptions (StateT s m) Source #
Instance details Defined in Agda.Interaction.Options.HasOptions Methods pragmaOptions :: StateT s m PragmaOptions Source # commandLineOptions :: StateT s m CommandLineOptions Source #
(HasOptions m, Monoid w) => HasOptions (WriterT w m) Source #
Instance details Defined in Agda.Interaction.Options.HasOptions Methods pragmaOptions :: WriterT w m PragmaOptions Source # commandLineOptions :: WriterT w m CommandLineOptions Source #

data RecordFieldWarning Source #

Instances

Instances details

EmbPrj RecordFieldWarning Source #

Instance details

Defined in Agda.TypeChecking.Serialise.Instances.Errors

Methods

icode :: RecordFieldWarning -> S Int32 Source #

icod_ :: RecordFieldWarning -> S Int32 Source #

value :: Int32 -> R RecordFieldWarning Source #

Generic RecordFieldWarning Source #

Instance details

Associated Types

type Rep RecordFieldWarning

Instance details

type Rep RecordFieldWarning = D1 ('MetaData "RecordFieldWarning" "Agda.TypeChecking.Monad.Base.Warning" "Agda-2.6.4.2-inplace" 'False) (C1 ('MetaCons "DuplicateFields" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [(Name, Range)])) :+: C1 ('MetaCons "TooManyFields" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Name]) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [(Name, Range)]))))

Methods

from :: RecordFieldWarning -> Rep RecordFieldWarning x #

to :: Rep RecordFieldWarning x -> RecordFieldWarning #

Show RecordFieldWarning Source #

Instance details

Methods

showsPrec :: Int -> RecordFieldWarning -> ShowS #

show :: RecordFieldWarning -> String #

showList :: [RecordFieldWarning] -> ShowS #

NFData RecordFieldWarning Source #

Instance details

Methods

rnf :: RecordFieldWarning -> () #

type Rep RecordFieldWarning Source #

Instance details