Agda.Compiler.Backend

Interface for compiler backend writers.

Documentation

data Backend where

Constructors

Backend :: NFData opts => Backend' opts env menv mod def -> Backend

Instances

NFData Backend

Defined in Agda.Compiler.Backend

Methods

rnf :: Backend -> ()

data Backend' opts env menv mod def

Constructors

Backend'

Fields

• backendName :: String
• backendVersion :: Maybe String

  Optional version information to be printed with --version.

• options :: opts

  Default options

• commandLineFlags :: [OptDescr (Flag opts)]

  Backend-specific command-line flags. Should at minimum contain a flag to enable the backend.

• isEnabled :: opts -> Bool

  Unless the backend has been enabled, runAgda will fall back to vanilla Agda behaviour.

• preCompile :: opts -> TCM env

  Called after type checking completes, but before compilation starts.

• postCompile :: env -> IsMain -> Map ModuleName mod -> TCM ()

  Called after module compilation has completed. The IsMain argument is NotMain if the --no-main flag is present.

• preModule :: env -> IsMain -> ModuleName -> Maybe FilePath -> TCM (Recompile menv mod)

  Called before compilation of each module. Gets the path to the .agdai file to allow up-to-date checking of previously written compilation results. Should return Skip m if compilation is not required. Will be Nothing if only scope checking.

• postModule :: env -> menv -> IsMain -> ModuleName -> [def] -> TCM mod

  Called after all definitions of a module have been compiled.

• compileDef :: env -> menv -> IsMain -> Definition -> TCM def

  Compile a single definition.

• scopeCheckingSuffices :: Bool

  True if the backend works if --only-scope-checking is used.

• mayEraseType :: QName -> TCM Bool

  The treeless compiler may ask the Backend if elements of the given type maybe possibly erased. The answer should be False if the compilation of the type is used by a third party, e.g. in a FFI binding.

Instances

Generic (Backend' opts env menv mod def)

Defined in Agda.Compiler.Backend

Associated Types

type Rep (Backend' opts env menv mod def) :: Type -> Type

Methods

from :: Backend' opts env menv mod def -> Rep (Backend' opts env menv mod def) x

to :: Rep (Backend' opts env menv mod def) x -> Backend' opts env menv mod def

NFData opts => NFData (Backend' opts env menv mod def)

Defined in Agda.Compiler.Backend

Methods

rnf :: Backend' opts env menv mod def -> ()

type Rep (Backend' opts env menv mod def)

Defined in Agda.Compiler.Backend

type Rep (Backend' opts env menv mod def) = D1 ('MetaData "Backend'" "Agda.Compiler.Backend" "Agda-2.6.2.1.20220327-inplace" 'False) (C1 ('MetaCons "Backend'" 'PrefixI 'True) (((S1 ('MetaSel ('Just "backendName") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String) :*: (S1 ('MetaSel ('Just "backendVersion") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe String)) :*: S1 ('MetaSel ('Just "options") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 opts))) :*: (S1 ('MetaSel ('Just "commandLineFlags") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [OptDescr (Flag opts)]) :*: (S1 ('MetaSel ('Just "isEnabled") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (opts -> Bool)) :*: S1 ('MetaSel ('Just "preCompile") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (opts -> TCM env))))) :*: ((S1 ('MetaSel ('Just "postCompile") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (env -> IsMain -> Map ModuleName mod -> TCM ())) :*: (S1 ('MetaSel ('Just "preModule") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (env -> IsMain -> ModuleName -> Maybe FilePath -> TCM (Recompile menv mod))) :*: S1 ('MetaSel ('Just "postModule") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (env -> menv -> IsMain -> ModuleName -> [def] -> TCM mod)))) :*: (S1 ('MetaSel ('Just "compileDef") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (env -> menv -> IsMain -> Definition -> TCM def)) :*: (S1 ('MetaSel ('Just "scopeCheckingSuffices") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool) :*: S1 ('MetaSel ('Just "mayEraseType") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (QName -> TCM Bool)))))))

data Recompile menv mod

Constructors

Recompile menv

Skip mod

data IsMain

Constructors

IsMain

NotMain

Instances

Monoid IsMain

Defined in Agda.Compiler.Common

Methods

mempty :: IsMain

mappend :: IsMain -> IsMain -> IsMain

mconcat :: [IsMain] -> IsMain

Semigroup IsMain

Conjunctive semigroup (NotMain is absorbing).

Defined in Agda.Compiler.Common

Methods

(<>) :: IsMain -> IsMain -> IsMain

sconcat :: NonEmpty IsMain -> IsMain

stimes :: Integral b => b -> IsMain -> IsMain

Show IsMain

Defined in Agda.Compiler.Common

Methods

showsPrec :: Int -> IsMain -> ShowS

show :: IsMain -> String

showList :: [IsMain] -> ShowS

Eq IsMain

Defined in Agda.Compiler.Common

Methods

(==) :: IsMain -> IsMain -> Bool

(/=) :: IsMain -> IsMain -> Bool

type Flag opts = opts -> OptM opts

f :: Flag opts is an action on the option record that results from parsing an option. f opts produces either an error message or an updated options record

toTreeless :: EvaluationStrategy -> QName -> TCM (Maybe TTerm)

Converts compiled clauses to treeless syntax.

Note: Do not use any of the concrete names in the returned term for identification purposes! If you wish to do so, first apply the Agda.Compiler.Treeless.NormalizeNames transformation.

module Agda.Syntax.Treeless

class (Functor m, Applicative m, Monad m) => MonadDebug m where

Minimal complete definition

Nothing

Methods

formatDebugMessage :: VerboseKey -> VerboseLevel -> TCM Doc -> m String

default formatDebugMessage :: (MonadTrans t, MonadDebug n, m ~ t n) => VerboseKey -> VerboseLevel -> TCM Doc -> m String

traceDebugMessage :: VerboseKey -> VerboseLevel -> String -> m a -> m a

default traceDebugMessage :: (MonadTransControl t, MonadDebug n, m ~ t n) => VerboseKey -> VerboseLevel -> String -> m a -> m a

verboseBracket :: VerboseKey -> VerboseLevel -> String -> m a -> m a

Print brackets around debug messages issued by a computation.

default verboseBracket :: (MonadTransControl t, MonadDebug n, m ~ t n) => VerboseKey -> VerboseLevel -> String -> m a -> m a

getVerbosity :: m Verbosity

default getVerbosity :: (MonadTrans t, MonadDebug n, m ~ t n) => m Verbosity

isDebugPrinting :: m Bool

Check whether we are currently debug printing.

default isDebugPrinting :: (MonadTrans t, MonadDebug n, m ~ t n) => m Bool

nowDebugPrinting :: m a -> m a

Flag in a computation that we are currently debug printing.

default nowDebugPrinting :: (MonadTransControl t, MonadDebug n, m ~ t n) => m a -> m a

Instances

MonadDebug AbsToCon

Defined in Agda.Syntax.Translation.AbstractToConcrete

Methods

formatDebugMessage :: VerboseKey -> VerboseLevel -> TCM Doc -> AbsToCon String

traceDebugMessage :: VerboseKey -> VerboseLevel -> String -> AbsToCon a -> AbsToCon a

verboseBracket :: VerboseKey -> VerboseLevel -> String -> AbsToCon a -> AbsToCon a

getVerbosity :: AbsToCon Verbosity

isDebugPrinting :: AbsToCon Bool

nowDebugPrinting :: AbsToCon a -> AbsToCon a

MonadDebug TerM

Defined in Agda.Termination.Monad

Methods

formatDebugMessage :: VerboseKey -> VerboseLevel -> TCM Doc -> TerM String

traceDebugMessage :: VerboseKey -> VerboseLevel -> String -> TerM a -> TerM a

verboseBracket :: VerboseKey -> VerboseLevel -> String -> TerM a -> TerM a

getVerbosity :: TerM Verbosity

isDebugPrinting :: TerM Bool

nowDebugPrinting :: TerM a -> TerM a

MonadDebug ReduceM

Defined in Agda.TypeChecking.Reduce.Monad

Methods

formatDebugMessage :: VerboseKey -> VerboseLevel -> TCM Doc -> ReduceM String

traceDebugMessage :: VerboseKey -> VerboseLevel -> String -> ReduceM a -> ReduceM a

verboseBracket :: VerboseKey -> VerboseLevel -> String -> ReduceM a -> ReduceM a

getVerbosity :: ReduceM Verbosity

isDebugPrinting :: ReduceM Bool

nowDebugPrinting :: ReduceM a -> ReduceM a

MonadDebug TCM

Defined in Agda.TypeChecking.Monad.Debug

Methods

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

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

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

getVerbosity :: TCM Verbosity

isDebugPrinting :: TCM Bool

nowDebugPrinting :: TCM a -> TCM a

MonadDebug NLM

Defined in Agda.TypeChecking.Rewriting.NonLinMatch

Methods

formatDebugMessage :: VerboseKey -> VerboseLevel -> TCM Doc -> NLM String

traceDebugMessage :: VerboseKey -> VerboseLevel -> String -> NLM a -> NLM a

verboseBracket :: VerboseKey -> VerboseLevel -> String -> NLM a -> NLM a

getVerbosity :: NLM Verbosity

isDebugPrinting :: NLM Bool

nowDebugPrinting :: NLM a -> NLM a

MonadDebug m => MonadDebug (PureConversionT m)

Defined in Agda.TypeChecking.Conversion.Pure

Methods

formatDebugMessage :: VerboseKey -> VerboseLevel -> TCM Doc -> PureConversionT m String

traceDebugMessage :: VerboseKey -> VerboseLevel -> String -> PureConversionT m a -> PureConversionT m a

verboseBracket :: VerboseKey -> VerboseLevel -> String -> PureConversionT m a -> PureConversionT m a

getVerbosity :: PureConversionT m Verbosity

isDebugPrinting :: PureConversionT m Bool

nowDebugPrinting :: PureConversionT m a -> PureConversionT m a

MonadDebug m => MonadDebug (BlockT m)

Defined in Agda.TypeChecking.Monad.Debug

Methods

formatDebugMessage :: VerboseKey -> VerboseLevel -> TCM Doc -> BlockT m String

traceDebugMessage :: VerboseKey -> VerboseLevel -> String -> BlockT m a -> BlockT m a

verboseBracket :: VerboseKey -> VerboseLevel -> String -> BlockT m a -> BlockT m a

getVerbosity :: BlockT m Verbosity

isDebugPrinting :: BlockT m Bool

nowDebugPrinting :: BlockT m a -> BlockT m a

MonadDebug m => MonadDebug (NamesT m)

Defined in Agda.TypeChecking.Names

Methods

formatDebugMessage :: VerboseKey -> VerboseLevel -> TCM Doc -> NamesT m String

traceDebugMessage :: VerboseKey -> VerboseLevel -> String -> NamesT m a -> NamesT m a

verboseBracket :: VerboseKey -> VerboseLevel -> String -> NamesT m a -> NamesT m a

getVerbosity :: NamesT m Verbosity

isDebugPrinting :: NamesT m Bool

nowDebugPrinting :: NamesT m a -> NamesT m a

MonadDebug m => MonadDebug (ListT m)

Defined in Agda.TypeChecking.Monad.Debug

Methods

formatDebugMessage :: VerboseKey -> VerboseLevel -> TCM Doc -> ListT m String

traceDebugMessage :: VerboseKey -> VerboseLevel -> String -> ListT m a -> ListT m a

verboseBracket :: VerboseKey -> VerboseLevel -> String -> ListT m a -> ListT m a

getVerbosity :: ListT m Verbosity

isDebugPrinting :: ListT m Bool

nowDebugPrinting :: ListT m a -> ListT m a

MonadDebug m => MonadDebug (ChangeT m)

Defined in Agda.TypeChecking.Monad.Debug

Methods

formatDebugMessage :: VerboseKey -> VerboseLevel -> TCM Doc -> ChangeT m String

traceDebugMessage :: VerboseKey -> VerboseLevel -> String -> ChangeT m a -> ChangeT m a

verboseBracket :: VerboseKey -> VerboseLevel -> String -> ChangeT m a -> ChangeT m a

getVerbosity :: ChangeT m Verbosity

isDebugPrinting :: ChangeT m Bool

nowDebugPrinting :: ChangeT m a -> ChangeT m a

MonadDebug m => MonadDebug (MaybeT m)

Defined in Agda.TypeChecking.Monad.Debug

Methods

formatDebugMessage :: VerboseKey -> VerboseLevel -> TCM Doc -> MaybeT m String

traceDebugMessage :: VerboseKey -> VerboseLevel -> String -> MaybeT m a -> MaybeT m a

verboseBracket :: VerboseKey -> VerboseLevel -> String -> MaybeT m a -> MaybeT m a

getVerbosity :: MaybeT m Verbosity

isDebugPrinting :: MaybeT m Bool

nowDebugPrinting :: MaybeT m a -> MaybeT m a

MonadDebug m => MonadDebug (ExceptT e m)

Defined in Agda.TypeChecking.Monad.Debug

Methods

formatDebugMessage :: VerboseKey -> VerboseLevel -> TCM Doc -> ExceptT e m String

traceDebugMessage :: VerboseKey -> VerboseLevel -> String -> ExceptT e m a -> ExceptT e m a

verboseBracket :: VerboseKey -> VerboseLevel -> String -> ExceptT e m a -> ExceptT e m a

getVerbosity :: ExceptT e m Verbosity

isDebugPrinting :: ExceptT e m Bool

nowDebugPrinting :: ExceptT e m a -> ExceptT e m a

MonadDebug m => MonadDebug (IdentityT m)

Defined in Agda.TypeChecking.Monad.Debug

Methods

formatDebugMessage :: VerboseKey -> VerboseLevel -> TCM Doc -> IdentityT m String

traceDebugMessage :: VerboseKey -> VerboseLevel -> String -> IdentityT m a -> IdentityT m a

verboseBracket :: VerboseKey -> VerboseLevel -> String -> IdentityT m a -> IdentityT m a

getVerbosity :: IdentityT m Verbosity

isDebugPrinting :: IdentityT m Bool

nowDebugPrinting :: IdentityT m a -> IdentityT m a

MonadDebug m => MonadDebug (ReaderT r m)

Defined in Agda.TypeChecking.Monad.Debug

Methods

formatDebugMessage :: VerboseKey -> VerboseLevel -> TCM Doc -> ReaderT r m String

traceDebugMessage :: VerboseKey -> VerboseLevel -> String -> ReaderT r m a -> ReaderT r m a

verboseBracket :: VerboseKey -> VerboseLevel -> String -> ReaderT r m a -> ReaderT r m a

getVerbosity :: ReaderT r m Verbosity

isDebugPrinting :: ReaderT r m Bool

nowDebugPrinting :: ReaderT r m a -> ReaderT r m a

MonadDebug m => MonadDebug (StateT s m)

Defined in Agda.TypeChecking.Monad.Debug

Methods

formatDebugMessage :: VerboseKey -> VerboseLevel -> TCM Doc -> StateT s m String

traceDebugMessage :: VerboseKey -> VerboseLevel -> String -> StateT s m a -> StateT s m a

verboseBracket :: VerboseKey -> VerboseLevel -> String -> StateT s m a -> StateT s m a

getVerbosity :: StateT s m Verbosity

isDebugPrinting :: StateT s m Bool

nowDebugPrinting :: StateT s m a -> StateT s m a

(MonadDebug m, Monoid w) => MonadDebug (WriterT w m)

Defined in Agda.TypeChecking.Monad.Debug

Methods

formatDebugMessage :: VerboseKey -> VerboseLevel -> TCM Doc -> WriterT w m String

traceDebugMessage :: VerboseKey -> VerboseLevel -> String -> WriterT w m a -> WriterT w m a

verboseBracket :: VerboseKey -> VerboseLevel -> String -> WriterT w m a -> WriterT w m a

getVerbosity :: WriterT w m Verbosity

isDebugPrinting :: WriterT w m Bool

nowDebugPrinting :: WriterT w m a -> WriterT w m a

data Polarity

Polarity for equality and subtype checking.

Constructors

Covariant

monotone

Contravariant

antitone

Invariant

no information (mixed variance)

Nonvariant

constant

Instances

KillRange Polarity

Defined in Agda.TypeChecking.Monad.Base

Methods

killRange :: KillRangeT Polarity

PrettyTCM Polarity

Defined in Agda.TypeChecking.Pretty

Methods

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

EmbPrj Polarity

Defined in Agda.TypeChecking.Serialise.Instances.Internal

Methods

icode :: Polarity -> S Int32

icod_ :: Polarity -> S Int32

value :: Int32 -> R Polarity

Pretty Polarity

Defined in Agda.TypeChecking.Monad.Base

Methods

pretty :: Polarity -> Doc

prettyPrec :: Int -> Polarity -> Doc

prettyList :: [Polarity] -> Doc

Data Polarity

Defined in Agda.TypeChecking.Monad.Base

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Polarity -> c Polarity

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Polarity

toConstr :: Polarity -> Constr

dataTypeOf :: Polarity -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Polarity)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Polarity)

gmapT :: (forall b. Data b => b -> b) -> Polarity -> Polarity

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Polarity -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Polarity -> r

gmapQ :: (forall d. Data d => d -> u) -> Polarity -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Polarity -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Polarity -> m Polarity

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Polarity -> m Polarity

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Polarity -> m Polarity

Generic Polarity

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep Polarity :: Type -> Type

Methods

from :: Polarity -> Rep Polarity x

to :: Rep Polarity x -> Polarity

Show Polarity

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> Polarity -> ShowS

show :: Polarity -> String

showList :: [Polarity] -> ShowS

NFData Polarity

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: Polarity -> ()

Eq Polarity

Defined in Agda.TypeChecking.Monad.Base

Methods

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

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

Abstract [Polarity]

Defined in Agda.TypeChecking.Substitute

Methods

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

Apply [Polarity]

Defined in Agda.TypeChecking.Substitute

Methods

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

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

type Rep Polarity

Defined in Agda.TypeChecking.Monad.Base

type Rep Polarity = D1 ('MetaData "Polarity" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-inplace" 'False) ((C1 ('MetaCons "Covariant" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "Contravariant" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "Invariant" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "Nonvariant" 'PrefixI 'False) (U1 :: Type -> Type)))

data Comparison

Constructors

CmpEq

CmpLeq

Instances

PrettyTCM Comparison

Defined in Agda.TypeChecking.Pretty

Methods

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

Pretty Comparison

Defined in Agda.TypeChecking.Monad.Base

Methods

pretty :: Comparison -> Doc

prettyPrec :: Int -> Comparison -> Doc

prettyList :: [Comparison] -> Doc

Data Comparison

Defined in Agda.TypeChecking.Monad.Base

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Comparison -> c Comparison

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Comparison

toConstr :: Comparison -> Constr

dataTypeOf :: Comparison -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Comparison)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Comparison)

gmapT :: (forall b. Data b => b -> b) -> Comparison -> Comparison

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Comparison -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Comparison -> r

gmapQ :: (forall d. Data d => d -> u) -> Comparison -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Comparison -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Comparison -> m Comparison

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Comparison -> m Comparison

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Comparison -> m Comparison

Generic Comparison

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep Comparison :: Type -> Type

Methods

from :: Comparison -> Rep Comparison x

to :: Rep Comparison x -> Comparison

Show Comparison

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> Comparison -> ShowS

show :: Comparison -> String

showList :: [Comparison] -> ShowS

NFData Comparison

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: Comparison -> ()

Eq Comparison

Defined in Agda.TypeChecking.Monad.Base

Methods

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

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

type Rep Comparison

Defined in Agda.TypeChecking.Monad.Base

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

type BackendName = String

type ModuleToSource = Map TopLevelModuleName AbsolutePath

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

type TCM = TCMT IO

Type checking monad.

newtype TCMT m a

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

Constructors

TCM

Fields

• unTCM :: IORef TCState -> TCEnv -> m a

Instances

MonadFixityError ScopeM

Defined in Agda.Syntax.Scope.Monad

Methods

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

throwMultiplePolarityPragmas :: [Name] -> ScopeM a

warnUnknownNamesInFixityDecl :: [Name] -> ScopeM ()

warnUnknownNamesInPolarityPragmas :: [Name] -> ScopeM ()

warnUnknownFixityInMixfixDecl :: [Name] -> ScopeM ()

warnPolarityPragmasButNotPostulates :: [Name] -> ScopeM ()

MonadBlock TCM

Defined in Agda.TypeChecking.Monad.Base

Methods

patternViolation :: Blocker -> TCM a

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

MonadStConcreteNames TCM

Defined in Agda.TypeChecking.Monad.Base

Methods

runStConcreteNames :: StateT ConcreteNames TCM a -> TCM a

useConcreteNames :: TCM ConcreteNames

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

MonadConstraint TCM

Defined in Agda.TypeChecking.Constraints

Methods

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

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

solveConstraint :: Constraint -> TCM ()

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

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

stealConstraints :: ProblemId -> TCM ()

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

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

MonadAddContext TCM

Defined in Agda.TypeChecking.Monad.Context

Methods

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

addLetBinding' :: Name -> Term -> Dom Type -> TCM a -> TCM a

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

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

MonadDebug TCM

Defined in Agda.TypeChecking.Monad.Debug

Methods

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

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

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

getVerbosity :: TCM Verbosity

isDebugPrinting :: TCM Bool

nowDebugPrinting :: TCM a -> TCM a

MonadInteractionPoints TCM

Defined in Agda.TypeChecking.Monad.MetaVars

Methods

freshInteractionId :: TCM InteractionId

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

MonadMetaSolver TCM

Defined in Agda.TypeChecking.MetaVars

Methods

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

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

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

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

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

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

PureTCM TCM

Defined in Agda.TypeChecking.Monad.Pure

MonadStatistics TCM

Defined in Agda.TypeChecking.Monad.Statistics

Methods

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

MonadTrace TCM

Defined in Agda.TypeChecking.Monad.Trace

Methods

traceCall :: Call -> TCM a -> TCM a

traceCallM :: TCM Call -> TCM a -> TCM a

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

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

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

MonadWarning TCM

Defined in Agda.TypeChecking.Warnings

Methods

addWarning :: TCWarning -> TCM ()

MonadBench TCM

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

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type BenchPhase TCM

Methods

getBenchmark :: TCM (Benchmark (BenchPhase TCM))

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

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

finally :: TCM b -> TCM c -> TCM b

CatchImpossible TCM

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.

Defined in Agda.TypeChecking.Monad.Base

Methods

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

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

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

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

MonadTrans TCMT

Defined in Agda.TypeChecking.Monad.Base

Methods

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

HasFresh i => MonadFresh i TCM

Defined in Agda.TypeChecking.Monad.Base

Methods

fresh :: TCM i

MonadError TCErr TCM

Defined in Agda.TypeChecking.Monad.Base

Methods

throwError :: TCErr -> TCM a

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

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

Defined in Agda.Auto.Convert

Methods

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

Conversion TOM Term (MExp O)

Defined in Agda.Auto.Convert

Methods

convert :: Term -> TOM (MExp O)

Conversion TOM Type (MExp O)

Defined in Agda.Auto.Convert

Methods

convert :: Type -> TOM (MExp O)

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

Defined in Agda.Auto.Convert

Methods

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

Conversion TOM (Arg Pattern) (Pat O)

Defined in Agda.Auto.Convert

Methods

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

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

Defined in Agda.Auto.Convert

Methods

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

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

Defined in Agda.Auto.Convert

Methods

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

MonadIO m => HasOptions (TCMT m)

Defined in Agda.TypeChecking.Monad.Base

Methods

pragmaOptions :: TCMT m PragmaOptions

commandLineOptions :: TCMT m CommandLineOptions

MonadIO m => MonadReduce (TCMT m)

Defined in Agda.TypeChecking.Monad.Base

Methods

liftReduce :: ReduceM a -> TCMT m a

MonadIO m => MonadTCEnv (TCMT m)

Defined in Agda.TypeChecking.Monad.Base

Methods

askTC :: TCMT m TCEnv

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

MonadIO m => MonadTCM (TCMT m)

Defined in Agda.TypeChecking.Monad.Base

Methods

liftTCM :: TCM a -> TCMT m a

MonadIO m => MonadTCState (TCMT m)

Defined in Agda.TypeChecking.Monad.Base

Methods

getTC :: TCMT m TCState

putTC :: TCState -> TCMT m ()

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

MonadIO m => ReadTCState (TCMT m)

Defined in Agda.TypeChecking.Monad.Base

Methods

getTCState :: TCMT m TCState

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

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

MonadIO m => HasBuiltins (TCMT m)

Defined in Agda.TypeChecking.Monad.Builtin

Methods

getBuiltinThing :: String -> TCMT m (Maybe (Builtin PrimFun))

ReportS (TCM Doc)

Defined in Agda.TypeChecking.Monad.Debug

Methods

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

ReportS [TCM Doc]

Defined in Agda.TypeChecking.Monad.Debug

Methods

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

TraceS (TCM Doc)

Defined in Agda.TypeChecking.Monad.Debug

Methods

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

TraceS [TCM Doc]

Defined in Agda.TypeChecking.Monad.Debug

Methods

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

HasConstInfo (TCMT IO)

Defined in Agda.TypeChecking.Monad.Signature

Methods

getConstInfo :: QName -> TCMT IO Definition

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

getRewriteRulesFor :: QName -> TCMT IO RewriteRules

Null (TCM Doc)

Defined in Agda.TypeChecking.Monad.Base

Methods

empty :: TCM Doc

null :: TCM Doc -> Bool

MonadIO m => MonadFail (TCMT m)

Defined in Agda.TypeChecking.Monad.Base

Methods

fail :: String -> TCMT m a

MonadIO m => MonadIO (TCMT m)

Defined in Agda.TypeChecking.Monad.Base

Methods

liftIO :: IO a -> TCMT m a

Applicative m => Applicative (TCMT m)

Defined in Agda.TypeChecking.Monad.Base

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)

Defined in Agda.TypeChecking.Monad.Base

Methods

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

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

Monad m => Monad (TCMT m)

Defined in Agda.TypeChecking.Monad.Base

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)

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

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)

Defined in Agda.TypeChecking.Monad.Base

Methods

empty :: TCMT m a

null :: TCMT m a -> Bool

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

Defined in Agda.TypeChecking.Monad.Base

Methods

fromString :: String -> TCMT m a

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

Strict (non-shortcut) monoid.

Defined in Agda.TypeChecking.Monad.Base

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)

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.

Defined in Agda.TypeChecking.Monad.Base

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

Defined in Agda.TypeChecking.Monad.Base

type BenchPhase TCM = Phase

data TCState

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

LensCommandLineOptions TCState

Defined in Agda.Interaction.Options.Lenses

Methods

getCommandLineOptions :: TCState -> CommandLineOptions

setCommandLineOptions :: CommandLineOptions -> TCState -> TCState

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

LensIncludePaths TCState

Defined in Agda.Interaction.Options.Lenses

Methods

getIncludePaths :: TCState -> [FilePath]

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

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

getAbsoluteIncludePaths :: TCState -> [AbsolutePath]

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

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

LensPersistentVerbosity TCState

Defined in Agda.Interaction.Options.Lenses

Methods

getPersistentVerbosity :: TCState -> PersistentVerbosity

setPersistentVerbosity :: PersistentVerbosity -> TCState -> TCState

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

LensPragmaOptions TCState

Defined in Agda.Interaction.Options.Lenses

Methods

getPragmaOptions :: TCState -> PragmaOptions

setPragmaOptions :: PragmaOptions -> TCState -> TCState

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

lensPragmaOptions :: Lens' PragmaOptions TCState

LensSafeMode TCState

Defined in Agda.Interaction.Options.Lenses

Methods

getSafeMode :: TCState -> SafeMode

setSafeMode :: SafeMode -> TCState -> TCState

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

LensVerbosity TCState

Defined in Agda.Interaction.Options.Lenses

Methods

getVerbosity :: TCState -> Verbosity

setVerbosity :: Verbosity -> TCState -> TCState

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

Generic TCState

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep TCState :: Type -> Type

Methods

from :: TCState -> Rep TCState x

to :: Rep TCState x -> TCState

Show TCState

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> TCState -> ShowS

show :: TCState -> String

showList :: [TCState] -> ShowS

NFData TCState

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: TCState -> ()

type Rep TCState

Defined in Agda.TypeChecking.Monad.Base

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

data TCEnv

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.

• envModality :: Modality

  Relevance component: Are we checking an irrelevant argument? (=Irrelevant) Then top-level irrelevant declarations are enabled. Other value: Relevant, then only relevant decls. are available.

  Quantity component: Are we checking a runtime-irrelevant thing? (=Quantity0) Then runtime-irrelevant things are usable. Other value: Quantity1, runtime relevant. Quantityω is not allowed here, see Bob Atkey, LiCS 2018.

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

• 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 debugging of incomplete matches only.)

• 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?

Instances

LensIsAbstract TCEnv

Defined in Agda.TypeChecking.Monad.Base

Methods

lensIsAbstract :: Lens' IsAbstract TCEnv

LensModality TCEnv

Defined in Agda.TypeChecking.Monad.Base

Methods

getModality :: TCEnv -> Modality

setModality :: Modality -> TCEnv -> TCEnv

mapModality :: (Modality -> Modality) -> TCEnv -> TCEnv

LensQuantity TCEnv

Defined in Agda.TypeChecking.Monad.Base

Methods

getQuantity :: TCEnv -> Quantity

setQuantity :: Quantity -> TCEnv -> TCEnv

mapQuantity :: (Quantity -> Quantity) -> TCEnv -> TCEnv

LensRelevance TCEnv

Defined in Agda.TypeChecking.Monad.Base

Methods

getRelevance :: TCEnv -> Relevance

setRelevance :: Relevance -> TCEnv -> TCEnv

mapRelevance :: (Relevance -> Relevance) -> TCEnv -> TCEnv

LensTCEnv TCEnv

Defined in Agda.TypeChecking.Monad.Base

Methods

lensTCEnv :: Lens' TCEnv TCEnv

Generic TCEnv

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep TCEnv :: Type -> Type

Methods

from :: TCEnv -> Rep TCEnv x

to :: Rep TCEnv x -> TCEnv

NFData TCEnv

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: TCEnv -> ()

type Rep TCEnv

Defined in Agda.TypeChecking.Monad.Base

type Rep TCEnv = D1 ('MetaData "TCEnv" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-inplace" 'False) (C1 ('MetaCons "TCEnv" 'PrefixI 'True) (((((S1 ('MetaSel ('Just "envContext") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Context) :*: (S1 ('MetaSel ('Just "envLetBindings") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 LetBindings) :*: S1 ('MetaSel ('Just "envCurrentModule") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ModuleName))) :*: (S1 ('MetaSel ('Just "envCurrentPath") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe AbsolutePath)) :*: (S1 ('MetaSel ('Just "envAnonymousModules") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [(ModuleName, Nat)]) :*: S1 ('MetaSel ('Just "envImportPath") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [TopLevelModuleName])))) :*: ((S1 ('MetaSel ('Just "envMutualBlock") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe MutualId)) :*: (S1 ('MetaSel ('Just "envTerminationCheck") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (TerminationCheck ())) :*: S1 ('MetaSel ('Just "envCoverageCheck") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 CoverageCheck))) :*: (S1 ('MetaSel ('Just "envMakeCase") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool) :*: (S1 ('MetaSel ('Just "envSolvingConstraints") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool) :*: S1 ('MetaSel ('Just "envCheckingWhere") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool))))) :*: (((S1 ('MetaSel ('Just "envWorkingOnTypes") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool) :*: (S1 ('MetaSel ('Just "envAssignMetas") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool) :*: S1 ('MetaSel ('Just "envActiveProblems") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Set ProblemId)))) :*: (S1 ('MetaSel ('Just "envAbstractMode") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 AbstractMode) :*: (S1 ('MetaSel ('Just "envModality") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Modality) :*: S1 ('MetaSel ('Just "envSplitOnStrict") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool)))) :*: ((S1 ('MetaSel ('Just "envDisplayFormsEnabled") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool) :*: (S1 ('MetaSel ('Just "envRange") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Range) :*: S1 ('MetaSel ('Just "envHighlightingRange") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Range))) :*: (S1 ('MetaSel ('Just "envClause") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 IPClause) :*: (S1 ('MetaSel ('Just "envCall") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (Closure Call))) :*: S1 ('MetaSel ('Just "envHighlightingLevel") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 HighlightingLevel)))))) :*: ((((S1 ('MetaSel ('Just "envHighlightingMethod") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 HighlightingMethod) :*: (S1 ('MetaSel ('Just "envExpandLast") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ExpandHidden) :*: S1 ('MetaSel ('Just "envAppDef") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe QName)))) :*: (S1 ('MetaSel ('Just "envSimplification") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Simplification) :*: (S1 ('MetaSel ('Just "envAllowedReductions") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 AllowedReductions) :*: S1 ('MetaSel ('Just "envReduceDefs") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ReduceDefs)))) :*: ((S1 ('MetaSel ('Just "envReconstructed") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool) :*: (S1 ('MetaSel ('Just "envInjectivityDepth") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Int) :*: S1 ('MetaSel ('Just "envCompareBlocked") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool))) :*: (S1 ('MetaSel ('Just "envPrintDomainFreePi") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool) :*: (S1 ('MetaSel ('Just "envPrintMetasBare") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool) :*: S1 ('MetaSel ('Just "envInsideDotPattern") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool))))) :*: (((S1 ('MetaSel ('Just "envUnquoteFlags") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 UnquoteFlags) :*: (S1 ('MetaSel ('Just "envInstanceDepth") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Int) :*: S1 ('MetaSel ('Just "envIsDebugPrinting") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool))) :*: (S1 ('MetaSel ('Just "envPrintingPatternLambdas") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [QName]) :*: (S1 ('MetaSel ('Just "envCallByNeed") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool) :*: S1 ('MetaSel ('Just "envCurrentCheckpoint") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 CheckpointId)))) :*: ((S1 ('MetaSel ('Just "envCheckpoints") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Map CheckpointId Substitution)) :*: (S1 ('MetaSel ('Just "envGeneralizeMetas") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 DoGeneralize) :*: S1 ('MetaSel ('Just "envGeneralizedVars") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Map QName GeneralizedValue)))) :*: (S1 ('MetaSel ('Just "envActiveBackendName") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe BackendName)) :*: (S1 ('MetaSel ('Just "envConflComputingOverlap") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool) :*: S1 ('MetaSel ('Just "envCurrentlyElaborating") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool))))))))

data HighlightingLevel

How much highlighting should be sent to the user interface?

Constructors

None

NonInteractive

Interactive

This includes both non-interactive highlighting and interactive highlighting of the expression that is currently being type-checked.

Instances

Data HighlightingLevel

Defined in Agda.TypeChecking.Monad.Base

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> HighlightingLevel -> c HighlightingLevel

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c HighlightingLevel

toConstr :: HighlightingLevel -> Constr

dataTypeOf :: HighlightingLevel -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c HighlightingLevel)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c HighlightingLevel)

gmapT :: (forall b. Data b => b -> b) -> HighlightingLevel -> HighlightingLevel

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> HighlightingLevel -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> HighlightingLevel -> r

gmapQ :: (forall d. Data d => d -> u) -> HighlightingLevel -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> HighlightingLevel -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> HighlightingLevel -> m HighlightingLevel

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> HighlightingLevel -> m HighlightingLevel

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> HighlightingLevel -> m HighlightingLevel

Generic HighlightingLevel

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep HighlightingLevel :: Type -> Type

Methods

from :: HighlightingLevel -> Rep HighlightingLevel x

to :: Rep HighlightingLevel x -> HighlightingLevel

Read HighlightingLevel

Defined in Agda.TypeChecking.Monad.Base

Methods

readsPrec :: Int -> ReadS HighlightingLevel

readList :: ReadS [HighlightingLevel]

readPrec :: ReadPrec HighlightingLevel

readListPrec :: ReadPrec [HighlightingLevel]

Show HighlightingLevel

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> HighlightingLevel -> ShowS

show :: HighlightingLevel -> String

showList :: [HighlightingLevel] -> ShowS

NFData HighlightingLevel

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: HighlightingLevel -> ()

Eq HighlightingLevel

Defined in Agda.TypeChecking.Monad.Base

Methods

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

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

Ord HighlightingLevel

Defined in Agda.TypeChecking.Monad.Base

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

Defined in Agda.TypeChecking.Monad.Base

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

How should highlighting be sent to the user interface?

Constructors

Direct

Via stdout.

Indirect

Both via files and via stdout.

Instances

Data HighlightingMethod

Defined in Agda.TypeChecking.Monad.Base

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> HighlightingMethod -> c HighlightingMethod

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c HighlightingMethod

toConstr :: HighlightingMethod -> Constr

dataTypeOf :: HighlightingMethod -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c HighlightingMethod)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c HighlightingMethod)

gmapT :: (forall b. Data b => b -> b) -> HighlightingMethod -> HighlightingMethod

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> HighlightingMethod -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> HighlightingMethod -> r

gmapQ :: (forall d. Data d => d -> u) -> HighlightingMethod -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> HighlightingMethod -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> HighlightingMethod -> m HighlightingMethod

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> HighlightingMethod -> m HighlightingMethod

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> HighlightingMethod -> m HighlightingMethod

Generic HighlightingMethod

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep HighlightingMethod :: Type -> Type

Methods

from :: HighlightingMethod -> Rep HighlightingMethod x

to :: Rep HighlightingMethod x -> HighlightingMethod

Read HighlightingMethod

Defined in Agda.TypeChecking.Monad.Base

Methods

readsPrec :: Int -> ReadS HighlightingMethod

readList :: ReadS [HighlightingMethod]

readPrec :: ReadPrec HighlightingMethod

readListPrec :: ReadPrec [HighlightingMethod]

Show HighlightingMethod

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> HighlightingMethod -> ShowS

show :: HighlightingMethod -> String

showList :: [HighlightingMethod] -> ShowS

NFData HighlightingMethod

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: HighlightingMethod -> ()

Eq HighlightingMethod

Defined in Agda.TypeChecking.Monad.Base

Methods

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

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

type Rep HighlightingMethod

Defined in Agda.TypeChecking.Monad.Base

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

data NamedMeta

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

Constructors

NamedMeta

Fields

• nmSuggestion :: MetaNameSuggestion
• nmid :: MetaId

Instances

EncodeTCM NamedMeta

Defined in Agda.Interaction.JSONTop

Methods

encodeTCM :: NamedMeta -> TCM Value

ToConcrete NamedMeta

Defined in Agda.Syntax.Translation.AbstractToConcrete

Associated Types

type ConOfAbs NamedMeta

Methods

toConcrete :: NamedMeta -> AbsToCon (ConOfAbs NamedMeta)

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

Pretty NamedMeta

Defined in Agda.TypeChecking.Monad.Base

Methods

pretty :: NamedMeta -> Doc

prettyPrec :: Int -> NamedMeta -> Doc

prettyList :: [NamedMeta] -> Doc

type ConOfAbs NamedMeta

Defined in Agda.Syntax.Translation.AbstractToConcrete

type ConOfAbs NamedMeta = Expr

data TCWarning

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

EncodeTCM TCWarning

Defined in Agda.Interaction.JSONTop

Methods

encodeTCM :: TCWarning -> TCM Value

HasRange TCWarning

Defined in Agda.TypeChecking.Monad.Base

Methods

getRange :: TCWarning -> Range

PrettyTCM TCWarning

Defined in Agda.TypeChecking.Pretty.Warning

Methods

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

EmbPrj TCWarning

Defined in Agda.TypeChecking.Serialise.Instances.Errors

Methods

icode :: TCWarning -> S Int32

icod_ :: TCWarning -> S Int32

value :: Int32 -> R TCWarning

Generic TCWarning

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep TCWarning :: Type -> Type

Methods

from :: TCWarning -> Rep TCWarning x

to :: Rep TCWarning x -> TCWarning

Show TCWarning

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> TCWarning -> ShowS

show :: TCWarning -> String

showList :: [TCWarning] -> ShowS

NFData TCWarning

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: TCWarning -> ()

Eq TCWarning

Defined in Agda.TypeChecking.Monad.Base

Methods

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

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

type Rep TCWarning

Defined in Agda.TypeChecking.Monad.Base

type Rep TCWarning = D1 ('MetaData "TCWarning" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-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 TCErr

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

EncodeTCM TCErr

Defined in Agda.Interaction.JSONTop

Methods

encodeTCM :: TCErr -> TCM Value

HasRange TCErr

Defined in Agda.TypeChecking.Monad.Base

Methods

getRange :: TCErr -> Range

PrettyTCM TCErr

Defined in Agda.TypeChecking.Errors

Methods

prettyTCM :: MonadPretty m => TCErr -> m Doc

Exception TCErr

Defined in Agda.TypeChecking.Monad.Base

Methods

toException :: TCErr -> SomeException

fromException :: SomeException -> Maybe TCErr

displayException :: TCErr -> String

Show TCErr

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> TCErr -> ShowS

show :: TCErr -> String

showList :: [TCErr] -> ShowS

NFData TCErr

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: TCErr -> ()

MonadError TCErr IM

Defined in Agda.Interaction.Monad

Methods

throwError :: TCErr -> IM a

catchError :: IM a -> (TCErr -> IM a) -> IM a

MonadError TCErr TerM

Defined in Agda.Termination.Monad

Methods

throwError :: TCErr -> TerM a

catchError :: TerM a -> (TCErr -> TerM a) -> TerM a

MonadError TCErr TCM

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)

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)

Defined in Agda.TypeChecking.Monad.Base

Methods

patternViolation :: Blocker -> ExceptT TCErr m a

catchPatternErr :: (Blocker -> ExceptT TCErr m a) -> ExceptT TCErr m a -> ExceptT TCErr m a

data Warning

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]

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

CantGeneralizeOverSorts [MetaId]

AbsurdPatternRequiresNoRHS [NamedArg DeBruijnPattern]

OldBuiltin String String

In `OldBuiltin old new`, the BUILTIN old has been replaced by new

EmptyRewritePragma

If the user wrote just {-# 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.

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.

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)

GenericNonFatalError Doc

Generic error which doesn't abort proceedings (not a warning)

GenericUseless Range Doc

Generic warning when code is useless and thus ignored. Range' is for dead code highlighting.

SafeFlagPostulate Name

SafeFlagPragma [String]

Unsafe OPTIONS.

SafeFlagNonTerminating

SafeFlagTerminating

SafeFlagWithoutKFlagPrimEraseEquality

WithoutKFlagPrimEraseEquality

SafeFlagNoPositivityCheck

SafeFlagPolarity

SafeFlagNoUniverseCheck

SafeFlagNoCoverageCheck

SafeFlagInjective

SafeFlagEta

ETA pragma is unsafe.

ParseWarning ParseWarning

LibraryWarning LibWarning

DeprecationWarning String String String

`DeprecationWarning old new version`: 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 String ModuleName

Importing a file using an infective option into one which doesn't

CoInfectiveImport String ModuleName

Importing a file not using a coinfective option from one which does

RewriteNonConfluent Term Term Term Doc

Confluence checker found critical pair and equality checking resulted in a type error

RewriteMaybeNonConfluent Term Term [Doc]

Confluence checker got stuck on computing overlap between two rewrite rules

RewriteAmbiguousRules Term Term Term

The global confluence checker found a term 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

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.

RecordFieldWarning RecordFieldWarning

Instances

EmbPrj Warning

Defined in Agda.TypeChecking.Serialise.Instances.Errors

Methods

icode :: Warning -> S Int32

icod_ :: Warning -> S Int32

value :: Int32 -> R Warning

Generic Warning

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep Warning :: Type -> Type

Methods

from :: Warning -> Rep Warning x

to :: Rep Warning x -> Warning

Show Warning

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> Warning -> ShowS

show :: Warning -> String

showList :: [Warning] -> ShowS

NFData Warning

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: Warning -> ()

type Rep Warning

Defined in Agda.TypeChecking.Monad.Base

type Rep Warning = D1 ('MetaData "Warning" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-inplace" 'False) (((((C1 ('MetaCons "NicifierIssue" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 DeclarationWarning)) :+: (C1 ('MetaCons "TerminationIssue" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [TerminationError])) :+: C1 ('MetaCons "UnreachableClauses" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Range])))) :+: ((C1 ('MetaCons "CoverageIssue" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [(Telescope, [NamedArg DeBruijnPattern])])) :+: C1 ('MetaCons "CoverageNoExactSplit" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Clause]))) :+: (C1 ('MetaCons "NotStrictlyPositive" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Seq OccursWhere))) :+: C1 ('MetaCons "UnsolvedMetaVariables" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Range]))))) :+: ((C1 ('MetaCons "UnsolvedInteractionMetas" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Range])) :+: (C1 ('MetaCons "UnsolvedConstraints" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Constraints)) :+: C1 ('MetaCons "CantGeneralizeOverSorts" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [MetaId])))) :+: ((C1 ('MetaCons "AbsurdPatternRequiresNoRHS" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [NamedArg DeBruijnPattern])) :+: C1 ('MetaCons "OldBuiltin" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String))) :+: (C1 ('MetaCons "EmptyRewritePragma" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "EmptyWhere" 'PrefixI 'False) (U1 :: Type -> Type))))) :+: (((C1 ('MetaCons "IllformedAsClause" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String)) :+: (C1 ('MetaCons "ClashesViaRenaming" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 NameOrModule) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Name])) :+: C1 ('MetaCons "UselessPatternDeclarationForRecord" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String)))) :+: ((C1 ('MetaCons "UselessPublic" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "UselessHiding" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [ImportedName]))) :+: (C1 ('MetaCons "UselessInline" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName)) :+: C1 ('MetaCons "WrongInstanceDeclaration" 'PrefixI 'False) (U1 :: Type -> Type)))) :+: (((C1 ('MetaCons "InstanceWithExplicitArg" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName)) :+: C1 ('MetaCons "InstanceNoOutputTypeName" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Doc))) :+: (C1 ('MetaCons "InstanceArgWithExplicitArg" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Doc)) :+: C1 ('MetaCons "InversionDepthReached" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName)))) :+: ((C1 ('MetaCons "NoGuardednessFlag" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName)) :+: C1 ('MetaCons "GenericWarning" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Doc))) :+: (C1 ('MetaCons "GenericNonFatalError" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Doc)) :+: C1 ('MetaCons "GenericUseless" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Range) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Doc))))))) :+: ((((C1 ('MetaCons "SafeFlagPostulate" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name)) :+: (C1 ('MetaCons "SafeFlagPragma" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [String])) :+: C1 ('MetaCons "SafeFlagNonTerminating" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "SafeFlagTerminating" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "SafeFlagWithoutKFlagPrimEraseEquality" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "WithoutKFlagPrimEraseEquality" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "SafeFlagNoPositivityCheck" 'PrefixI 'False) (U1 :: Type -> Type)))) :+: ((C1 ('MetaCons "SafeFlagPolarity" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "SafeFlagNoUniverseCheck" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "SafeFlagNoCoverageCheck" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "SafeFlagInjective" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "SafeFlagEta" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "ParseWarning" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ParseWarning)) :+: C1 ('MetaCons "LibraryWarning" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 LibWarning)))))) :+: (((C1 ('MetaCons "DeprecationWarning" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String))) :+: (C1 ('MetaCons "UserWarning" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Text)) :+: C1 ('MetaCons "DuplicateUsing" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (List1 ImportedName))))) :+: ((C1 ('MetaCons "FixityInRenamingModule" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (List1 Range))) :+: C1 ('MetaCons "ModuleDoesntExport" '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]) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [ImportedName])))) :+: (C1 ('MetaCons "InfectiveImport" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ModuleName)) :+: C1 ('MetaCons "CoInfectiveImport" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ModuleName))))) :+: (((C1 ('MetaCons "RewriteNonConfluent" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term)) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Doc))) :+: C1 ('MetaCons "RewriteMaybeNonConfluent" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Doc])))) :+: (C1 ('MetaCons "RewriteAmbiguousRules" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term))) :+: C1 ('MetaCons "RewriteMissingRule" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term))))) :+: ((C1 ('MetaCons "PragmaCompileErased" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 BackendName) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName)) :+: C1 ('MetaCons "NotInScopeW" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [QName]))) :+: (C1 ('MetaCons "AsPatternShadowsConstructorOrPatternSynonym" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool)) :+: C1 ('MetaCons "RecordFieldWarning" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 RecordFieldWarning))))))))

builtinNat :: String

builtinSuc :: String

builtinZero :: String

builtinNatPlus :: String

builtinNatMinus :: String

builtinNatTimes :: String

builtinNatDivSucAux :: String

builtinNatModSucAux :: String

builtinNatEquals :: String

builtinNatLess :: String

builtinWord64 :: String

builtinInteger :: String

builtinIntegerPos :: String

builtinIntegerNegSuc :: String

builtinFloat :: String

builtinChar :: String

builtinString :: String

builtinUnit :: String

builtinUnitUnit :: String

builtinSigma :: String

builtinBool :: String

builtinTrue :: String

builtinFalse :: String

builtinList :: String

builtinNil :: String

builtinCons :: String

builtinMaybe :: String

builtinNothing :: String

builtinJust :: String

builtinIO :: String

builtinId :: String

builtinConId :: String

builtinIdElim :: String

builtinPath :: String

builtinPathP :: String

builtinInterval :: String

builtinIMin :: String

builtinIMax :: String

builtinINeg :: String

builtinIZero :: String

builtinIOne :: String

builtinPartial :: String

builtinPartialP :: String

builtinIsOne :: String

builtinItIsOne :: String

builtinEquiv :: String

builtinEquivFun :: String

builtinEquivProof :: String

builtinTranspProof :: String

builtinGlue :: String

builtin_glue :: String

builtin_unglue :: String

builtin_glueU :: String

builtin_unglueU :: String

builtinFaceForall :: String

builtinIsOne1 :: String

builtinIsOne2 :: String

builtinIsOneEmpty :: String

builtinComp :: String

builtinPOr :: String

builtinTrans :: String

builtinHComp :: String

builtinSub :: String

builtinSubIn :: String

builtinSubOut :: String

builtinSizeUniv :: String

builtinSize :: String

builtinSizeLt :: String

builtinSizeSuc :: String

builtinSizeInf :: String

builtinSizeMax :: String

builtinInf :: String

builtinSharp :: String

builtinFlat :: String

builtinEquality :: String

builtinRefl :: String

builtinRewrite :: String

builtinLevelMax :: String

builtinLevel :: String

builtinLevelZero :: String

builtinLevelSuc :: String

builtinSet :: String

builtinProp :: String

builtinSetOmega :: String

builtinLockUniv :: String

builtinSSetOmega :: String

builtinStrictSet :: String

builtinFromNat :: String

builtinFromNeg :: String

builtinFromString :: String

builtinQName :: String

builtinAgdaSort :: String

builtinAgdaSortSet :: String

builtinAgdaSortLit :: String

builtinAgdaSortProp :: String

builtinAgdaSortPropLit :: String

builtinAgdaSortInf :: String

builtinAgdaSortUnsupported :: String

builtinHiding :: String

builtinHidden :: String

builtinInstance :: String

builtinVisible :: String

builtinRelevance :: String

builtinRelevant :: String

builtinIrrelevant :: String

builtinQuantity :: String

builtinQuantity0 :: String

builtinQuantityω :: String

builtinModality :: String

builtinModalityConstructor :: String

builtinAssoc :: String

builtinAssocLeft :: String

builtinAssocRight :: String

builtinAssocNon :: String

builtinPrecedence :: String

builtinPrecRelated :: String

builtinPrecUnrelated :: String

builtinFixity :: String

builtinFixityFixity :: String

builtinArg :: String

builtinArgInfo :: String

builtinArgArgInfo :: String

builtinArgArg :: String

builtinAbs :: String

builtinAbsAbs :: String

builtinAgdaTerm :: String

builtinAgdaTermVar :: String

builtinAgdaTermLam :: String

builtinAgdaTermExtLam :: String

builtinAgdaTermDef :: String

builtinAgdaTermCon :: String

builtinAgdaTermPi :: String

builtinAgdaTermSort :: String

builtinAgdaTermLit :: String

builtinAgdaTermUnsupported :: String

builtinAgdaTermMeta :: String

builtinAgdaErrorPart :: String

builtinAgdaErrorPartString :: String

builtinAgdaErrorPartTerm :: String

builtinAgdaErrorPartName :: String

builtinAgdaLiteral :: String

builtinAgdaLitNat :: String

builtinAgdaLitWord64 :: String

builtinAgdaLitFloat :: String

builtinAgdaLitChar :: String

builtinAgdaLitString :: String

builtinAgdaLitQName :: String

builtinAgdaLitMeta :: String

builtinAgdaClause :: String

builtinAgdaClauseClause :: String

builtinAgdaClauseAbsurd :: String

builtinAgdaPattern :: String

builtinAgdaPatVar :: String

builtinAgdaPatCon :: String

builtinAgdaPatDot :: String

builtinAgdaPatLit :: String

builtinAgdaPatProj :: String

builtinAgdaPatAbsurd :: String

builtinAgdaDefinitionFunDef :: String

builtinAgdaDefinitionDataDef :: String

builtinAgdaDefinitionRecordDef :: String

builtinAgdaDefinitionDataConstructor :: String

builtinAgdaDefinitionPostulate :: String

builtinAgdaDefinitionPrimitive :: String

builtinAgdaDefinition :: String

builtinAgdaMeta :: String

builtinAgdaTCM :: String

builtinAgdaTCMReturn :: String

builtinAgdaTCMBind :: String

builtinAgdaTCMUnify :: String

builtinAgdaTCMTypeError :: String

builtinAgdaTCMInferType :: String

builtinAgdaTCMCheckType :: String

builtinAgdaTCMNormalise :: String

builtinAgdaTCMReduce :: String

builtinAgdaTCMCatchError :: String

builtinAgdaTCMGetContext :: String

builtinAgdaTCMExtendContext :: String

builtinAgdaTCMInContext :: String

builtinAgdaTCMFreshName :: String

builtinAgdaTCMDeclareDef :: String

builtinAgdaTCMDeclarePostulate :: String

builtinAgdaTCMDefineFun :: String

builtinAgdaTCMGetType :: String

builtinAgdaTCMGetDefinition :: String

builtinAgdaTCMBlockOnMeta :: String

builtinAgdaTCMCommit :: String

builtinAgdaTCMQuoteTerm :: String

builtinAgdaTCMUnquoteTerm :: String

builtinAgdaTCMQuoteOmegaTerm :: String

builtinAgdaTCMIsMacro :: String

builtinAgdaTCMWithNormalisation :: String

builtinAgdaTCMWithReconsParams :: String

builtinAgdaTCMDebugPrint :: String

builtinAgdaTCMOnlyReduceDefs :: String

builtinAgdaTCMDontReduceDefs :: String

builtinAgdaTCMNoConstraints :: String

builtinAgdaTCMRunSpeculative :: String

builtinAgdaTCMExec :: String

isBuiltinNoDef :: String -> Bool

Builtins that come without a definition in Agda syntax. These are giving names to Agda internal concepts which cannot be assigned an Agda type.

An example would be a user-defined name for Set.

{-# BUILTIN TYPE Type #-}

The type of Type would be Type : Level → Setω which is not valid Agda.

builtinsNoDef :: [String]

sizeBuiltins :: [String]

type Verbosity = Trie VerboseKey VerboseLevel

type VerboseLevel = Int

type VerboseKey = String

class (Functor m, Applicative m, Monad m) => HasOptions m where

Minimal complete definition

Nothing

Methods

pragmaOptions :: m PragmaOptions

Returns the pragma options which are currently in effect.

default pragmaOptions :: (HasOptions n, MonadTrans t, m ~ t n) => m PragmaOptions

commandLineOptions :: m CommandLineOptions

Returns the command line options which are currently in effect.

default commandLineOptions :: (HasOptions n, MonadTrans t, m ~ t n) => m CommandLineOptions

Instances

HasOptions IM

Defined in Agda.Interaction.Monad

Methods

pragmaOptions :: IM PragmaOptions

commandLineOptions :: IM CommandLineOptions

HasOptions AbsToCon

Defined in Agda.Syntax.Translation.AbstractToConcrete

Methods

pragmaOptions :: AbsToCon PragmaOptions

commandLineOptions :: AbsToCon CommandLineOptions

HasOptions TerM

Defined in Agda.Termination.Monad

Methods

pragmaOptions :: TerM PragmaOptions

commandLineOptions :: TerM CommandLineOptions

HasOptions ReduceM

Defined in Agda.TypeChecking.Monad.Base

Methods

pragmaOptions :: ReduceM PragmaOptions

commandLineOptions :: ReduceM CommandLineOptions

HasOptions NLM

Defined in Agda.TypeChecking.Rewriting.NonLinMatch

Methods

pragmaOptions :: NLM PragmaOptions

commandLineOptions :: NLM CommandLineOptions

HasOptions m => HasOptions (PureConversionT m)

Defined in Agda.TypeChecking.Conversion.Pure

Methods

pragmaOptions :: PureConversionT m PragmaOptions

commandLineOptions :: PureConversionT m CommandLineOptions

HasOptions m => HasOptions (BlockT m)

Defined in Agda.TypeChecking.Monad.Base

Methods

pragmaOptions :: BlockT m PragmaOptions

commandLineOptions :: BlockT m CommandLineOptions

MonadIO m => HasOptions (TCMT m)

Defined in Agda.TypeChecking.Monad.Base

Methods

pragmaOptions :: TCMT m PragmaOptions

commandLineOptions :: TCMT m CommandLineOptions

HasOptions m => HasOptions (NamesT m)

Defined in Agda.TypeChecking.Names

Methods

pragmaOptions :: NamesT m PragmaOptions

commandLineOptions :: NamesT m CommandLineOptions

HasOptions m => HasOptions (ListT m)

Defined in Agda.Interaction.Options.HasOptions

Methods

pragmaOptions :: ListT m PragmaOptions

commandLineOptions :: ListT m CommandLineOptions

HasOptions m => HasOptions (ChangeT m)

Defined in Agda.Interaction.Options.HasOptions

Methods

pragmaOptions :: ChangeT m PragmaOptions

commandLineOptions :: ChangeT m CommandLineOptions

HasOptions m => HasOptions (MaybeT m)

Defined in Agda.Interaction.Options.HasOptions

Methods

pragmaOptions :: MaybeT m PragmaOptions

commandLineOptions :: MaybeT m CommandLineOptions

HasOptions m => HasOptions (ExceptT e m)

Defined in Agda.Interaction.Options.HasOptions

Methods

pragmaOptions :: ExceptT e m PragmaOptions

commandLineOptions :: ExceptT e m CommandLineOptions

HasOptions m => HasOptions (IdentityT m)

Defined in Agda.Interaction.Options.HasOptions

Methods

pragmaOptions :: IdentityT m PragmaOptions

commandLineOptions :: IdentityT m CommandLineOptions

HasOptions m => HasOptions (ReaderT r m)

Defined in Agda.Interaction.Options.HasOptions

Methods

pragmaOptions :: ReaderT r m PragmaOptions

commandLineOptions :: ReaderT r m CommandLineOptions

HasOptions m => HasOptions (StateT s m)

Defined in Agda.Interaction.Options.HasOptions

Methods

pragmaOptions :: StateT s m PragmaOptions

commandLineOptions :: StateT s m CommandLineOptions

(HasOptions m, Monoid w) => HasOptions (WriterT w m)

Defined in Agda.Interaction.Options.HasOptions

Methods

pragmaOptions :: WriterT w m PragmaOptions

commandLineOptions :: WriterT w m CommandLineOptions

type MonadTCError m = (MonadTCEnv m, ReadTCState m, MonadError TCErr m)

The constraints needed for typeError and similar.

class (Applicative tcm, MonadIO tcm, MonadTCEnv tcm, MonadTCState tcm, HasOptions tcm) => MonadTCM tcm where

Embedding a TCM computation.

Minimal complete definition

Nothing

Methods

liftTCM :: TCM a -> tcm a

default liftTCM :: (MonadTCM m, MonadTrans t, tcm ~ t m) => TCM a -> tcm a

Instances

MonadTCM IM

Defined in Agda.Interaction.Monad

Methods

liftTCM :: TCM a -> IM a

MonadTCM TerM

Defined in Agda.Termination.Monad

Methods

liftTCM :: TCM a -> TerM a

MonadTCM m => MonadTCM (BlockT m)

Defined in Agda.TypeChecking.Monad.Base

Methods

liftTCM :: TCM a -> BlockT m a

MonadIO m => MonadTCM (TCMT m)

Defined in Agda.TypeChecking.Monad.Base

Methods

liftTCM :: TCM a -> TCMT m a

MonadTCM m => MonadTCM (NamesT m)

Defined in Agda.TypeChecking.Names

Methods

liftTCM :: TCM a -> NamesT m a

MonadTCM tcm => MonadTCM (ListT tcm)

Defined in Agda.TypeChecking.Monad.Base

Methods

liftTCM :: TCM a -> ListT tcm a

MonadTCM tcm => MonadTCM (ChangeT tcm)

Defined in Agda.TypeChecking.Monad.Base

Methods

liftTCM :: TCM a -> ChangeT tcm a

MonadTCM tcm => MonadTCM (MaybeT tcm)

Defined in Agda.TypeChecking.Monad.Base

Methods

liftTCM :: TCM a -> MaybeT tcm a

MonadTCM tcm => MonadTCM (ExceptT err tcm)

Defined in Agda.TypeChecking.Monad.Base

Methods

liftTCM :: TCM a -> ExceptT err tcm a

MonadTCM tcm => MonadTCM (IdentityT tcm)

Defined in Agda.TypeChecking.Monad.Base

Methods

liftTCM :: TCM a -> IdentityT tcm a

MonadTCM tcm => MonadTCM (ReaderT r tcm)

Defined in Agda.TypeChecking.Monad.Base

Methods

liftTCM :: TCM a -> ReaderT r tcm a

MonadTCM tcm => MonadTCM (StateT s tcm)

Defined in Agda.TypeChecking.Monad.Base

Methods

liftTCM :: TCM a -> StateT s tcm a

(Monoid w, MonadTCM tcm) => MonadTCM (WriterT w tcm)

Defined in Agda.TypeChecking.Monad.Base

Methods

liftTCM :: TCM a -> WriterT w tcm a

newtype BlockT m a

Constructors

BlockT

Fields

• unBlockT :: ExceptT Blocker m a

Instances

MonadTrans BlockT

Defined in Agda.TypeChecking.Monad.Base

Methods

lift :: Monad m => m a -> BlockT m a

HasOptions m => HasOptions (BlockT m)

Defined in Agda.TypeChecking.Monad.Base

Methods

pragmaOptions :: BlockT m PragmaOptions

commandLineOptions :: BlockT m CommandLineOptions

Monad m => MonadBlock (BlockT m)

Defined in Agda.TypeChecking.Monad.Base

Methods

patternViolation :: Blocker -> BlockT m a

catchPatternErr :: (Blocker -> BlockT m a) -> BlockT m a -> BlockT m a

MonadReduce m => MonadReduce (BlockT m)

Defined in Agda.TypeChecking.Monad.Base

Methods

liftReduce :: ReduceM a -> BlockT m a

MonadTCEnv m => MonadTCEnv (BlockT m)

Defined in Agda.TypeChecking.Monad.Base

Methods

askTC :: BlockT m TCEnv

localTC :: (TCEnv -> TCEnv) -> BlockT m a -> BlockT m a

MonadTCM m => MonadTCM (BlockT m)

Defined in Agda.TypeChecking.Monad.Base

Methods

liftTCM :: TCM a -> BlockT m a

MonadTCState m => MonadTCState (BlockT m)

Defined in Agda.TypeChecking.Monad.Base

Methods

getTC :: BlockT m TCState

putTC :: TCState -> BlockT m ()

modifyTC :: (TCState -> TCState) -> BlockT m ()

ReadTCState m => ReadTCState (BlockT m)

Defined in Agda.TypeChecking.Monad.Base

Methods

getTCState :: BlockT m TCState

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

withTCState :: (TCState -> TCState) -> BlockT m a -> BlockT m a

HasBuiltins m => HasBuiltins (BlockT m)

Defined in Agda.TypeChecking.Monad.Builtin

Methods

getBuiltinThing :: String -> BlockT m (Maybe (Builtin PrimFun))

MonadAddContext m => MonadAddContext (BlockT m)

Defined in Agda.TypeChecking.Monad.Context

Methods

addCtx :: Name -> Dom Type -> BlockT m a -> BlockT m a

addLetBinding' :: Name -> Term -> Dom Type -> BlockT m a -> BlockT m a

updateContext :: Substitution -> (Context -> Context) -> BlockT m a -> BlockT m a

withFreshName :: Range -> ArgName -> (Name -> BlockT m a) -> BlockT m a

MonadDebug m => MonadDebug (BlockT m)

Defined in Agda.TypeChecking.Monad.Debug

Methods

formatDebugMessage :: VerboseKey -> VerboseLevel -> TCM Doc -> BlockT m String

traceDebugMessage :: VerboseKey -> VerboseLevel -> String -> BlockT m a -> BlockT m a

verboseBracket :: VerboseKey -> VerboseLevel -> String -> BlockT m a -> BlockT m a

getVerbosity :: BlockT m Verbosity

isDebugPrinting :: BlockT m Bool

nowDebugPrinting :: BlockT m a -> BlockT m a

PureTCM m => PureTCM (BlockT m)

Defined in Agda.TypeChecking.Monad.Pure

HasConstInfo m => HasConstInfo (BlockT m)

Defined in Agda.TypeChecking.Monad.Signature

Methods

getConstInfo :: QName -> BlockT m Definition

getConstInfo' :: QName -> BlockT m (Either SigError Definition)

getRewriteRulesFor :: QName -> BlockT m RewriteRules

MonadFail m => MonadFail (BlockT m)

Defined in Agda.TypeChecking.Monad.Base

Methods

fail :: String -> BlockT m a

MonadIO m => MonadIO (BlockT m)

Defined in Agda.TypeChecking.Monad.Base

Methods

liftIO :: IO a -> BlockT m a

Monad m => Applicative (BlockT m)

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)

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)

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

class Monad m => MonadBlock m where

Minimal complete definition

catchPatternErr

Methods

patternViolation :: Blocker -> m a

`patternViolation b` aborts the current computation

default patternViolation :: (MonadTrans t, MonadBlock n, m ~ t n) => Blocker -> m a

catchPatternErr :: (Blocker -> m a) -> m a -> m a

`catchPatternErr handle m` runs m, handling pattern violations with handle (doesn't roll back the state)

Instances

MonadBlock TCM

Defined in Agda.TypeChecking.Monad.Base

Methods

patternViolation :: Blocker -> TCM a

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

MonadBlock NLM

Defined in Agda.TypeChecking.Rewriting.NonLinMatch

Methods

patternViolation :: Blocker -> NLM a

catchPatternErr :: (Blocker -> NLM a) -> NLM a -> NLM a

Monad m => MonadBlock (PureConversionT m)

Defined in Agda.TypeChecking.Conversion.Pure

Methods

patternViolation :: Blocker -> PureConversionT m a

catchPatternErr :: (Blocker -> PureConversionT m a) -> PureConversionT m a -> PureConversionT m a

Monad m => MonadBlock (BlockT m)

Defined in Agda.TypeChecking.Monad.Base

Methods

patternViolation :: Blocker -> BlockT m a

catchPatternErr :: (Blocker -> BlockT m a) -> BlockT m a -> BlockT m a

MonadBlock m => MonadBlock (MaybeT m)

Defined in Agda.TypeChecking.Monad.Base

Methods

patternViolation :: Blocker -> MaybeT m a

catchPatternErr :: (Blocker -> MaybeT m a) -> MaybeT m a -> MaybeT m a

Monad m => MonadBlock (ExceptT TCErr m)

Defined in Agda.TypeChecking.Monad.Base

Methods

patternViolation :: Blocker -> ExceptT TCErr m a

catchPatternErr :: (Blocker -> ExceptT TCErr m a) -> ExceptT TCErr m a -> ExceptT TCErr m a

MonadBlock m => MonadBlock (ReaderT e m)

Defined in Agda.TypeChecking.Monad.Base

Methods

patternViolation :: Blocker -> ReaderT e m a

catchPatternErr :: (Blocker -> ReaderT e m a) -> ReaderT e m a -> ReaderT e m a

class Monad m => MonadTCState m where

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

default getTC :: (MonadTrans t, MonadTCState n, t n ~ m) => m TCState

putTC :: TCState -> m ()

default putTC :: (MonadTrans t, MonadTCState n, t n ~ m) => TCState -> m ()

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

default modifyTC :: (MonadTrans t, MonadTCState n, t n ~ m) => (TCState -> TCState) -> m ()

Instances

MonadTCState IM

Defined in Agda.Interaction.Monad

Methods

getTC :: IM TCState

putTC :: TCState -> IM ()

modifyTC :: (TCState -> TCState) -> IM ()

MonadTCState TerM

Defined in Agda.Termination.Monad

Methods

getTC :: TerM TCState

putTC :: TCState -> TerM ()

modifyTC :: (TCState -> TCState) -> TerM ()

MonadTCState m => MonadTCState (BlockT m)

Defined in Agda.TypeChecking.Monad.Base

Methods

getTC :: BlockT m TCState

putTC :: TCState -> BlockT m ()

modifyTC :: (TCState -> TCState) -> BlockT m ()

MonadIO m => MonadTCState (TCMT m)

Defined in Agda.TypeChecking.Monad.Base

Methods

getTC :: TCMT m TCState

putTC :: TCState -> TCMT m ()

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

MonadTCState m => MonadTCState (NamesT m)

Defined in Agda.TypeChecking.Names

Methods

getTC :: NamesT m TCState

putTC :: TCState -> NamesT m ()

modifyTC :: (TCState -> TCState) -> NamesT m ()

MonadTCState m => MonadTCState (ListT m)

Defined in Agda.TypeChecking.Monad.Base

Methods

getTC :: ListT m TCState

putTC :: TCState -> ListT m ()

modifyTC :: (TCState -> TCState) -> ListT m ()

MonadTCState m => MonadTCState (ChangeT m)

Defined in Agda.TypeChecking.Monad.Base

Methods

getTC :: ChangeT m TCState

putTC :: TCState -> ChangeT m ()

modifyTC :: (TCState -> TCState) -> ChangeT m ()

MonadTCState m => MonadTCState (MaybeT m)

Defined in Agda.TypeChecking.Monad.Base

Methods

getTC :: MaybeT m TCState

putTC :: TCState -> MaybeT m ()

modifyTC :: (TCState -> TCState) -> MaybeT m ()

MonadTCState m => MonadTCState (ExceptT err m)

Defined in Agda.TypeChecking.Monad.Base

Methods

getTC :: ExceptT err m TCState

putTC :: TCState -> ExceptT err m ()

modifyTC :: (TCState -> TCState) -> ExceptT err m ()

MonadTCState m => MonadTCState (IdentityT m)

Defined in Agda.TypeChecking.Monad.Base

Methods

getTC :: IdentityT m TCState

putTC :: TCState -> IdentityT m ()

modifyTC :: (TCState -> TCState) -> IdentityT m ()

MonadTCState m => MonadTCState (ReaderT r m)

Defined in Agda.TypeChecking.Monad.Base

Methods

getTC :: ReaderT r m TCState

putTC :: TCState -> ReaderT r m ()

modifyTC :: (TCState -> TCState) -> ReaderT r m ()

MonadTCState m => MonadTCState (StateT s m)

Defined in Agda.TypeChecking.Monad.Base

Methods

getTC :: StateT s m TCState

putTC :: TCState -> StateT s m ()

modifyTC :: (TCState -> TCState) -> StateT s m ()

(Monoid w, MonadTCState m) => MonadTCState (WriterT w m)

Defined in Agda.TypeChecking.Monad.Base

Methods

getTC :: WriterT w m TCState

putTC :: TCState -> WriterT w m ()

modifyTC :: (TCState -> TCState) -> WriterT w m ()

class Monad m => MonadTCEnv m where

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

default askTC :: (MonadTrans t, MonadTCEnv n, t n ~ m) => m TCEnv

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

default localTC :: (MonadTransControl t, MonadTCEnv n, t n ~ m) => (TCEnv -> TCEnv) -> m a -> m a

Instances

MonadTCEnv IM

Defined in Agda.Interaction.Monad

Methods

askTC :: IM TCEnv

localTC :: (TCEnv -> TCEnv) -> IM a -> IM a

MonadTCEnv AbsToCon

Defined in Agda.Syntax.Translation.AbstractToConcrete

Methods

askTC :: AbsToCon TCEnv

localTC :: (TCEnv -> TCEnv) -> AbsToCon a -> AbsToCon a

MonadTCEnv TerM

Defined in Agda.Termination.Monad

Methods

askTC :: TerM TCEnv

localTC :: (TCEnv -> TCEnv) -> TerM a -> TerM a

MonadTCEnv ReduceM

Defined in Agda.TypeChecking.Monad.Base

Methods

askTC :: ReduceM TCEnv

localTC :: (TCEnv -> TCEnv) -> ReduceM a -> ReduceM a

MonadTCEnv NLM

Defined in Agda.TypeChecking.Rewriting.NonLinMatch

Methods

askTC :: NLM TCEnv

localTC :: (TCEnv -> TCEnv) -> NLM a -> NLM a

MonadTCEnv m => MonadTCEnv (PureConversionT m)

Defined in Agda.TypeChecking.Conversion.Pure

Methods

askTC :: PureConversionT m TCEnv

localTC :: (TCEnv -> TCEnv) -> PureConversionT m a -> PureConversionT m a

MonadTCEnv m => MonadTCEnv (BlockT m)

Defined in Agda.TypeChecking.Monad.Base

Methods

askTC :: BlockT m TCEnv

localTC :: (TCEnv -> TCEnv) -> BlockT m a -> BlockT m a

MonadIO m => MonadTCEnv (TCMT m)

Defined in Agda.TypeChecking.Monad.Base

Methods

askTC :: TCMT m TCEnv

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

MonadTCEnv m => MonadTCEnv (NamesT m)

Defined in Agda.TypeChecking.Names

Methods

askTC :: NamesT m TCEnv

localTC :: (TCEnv -> TCEnv) -> NamesT m a -> NamesT m a

MonadTCEnv m => MonadTCEnv (ListT m)

Defined in Agda.TypeChecking.Monad.Base

Methods

askTC :: ListT m TCEnv

localTC :: (TCEnv -> TCEnv) -> ListT m a -> ListT m a

MonadTCEnv m => MonadTCEnv (ChangeT m)

Defined in Agda.TypeChecking.Monad.Base

Methods

askTC :: ChangeT m TCEnv

localTC :: (TCEnv -> TCEnv) -> ChangeT m a -> ChangeT m a

MonadTCEnv m => MonadTCEnv (MaybeT m)

Defined in Agda.TypeChecking.Monad.Base

Methods

askTC :: MaybeT m TCEnv

localTC :: (TCEnv -> TCEnv) -> MaybeT m a -> MaybeT m a

MonadTCEnv m => MonadTCEnv (ExceptT err m)

Defined in Agda.TypeChecking.Monad.Base

Methods

askTC :: ExceptT err m TCEnv

localTC :: (TCEnv -> TCEnv) -> ExceptT err m a -> ExceptT err m a

MonadTCEnv m => MonadTCEnv (IdentityT m)

Defined in Agda.TypeChecking.Monad.Base

Methods

askTC :: IdentityT m TCEnv

localTC :: (TCEnv -> TCEnv) -> IdentityT m a -> IdentityT m a

MonadTCEnv m => MonadTCEnv (ReaderT r m)

Defined in Agda.TypeChecking.Monad.Base

Methods

askTC :: ReaderT r m TCEnv

localTC :: (TCEnv -> TCEnv) -> ReaderT r m a -> ReaderT r m a

MonadTCEnv m => MonadTCEnv (StateT s m)

Defined in Agda.TypeChecking.Monad.Base

Methods

askTC :: StateT s m TCEnv

localTC :: (TCEnv -> TCEnv) -> StateT s m a -> StateT s m a

(Monoid w, MonadTCEnv m) => MonadTCEnv (WriterT w m)

Defined in Agda.TypeChecking.Monad.Base

Methods

askTC :: WriterT w m TCEnv

localTC :: (TCEnv -> TCEnv) -> WriterT w m a -> WriterT w m a

class (Applicative m, MonadTCEnv m, ReadTCState m, HasOptions m) => MonadReduce m where

Minimal complete definition

Nothing

Methods

liftReduce :: ReduceM a -> m a

default liftReduce :: (MonadTrans t, MonadReduce n, t n ~ m) => ReduceM a -> m a

Instances

MonadReduce TerM

Defined in Agda.Termination.Monad

Methods

liftReduce :: ReduceM a -> TerM a

MonadReduce ReduceM

Defined in Agda.TypeChecking.Monad.Base

Methods

liftReduce :: ReduceM a -> ReduceM a

MonadReduce NLM

Defined in Agda.TypeChecking.Rewriting.NonLinMatch

Methods

liftReduce :: ReduceM a -> NLM a

MonadReduce m => MonadReduce (PureConversionT m)

Defined in Agda.TypeChecking.Conversion.Pure

Methods

liftReduce :: ReduceM a -> PureConversionT m a

MonadReduce m => MonadReduce (BlockT m)

Defined in Agda.TypeChecking.Monad.Base

Methods

liftReduce :: ReduceM a -> BlockT m a

MonadIO m => MonadReduce (TCMT m)

Defined in Agda.TypeChecking.Monad.Base

Methods

liftReduce :: ReduceM a -> TCMT m a

MonadReduce m => MonadReduce (NamesT m)

Defined in Agda.TypeChecking.Names

Methods

liftReduce :: ReduceM a -> NamesT m a

MonadReduce m => MonadReduce (ListT m)

Defined in Agda.TypeChecking.Monad.Base

Methods

liftReduce :: ReduceM a -> ListT m a

MonadReduce m => MonadReduce (ChangeT m)

Defined in Agda.TypeChecking.Monad.Base

Methods

liftReduce :: ReduceM a -> ChangeT m a

MonadReduce m => MonadReduce (MaybeT m)

Defined in Agda.TypeChecking.Monad.Base

Methods

liftReduce :: ReduceM a -> MaybeT m a

MonadReduce m => MonadReduce (ExceptT err m)

Defined in Agda.TypeChecking.Monad.Base

Methods

liftReduce :: ReduceM a -> ExceptT err m a

MonadReduce m => MonadReduce (IdentityT m)

Defined in Agda.TypeChecking.Monad.Base

Methods

liftReduce :: ReduceM a -> IdentityT m a

MonadReduce m => MonadReduce (ReaderT r m)

Defined in Agda.TypeChecking.Monad.Base

Methods

liftReduce :: ReduceM a -> ReaderT r m a

MonadReduce m => MonadReduce (StateT w m)

Defined in Agda.TypeChecking.Monad.Base

Methods

liftReduce :: ReduceM a -> StateT w m a

(Monoid w, MonadReduce m) => MonadReduce (WriterT w m)

Defined in Agda.TypeChecking.Monad.Base

Methods

liftReduce :: ReduceM a -> WriterT w m a

newtype ReduceM a

Constructors

ReduceM

Fields

• unReduceM :: ReduceEnv -> a

Instances

HasOptions ReduceM

Defined in Agda.TypeChecking.Monad.Base

Methods

pragmaOptions :: ReduceM PragmaOptions

commandLineOptions :: ReduceM CommandLineOptions

MonadReduce ReduceM

Defined in Agda.TypeChecking.Monad.Base

Methods

liftReduce :: ReduceM a -> ReduceM a

MonadTCEnv ReduceM

Defined in Agda.TypeChecking.Monad.Base

Methods

askTC :: ReduceM TCEnv

localTC :: (TCEnv -> TCEnv) -> ReduceM a -> ReduceM a

ReadTCState ReduceM

Defined in Agda.TypeChecking.Monad.Base

Methods

getTCState :: ReduceM TCState

locallyTCState :: Lens' a TCState -> (a -> a) -> ReduceM b -> ReduceM b

withTCState :: (TCState -> TCState) -> ReduceM a -> ReduceM a

HasBuiltins ReduceM

Defined in Agda.TypeChecking.Reduce.Monad

Methods

getBuiltinThing :: String -> ReduceM (Maybe (Builtin PrimFun))

MonadAddContext ReduceM

Defined in Agda.TypeChecking.Reduce.Monad

Methods

addCtx :: Name -> Dom Type -> ReduceM a -> ReduceM a

addLetBinding' :: Name -> Term -> Dom Type -> ReduceM a -> ReduceM a

updateContext :: Substitution -> (Context -> Context) -> ReduceM a -> ReduceM a

withFreshName :: Range -> ArgName -> (Name -> ReduceM a) -> ReduceM a

MonadDebug ReduceM

Defined in Agda.TypeChecking.Reduce.Monad

Methods

formatDebugMessage :: VerboseKey -> VerboseLevel -> TCM Doc -> ReduceM String

traceDebugMessage :: VerboseKey -> VerboseLevel -> String -> ReduceM a -> ReduceM a

verboseBracket :: VerboseKey -> VerboseLevel -> String -> ReduceM a -> ReduceM a

getVerbosity :: ReduceM Verbosity

isDebugPrinting :: ReduceM Bool

nowDebugPrinting :: ReduceM a -> ReduceM a

PureTCM ReduceM

Defined in Agda.TypeChecking.Reduce.Monad

HasConstInfo ReduceM

Defined in Agda.TypeChecking.Reduce.Monad

Methods

getConstInfo :: QName -> ReduceM Definition

getConstInfo' :: QName -> ReduceM (Either SigError Definition)

getRewriteRulesFor :: QName -> ReduceM RewriteRules

MonadFail ReduceM

Defined in Agda.TypeChecking.Monad.Base

Methods

fail :: String -> ReduceM a

Applicative ReduceM

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

Defined in Agda.TypeChecking.Monad.Base

Methods

fmap :: (a -> b) -> ReduceM a -> ReduceM b

(<$) :: a -> ReduceM b -> ReduceM a

Monad ReduceM

Defined in Agda.TypeChecking.Monad.Base

Methods

(>>=) :: ReduceM a -> (a -> ReduceM b) -> ReduceM b

(>>) :: ReduceM a -> ReduceM b -> ReduceM b

return :: a -> ReduceM a

data ReduceEnv

Environment of the reduce monad.

Constructors

ReduceEnv

Fields

• redEnv :: TCEnv

  Read only access to environment.

• redSt :: TCState

  Read only access to state (signature, metas...).

data LHSOrPatSyn

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

Constructors

IsLHS

IsPatSyn

Instances

Generic LHSOrPatSyn

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep LHSOrPatSyn :: Type -> Type

Methods

from :: LHSOrPatSyn -> Rep LHSOrPatSyn x

to :: Rep LHSOrPatSyn x -> LHSOrPatSyn

Show LHSOrPatSyn

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> LHSOrPatSyn -> ShowS

show :: LHSOrPatSyn -> String

showList :: [LHSOrPatSyn] -> ShowS

NFData LHSOrPatSyn

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: LHSOrPatSyn -> ()

Eq LHSOrPatSyn

Defined in Agda.TypeChecking.Monad.Base

Methods

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

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

type Rep LHSOrPatSyn

Defined in Agda.TypeChecking.Monad.Base

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

data TypeError

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.

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

IllformedProjectionPattern Pattern

CannotEliminateWithPattern (Maybe Blocker) (NamedArg Pattern) Type

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

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.

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 String Expr

NoSuchBuiltinName String

DuplicateBuiltinBinding String Term Term

NoBindingForBuiltin String

NoSuchPrimitiveFunction String

DuplicatePrimitiveBinding String QName QName

WrongModalityForPrimitive String ArgInfo ArgInfo

ShadowedModule Name [ModuleName]

BuiltinInParameterisedModule String

IllegalLetInTelescope TypedBinding

IllegalPatternInTelescope Binder

NoRHSRequiresAbsurdPattern [NamedArg Pattern]

TooManyFields QName [Name] [Name]

Record type, fields not supplied by user, non-fields but supplied.

DuplicateFields [Name]

DuplicateConstructors [Name]

WithOnFreeVariable Expr Term

UnexpectedWithPatterns [Pattern]

WithClausePatternMismatch Pattern (NamedArg DeBruijnPattern)

FieldOutsideRecord

ModuleArityMismatch ModuleName Telescope [NamedArg Expr]

GeneralizeCyclicDependency

GeneralizeUnsolvedMeta

SplitError SplitError

ImpossibleConstructor QName NegativeUnification

TooManyPolarities QName Int

LocalVsImportedModuleClash ModuleName

SolvedButOpenHoles

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 (List1 QName)

AmbiguousModule QName (List1 ModuleName)

ClashingDefinition QName QName (Maybe NiceDeclaration)

ClashingModule ModuleName ModuleName

ClashingImport Name QName

ClashingModuleImport Name ModuleName

PatternShadowsConstructor Name QName

DuplicateImports QName [ImportedName]

InvalidPattern Pattern

RepeatedVariablesInPattern [Name]

GeneralizeNotSupportedHere QName

MultipleFixityDecls [(Name, [Fixity'])]

MultiplePolarityPragmas [Name]

NotAModuleExpr Expr

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

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.

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

PrettyTCM TypeError

Defined in Agda.TypeChecking.Errors

Methods

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

Generic TypeError

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep TypeError :: Type -> Type

Methods

from :: TypeError -> Rep TypeError x

to :: Rep TypeError x -> TypeError

Show TypeError

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> TypeError -> ShowS

show :: TypeError -> String

showList :: [TypeError] -> ShowS

NFData TypeError

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: TypeError -> ()

type Rep TypeError

Defined in Agda.TypeChecking.Monad.Base

type Rep TypeError = D1 ('MetaData "TypeError" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-inplace" 'False) (((((((C1 ('MetaCons "InternalError" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String)) :+: C1 ('MetaCons "NotImplemented" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String))) :+: (C1 ('MetaCons "NotSupported" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String)) :+: C1 ('MetaCons "CompilationError" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String)))) :+: ((C1 ('MetaCons "PropMustBeSingleton" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "DataMustEndInSort" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term))) :+: (C1 ('MetaCons "ShouldEndInApplicationOfTheDatatype" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type)) :+: C1 ('MetaCons "ShouldBeAppliedToTheDatatypeParameters" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term))))) :+: (((C1 ('MetaCons "ShouldBeApplicationOf" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName)) :+: C1 ('MetaCons "ConstructorPatternInWrongDatatype" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName))) :+: (C1 ('MetaCons "CantResolveOverloadedConstructorsTargetingSameDatatype" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (List1 QName))) :+: C1 ('MetaCons "DoesNotConstructAnElementOf" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type)))) :+: ((C1 ('MetaCons "WrongHidingInLHS" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "WrongHidingInLambda" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type))) :+: (C1 ('MetaCons "WrongHidingInApplication" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type)) :+: (C1 ('MetaCons "WrongNamedArgument" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (NamedArg Expr)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [NamedName])) :+: C1 ('MetaCons "WrongIrrelevanceInLambda" 'PrefixI 'False) (U1 :: Type -> Type)))))) :+: ((((C1 ('MetaCons "WrongQuantityInLambda" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "WrongCohesionInLambda" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "QuantityMismatch" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Quantity) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Quantity)) :+: C1 ('MetaCons "HidingMismatch" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Hiding) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Hiding)))) :+: ((C1 ('MetaCons "RelevanceMismatch" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Relevance) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Relevance)) :+: C1 ('MetaCons "UninstantiatedDotPattern" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Expr))) :+: (C1 ('MetaCons "ForcedConstructorNotInstantiated" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Pattern)) :+: (C1 ('MetaCons "IllformedProjectionPattern" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Pattern)) :+: C1 ('MetaCons "CannotEliminateWithPattern" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe Blocker)) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (NamedArg Pattern)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type))))))) :+: (((C1 ('MetaCons "WrongNumberOfConstructorArguments" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Nat) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Nat))) :+: C1 ('MetaCons "ShouldBeEmpty" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [DeBruijnPattern]))) :+: (C1 ('MetaCons "ShouldBeASort" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type)) :+: C1 ('MetaCons "ShouldBePi" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type)))) :+: ((C1 ('MetaCons "ShouldBePath" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type)) :+: C1 ('MetaCons "ShouldBeRecordType" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type))) :+: (C1 ('MetaCons "ShouldBeRecordPattern" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 DeBruijnPattern)) :+: (C1 ('MetaCons "NotAProjectionPattern" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (NamedArg Pattern))) :+: C1 ('MetaCons "NotAProperTerm" 'PrefixI 'False) (U1 :: Type -> Type))))))) :+: (((((C1 ('MetaCons "InvalidTypeSort" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Sort)) :+: C1 ('MetaCons "InvalidType" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term))) :+: (C1 ('MetaCons "FunctionTypeInSizeUniv" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term)) :+: C1 ('MetaCons "SplitOnIrrelevant" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Dom Type))))) :+: ((C1 ('MetaCons "SplitOnUnusableCohesion" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Dom Type))) :+: C1 ('MetaCons "SplitOnNonVariable" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type))) :+: (C1 ('MetaCons "SplitOnNonEtaRecord" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName)) :+: C1 ('MetaCons "DefinitionIsIrrelevant" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName))))) :+: (((C1 ('MetaCons "DefinitionIsErased" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName)) :+: C1 ('MetaCons "VariableIsIrrelevant" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name))) :+: (C1 ('MetaCons "VariableIsErased" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name)) :+: C1 ('MetaCons "VariableIsOfUnusableCohesion" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Cohesion)))) :+: ((C1 ('MetaCons "UnequalLevel" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Comparison) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Level) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Level))) :+: C1 ('MetaCons "UnequalTerms" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Comparison) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term)) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 CompareAs)))) :+: (C1 ('MetaCons "UnequalTypes" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Comparison) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type))) :+: (C1 ('MetaCons "UnequalRelevance" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Comparison) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term))) :+: C1 ('MetaCons "UnequalQuantity" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Comparison) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term)))))))) :+: ((((C1 ('MetaCons "UnequalCohesion" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Comparison) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term))) :+: C1 ('MetaCons "UnequalHiding" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term))) :+: (C1 ('MetaCons "UnequalSorts" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Sort) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Sort)) :+: C1 ('MetaCons "UnequalBecauseOfUniverseConflict" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Comparison) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term))))) :+: ((C1 ('MetaCons "NotLeqSort" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Sort) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Sort)) :+: C1 ('MetaCons "MetaCannotDependOn" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 MetaId) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Nat))) :+: (C1 ('MetaCons "MetaOccursInItself" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 MetaId)) :+: (C1 ('MetaCons "MetaIrrelevantSolution" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 MetaId) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term)) :+: C1 ('MetaCons "MetaErasedSolution" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 MetaId) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term)))))) :+: (((C1 ('MetaCons "GenericError" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String)) :+: C1 ('MetaCons "GenericDocError" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Doc))) :+: (C1 ('MetaCons "SortOfSplitVarError" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe Blocker)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Doc)) :+: C1 ('MetaCons "BuiltinMustBeConstructor" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Expr)))) :+: ((C1 ('MetaCons "NoSuchBuiltinName" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String)) :+: C1 ('MetaCons "DuplicateBuiltinBinding" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term)))) :+: (C1 ('MetaCons "NoBindingForBuiltin" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String)) :+: (C1 ('MetaCons "NoSuchPrimitiveFunction" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String)) :+: C1 ('MetaCons "DuplicatePrimitiveBinding" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName)))))))))) :+: ((((((C1 ('MetaCons "WrongModalityForPrimitive" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ArgInfo) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ArgInfo))) :+: C1 ('MetaCons "ShadowedModule" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [ModuleName]))) :+: (C1 ('MetaCons "BuiltinInParameterisedModule" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String)) :+: C1 ('MetaCons "IllegalLetInTelescope" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 TypedBinding)))) :+: ((C1 ('MetaCons "IllegalPatternInTelescope" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Binder)) :+: C1 ('MetaCons "NoRHSRequiresAbsurdPattern" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [NamedArg Pattern]))) :+: (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]))) :+: C1 ('MetaCons "DuplicateFields" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Name]))))) :+: (((C1 ('MetaCons "DuplicateConstructors" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Name])) :+: C1 ('MetaCons "WithOnFreeVariable" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Expr) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term))) :+: (C1 ('MetaCons "UnexpectedWithPatterns" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Pattern])) :+: C1 ('MetaCons "WithClausePatternMismatch" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Pattern) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (NamedArg DeBruijnPattern))))) :+: ((C1 ('MetaCons "FieldOutsideRecord" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "ModuleArityMismatch" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ModuleName) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Telescope) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [NamedArg Expr])))) :+: (C1 ('MetaCons "GeneralizeCyclicDependency" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "GeneralizeUnsolvedMeta" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "SplitError" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 SplitError))))))) :+: ((((C1 ('MetaCons "ImpossibleConstructor" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 NegativeUnification)) :+: C1 ('MetaCons "TooManyPolarities" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Int))) :+: (C1 ('MetaCons "LocalVsImportedModuleClash" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ModuleName)) :+: C1 ('MetaCons "SolvedButOpenHoles" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "CyclicModuleDependency" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [TopLevelModuleName])) :+: C1 ('MetaCons "FileNotFound" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 TopLevelModuleName) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [AbsolutePath]))) :+: (C1 ('MetaCons "OverlappingProjects" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 AbsolutePath) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 TopLevelModuleName) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 TopLevelModuleName))) :+: (C1 ('MetaCons "AmbiguousTopLevelModuleName" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 TopLevelModuleName) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [AbsolutePath])) :+: C1 ('MetaCons "ModuleNameUnexpected" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 TopLevelModuleName) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 TopLevelModuleName)))))) :+: (((C1 ('MetaCons "ModuleNameDoesntMatchFileName" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 TopLevelModuleName) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [AbsolutePath])) :+: C1 ('MetaCons "ClashingFileNamesFor" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ModuleName) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [AbsolutePath]))) :+: (C1 ('MetaCons "ModuleDefinedInOtherFile" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 TopLevelModuleName) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 AbsolutePath) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 AbsolutePath))) :+: C1 ('MetaCons "BothWithAndRHS" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "AbstractConstructorNotInScope" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName)) :+: C1 ('MetaCons "NotInScope" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [QName]))) :+: (C1 ('MetaCons "NoSuchModule" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName)) :+: (C1 ('MetaCons "AmbiguousName" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (List1 QName))) :+: C1 ('MetaCons "AmbiguousModule" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (List1 ModuleName))))))))) :+: (((((C1 ('MetaCons "ClashingDefinition" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe NiceDeclaration)))) :+: C1 ('MetaCons "ClashingModule" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ModuleName) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ModuleName))) :+: (C1 ('MetaCons "ClashingImport" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName)) :+: C1 ('MetaCons "ClashingModuleImport" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ModuleName)))) :+: ((C1 ('MetaCons "PatternShadowsConstructor" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName)) :+: C1 ('MetaCons "DuplicateImports" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [ImportedName]))) :+: (C1 ('MetaCons "InvalidPattern" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Pattern)) :+: (C1 ('MetaCons "RepeatedVariablesInPattern" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Name])) :+: C1 ('MetaCons "GeneralizeNotSupportedHere" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName)))))) :+: (((C1 ('MetaCons "MultipleFixityDecls" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [(Name, [Fixity'])])) :+: C1 ('MetaCons "MultiplePolarityPragmas" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Name]))) :+: (C1 ('MetaCons "NotAModuleExpr" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Expr)) :+: C1 ('MetaCons "NotAnExpression" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Expr)))) :+: ((C1 ('MetaCons "NotAValidLetBinding" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 NiceDeclaration)) :+: C1 ('MetaCons "NotValidBeforeField" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 NiceDeclaration))) :+: (C1 ('MetaCons "NothingAppliedToHiddenArg" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Expr)) :+: (C1 ('MetaCons "NothingAppliedToInstanceArg" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Expr)) :+: C1 ('MetaCons "BadArgumentsToPatternSynonym" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 AmbiguousQName))))))) :+: ((((C1 ('MetaCons "TooFewArgumentsToPatternSynonym" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 AmbiguousQName)) :+: C1 ('MetaCons "CannotResolveAmbiguousPatternSynonym" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (List1 (QName, PatternSynDefn))))) :+: (C1 ('MetaCons "UnusedVariableInPatternSynonym" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "NoParseForApplication" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (List2 Expr))))) :+: ((C1 ('MetaCons "AmbiguousParseForApplication" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (List2 Expr)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (List1 Expr))) :+: C1 ('MetaCons "NoParseForLHS" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 LHSOrPatSyn) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Pattern]) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Pattern)))) :+: (C1 ('MetaCons "AmbiguousParseForLHS" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 LHSOrPatSyn) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Pattern) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Pattern]))) :+: (C1 ('MetaCons "OperatorInformation" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [NotationSection]) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 TypeError)) :+: C1 ('MetaCons "InstanceNoCandidate" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [(Term, TCErr)])))))) :+: (((C1 ('MetaCons "UnquoteFailed" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 UnquoteError)) :+: C1 ('MetaCons "DeBruijnIndexOutOfScope" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Nat) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Telescope) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Name])))) :+: (C1 ('MetaCons "NeedOptionCopatterns" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "NeedOptionRewriting" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "NeedOptionProp" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "NeedOptionTwoLevel" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "NonFatalErrors" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [TCWarning])) :+: (C1 ('MetaCons "InstanceSearchDepthExhausted" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Int))) :+: C1 ('MetaCons "TriedToCopyConstrainedPrim" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName))))))))))

data UnquoteError

Constructors

BadVisibility String (Arg Term)

ConInsteadOfDef QName String String

DefInsteadOfCon QName String String

NonCanonical String Term

BlockedOnMeta TCState Blocker

UnquotePanic String

Instances

Generic UnquoteError

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep UnquoteError :: Type -> Type

Methods

from :: UnquoteError -> Rep UnquoteError x

to :: Rep UnquoteError x -> UnquoteError

Show UnquoteError

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> UnquoteError -> ShowS

show :: UnquoteError -> String

showList :: [UnquoteError] -> ShowS

NFData UnquoteError

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: UnquoteError -> ()

type Rep UnquoteError

Defined in Agda.TypeChecking.Monad.Base

type Rep UnquoteError = D1 ('MetaData "UnquoteError" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-inplace" 'False) ((C1 ('MetaCons "BadVisibility" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Arg Term))) :+: (C1 ('MetaCons "ConInsteadOfDef" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String))) :+: C1 ('MetaCons "DefInsteadOfCon" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String))))) :+: (C1 ('MetaCons "NonCanonical" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term)) :+: (C1 ('MetaCons "BlockedOnMeta" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 TCState) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Blocker)) :+: C1 ('MetaCons "UnquotePanic" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String)))))

data UnificationFailure

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

PrettyTCM UnificationFailure

Defined in Agda.TypeChecking.Errors

Methods

prettyTCM :: MonadPretty m => UnificationFailure -> m Doc

Generic UnificationFailure

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep UnificationFailure :: Type -> Type

Methods

from :: UnificationFailure -> Rep UnificationFailure x

to :: Rep UnificationFailure x -> UnificationFailure

Show UnificationFailure

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> UnificationFailure -> ShowS

show :: UnificationFailure -> String

showList :: [UnificationFailure] -> ShowS

NFData UnificationFailure

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: UnificationFailure -> ()

type Rep UnificationFailure

Defined in Agda.TypeChecking.Monad.Base

type Rep UnificationFailure = D1 ('MetaData "UnificationFailure" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-inplace" 'False) ((C1 ('MetaCons "UnifyIndicesNotVars" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Telescope) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type)) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Args)))) :+: C1 ('MetaCons "UnifyRecursiveEq" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Telescope) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type)) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Int) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term)))) :+: (C1 ('MetaCons "UnifyReflexiveEq" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Telescope) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term))) :+: C1 ('MetaCons "UnifyUnusableModality" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Telescope) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type)) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Int) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Modality))))))

data NegativeUnification

Constructors

UnifyConflict Telescope Term Term

UnifyCycle Telescope Int Term

Instances

PrettyTCM NegativeUnification

Defined in Agda.TypeChecking.Errors

Methods

prettyTCM :: MonadPretty m => NegativeUnification -> m Doc

Generic NegativeUnification

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep NegativeUnification :: Type -> Type

Methods

from :: NegativeUnification -> Rep NegativeUnification x

to :: Rep NegativeUnification x -> NegativeUnification

Show NegativeUnification

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> NegativeUnification -> ShowS

show :: NegativeUnification -> String

showList :: [NegativeUnification] -> ShowS

NFData NegativeUnification

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: NegativeUnification -> ()

type Rep NegativeUnification

Defined in Agda.TypeChecking.Monad.Base

type Rep NegativeUnification = D1 ('MetaData "NegativeUnification" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-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 SplitError

Error when splitting a pattern variable into possible constructor patterns.

Constructors

NotADatatype (Closure Type)

Neither data type nor record.

BlockedType Blocker (Closure Type)

Type could not be sufficiently reduced.

ErasedDatatype Bool (Closure Type)

Data type, but in erased position. If the boolean is True, then the reason for the error is that the K rule is turned off.

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

PrettyTCM SplitError

Defined in Agda.TypeChecking.Errors

Methods

prettyTCM :: MonadPretty m => SplitError -> m Doc

Generic SplitError

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep SplitError :: Type -> Type

Methods

from :: SplitError -> Rep SplitError x

to :: Rep SplitError x -> SplitError

Show SplitError

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> SplitError -> ShowS

show :: SplitError -> String

showList :: [SplitError] -> ShowS

NFData SplitError

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: SplitError -> ()

type Rep SplitError

Defined in Agda.TypeChecking.Monad.Base

type Rep SplitError = D1 ('MetaData "SplitError" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-inplace" 'False) (((C1 ('MetaCons "NotADatatype" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Closure Type))) :+: C1 ('MetaCons "BlockedType" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Blocker) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Closure Type)))) :+: (C1 ('MetaCons "ErasedDatatype" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Closure Type))) :+: (C1 ('MetaCons "CoinductiveDatatype" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Closure Type))) :+: C1 ('MetaCons "UnificationStuck" 'PrefixI 'True) ((S1 ('MetaSel ('Just "cantSplitBlocker") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe Blocker)) :*: (S1 ('MetaSel ('Just "cantSplitConName") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName) :*: S1 ('MetaSel ('Just "cantSplitTel") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Telescope))) :*: (S1 ('MetaSel ('Just "cantSplitConIdx") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Args) :*: (S1 ('MetaSel ('Just "cantSplitGivenIdx") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Args) :*: S1 ('MetaSel ('Just "cantSplitFailures") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [UnificationFailure]))))))) :+: ((C1 ('MetaCons "CosplitCatchall" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "CosplitNoTarget" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "CosplitNoRecordType" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Closure Type))) :+: (C1 ('MetaCons "CannotCreateMissingClause" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Telescope, [NamedArg DeBruijnPattern]))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Doc) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Closure (Abs Type))))) :+: C1 ('MetaCons "GenericSplitError" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String))))))

data TerminationError

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

Generic TerminationError

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep TerminationError :: Type -> Type

Methods

from :: TerminationError -> Rep TerminationError x

to :: Rep TerminationError x -> TerminationError

Show TerminationError

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> TerminationError -> ShowS

show :: TerminationError -> String

showList :: [TerminationError] -> ShowS

NFData TerminationError

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: TerminationError -> ()

type Rep TerminationError

Defined in Agda.TypeChecking.Monad.Base

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

data CallInfo

Information about a call.

Constructors

CallInfo

Fields

• callInfoTarget :: QName

  Target function name.

• callInfoRange :: Range

  Range of the target function.

• callInfoCall :: Closure Term

  To be formatted representation of the call.

Instances

PrettyTCM CallInfo

Defined in Agda.TypeChecking.Pretty.Call

Methods

prettyTCM :: MonadPretty m => CallInfo -> m Doc

Pretty CallInfo

We only show the name of the callee.

Defined in Agda.TypeChecking.Monad.Base

Methods

pretty :: CallInfo -> Doc

prettyPrec :: Int -> CallInfo -> Doc

prettyList :: [CallInfo] -> Doc

Generic CallInfo

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep CallInfo :: Type -> Type

Methods

from :: CallInfo -> Rep CallInfo x

to :: Rep CallInfo x -> CallInfo

Show CallInfo

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> CallInfo -> ShowS

show :: CallInfo -> String

showList :: [CallInfo] -> ShowS

NFData CallInfo

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: CallInfo -> ()

type Rep CallInfo

Defined in Agda.TypeChecking.Monad.Base

type Rep CallInfo = D1 ('MetaData "CallInfo" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-inplace" 'False) (C1 ('MetaCons "CallInfo" 'PrefixI 'True) (S1 ('MetaSel ('Just "callInfoTarget") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName) :*: (S1 ('MetaSel ('Just "callInfoRange") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Range) :*: S1 ('MetaSel ('Just "callInfoCall") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Closure Term)))))

data RecordFieldWarning

Constructors

DuplicateFieldsWarning [(Name, Range)]

Each redundant field comes with a range of associated dead code.

TooManyFieldsWarning QName [Name] [(Name, Range)]

Record type, fields not supplied by user, non-fields but supplied. The redundant fields come with a range of associated dead code.

Instances

EmbPrj RecordFieldWarning

Defined in Agda.TypeChecking.Serialise.Instances.Errors

Methods

icode :: RecordFieldWarning -> S Int32

icod_ :: RecordFieldWarning -> S Int32

value :: Int32 -> R RecordFieldWarning

Data RecordFieldWarning

Defined in Agda.TypeChecking.Monad.Base

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> RecordFieldWarning -> c RecordFieldWarning

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c RecordFieldWarning

toConstr :: RecordFieldWarning -> Constr

dataTypeOf :: RecordFieldWarning -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c RecordFieldWarning)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c RecordFieldWarning)

gmapT :: (forall b. Data b => b -> b) -> RecordFieldWarning -> RecordFieldWarning

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> RecordFieldWarning -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> RecordFieldWarning -> r

gmapQ :: (forall d. Data d => d -> u) -> RecordFieldWarning -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> RecordFieldWarning -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> RecordFieldWarning -> m RecordFieldWarning

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> RecordFieldWarning -> m RecordFieldWarning

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> RecordFieldWarning -> m RecordFieldWarning

Generic RecordFieldWarning

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep RecordFieldWarning :: Type -> Type

Methods

from :: RecordFieldWarning -> Rep RecordFieldWarning x

to :: Rep RecordFieldWarning x -> RecordFieldWarning

Show RecordFieldWarning

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> RecordFieldWarning -> ShowS

show :: RecordFieldWarning -> String

showList :: [RecordFieldWarning] -> ShowS

NFData RecordFieldWarning

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: RecordFieldWarning -> ()

type Rep RecordFieldWarning

Defined in Agda.TypeChecking.Monad.Base

type Rep RecordFieldWarning = D1 ('MetaData "RecordFieldWarning" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-inplace" 'False) (C1 ('MetaCons "DuplicateFieldsWarning" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [(Name, Range)])) :+: C1 ('MetaCons "TooManyFieldsWarning" '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)]))))

data ArgsCheckState a

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

Show a => Show (ArgsCheckState a)

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> ArgsCheckState a -> ShowS

show :: ArgsCheckState a -> String

showList :: [ArgsCheckState a] -> ShowS

data Candidate

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

Free Candidate

Defined in Agda.TypeChecking.Monad.Base

Methods

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

PrettyTCM Candidate

Defined in Agda.TypeChecking.Pretty

Methods

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

Instantiate Candidate

Defined in Agda.TypeChecking.Reduce

Methods

instantiate' :: Candidate -> ReduceM Candidate

InstantiateFull Candidate

Defined in Agda.TypeChecking.Reduce

Methods

instantiateFull' :: Candidate -> ReduceM Candidate

Normalise Candidate

Defined in Agda.TypeChecking.Reduce

Methods

normalise' :: Candidate -> ReduceM Candidate

Reduce Candidate

Defined in Agda.TypeChecking.Reduce

Methods

reduce' :: Candidate -> ReduceM Candidate

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

Simplify Candidate

Defined in Agda.TypeChecking.Reduce

Methods

simplify' :: Candidate -> ReduceM Candidate

Subst Candidate

Defined in Agda.TypeChecking.Substitute

Associated Types

type SubstArg Candidate

Methods

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

Data Candidate

Defined in Agda.TypeChecking.Monad.Base

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Candidate -> c Candidate

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Candidate

toConstr :: Candidate -> Constr

dataTypeOf :: Candidate -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Candidate)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Candidate)

gmapT :: (forall b. Data b => b -> b) -> Candidate -> Candidate

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Candidate -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Candidate -> r

gmapQ :: (forall d. Data d => d -> u) -> Candidate -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Candidate -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Candidate -> m Candidate

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Candidate -> m Candidate

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Candidate -> m Candidate

Generic Candidate

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep Candidate :: Type -> Type

Methods

from :: Candidate -> Rep Candidate x

to :: Rep Candidate x -> Candidate

Show Candidate

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> Candidate -> ShowS

show :: Candidate -> String

showList :: [Candidate] -> ShowS

NFData Candidate

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: Candidate -> ()

Eq Candidate

Defined in Agda.TypeChecking.Substitute

Methods

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

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

type SubstArg Candidate

Defined in Agda.TypeChecking.Substitute

type SubstArg Candidate = Term

type Rep Candidate

Defined in Agda.TypeChecking.Monad.Base

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

data CandidateKind

Constructors

LocalCandidate

GlobalCandidate QName

Instances

Data CandidateKind

Defined in Agda.TypeChecking.Monad.Base

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> CandidateKind -> c CandidateKind

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c CandidateKind

toConstr :: CandidateKind -> Constr

dataTypeOf :: CandidateKind -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c CandidateKind)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c CandidateKind)

gmapT :: (forall b. Data b => b -> b) -> CandidateKind -> CandidateKind

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> CandidateKind -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> CandidateKind -> r

gmapQ :: (forall d. Data d => d -> u) -> CandidateKind -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> CandidateKind -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> CandidateKind -> m CandidateKind

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> CandidateKind -> m CandidateKind

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> CandidateKind -> m CandidateKind

Generic CandidateKind

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep CandidateKind :: Type -> Type

Methods

from :: CandidateKind -> Rep CandidateKind x

to :: Rep CandidateKind x -> CandidateKind

Show CandidateKind

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> CandidateKind -> ShowS

show :: CandidateKind -> String

showList :: [CandidateKind] -> ShowS

NFData CandidateKind

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: CandidateKind -> ()

Eq CandidateKind

Defined in Agda.TypeChecking.Substitute

Methods

(==) :: CandidateKind -> CandidateKind -> Bool

(/=) :: CandidateKind -> CandidateKind -> Bool

type Rep CandidateKind

Defined in Agda.TypeChecking.Monad.Base

type Rep CandidateKind = D1 ('MetaData "CandidateKind" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-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 ExpandHidden

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

Data ExpandHidden

Defined in Agda.TypeChecking.Monad.Base

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ExpandHidden -> c ExpandHidden

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c ExpandHidden

toConstr :: ExpandHidden -> Constr

dataTypeOf :: ExpandHidden -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c ExpandHidden)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c ExpandHidden)

gmapT :: (forall b. Data b => b -> b) -> ExpandHidden -> ExpandHidden

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ExpandHidden -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ExpandHidden -> r

gmapQ :: (forall d. Data d => d -> u) -> ExpandHidden -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> ExpandHidden -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> ExpandHidden -> m ExpandHidden

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ExpandHidden -> m ExpandHidden

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ExpandHidden -> m ExpandHidden

Generic ExpandHidden

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep ExpandHidden :: Type -> Type

Methods

from :: ExpandHidden -> Rep ExpandHidden x

to :: Rep ExpandHidden x -> ExpandHidden

NFData ExpandHidden

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: ExpandHidden -> ()

Eq ExpandHidden

Defined in Agda.TypeChecking.Monad.Base

Methods

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

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

type Rep ExpandHidden

Defined in Agda.TypeChecking.Monad.Base

type Rep ExpandHidden = D1 ('MetaData "ExpandHidden" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-inplace" 'False) (C1 ('MetaCons "ExpandLast" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "DontExpandLast" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "ReallyDontExpandLast" 'PrefixI 'False) (U1 :: Type -> Type)))

data AbstractMode

Constructors

AbstractMode

Abstract things in the current module can be accessed.

ConcreteMode

No abstract things can be accessed.

IgnoreAbstractMode

All abstract things can be accessed.

Instances

Data AbstractMode

Defined in Agda.TypeChecking.Monad.Base

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> AbstractMode -> c AbstractMode

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c AbstractMode

toConstr :: AbstractMode -> Constr

dataTypeOf :: AbstractMode -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c AbstractMode)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c AbstractMode)

gmapT :: (forall b. Data b => b -> b) -> AbstractMode -> AbstractMode

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> AbstractMode -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> AbstractMode -> r

gmapQ :: (forall d. Data d => d -> u) -> AbstractMode -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> AbstractMode -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> AbstractMode -> m AbstractMode

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> AbstractMode -> m AbstractMode

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> AbstractMode -> m AbstractMode

Generic AbstractMode

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep AbstractMode :: Type -> Type

Methods

from :: AbstractMode -> Rep AbstractMode x

to :: Rep AbstractMode x -> AbstractMode

Show AbstractMode

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> AbstractMode -> ShowS

show :: AbstractMode -> String

showList :: [AbstractMode] -> ShowS

NFData AbstractMode

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: AbstractMode -> ()

Eq AbstractMode

Defined in Agda.TypeChecking.Monad.Base

Methods

(==) :: AbstractMode -> AbstractMode -> Bool

(/=) :: AbstractMode -> AbstractMode -> Bool

type Rep AbstractMode

Defined in Agda.TypeChecking.Monad.Base

type Rep AbstractMode = D1 ('MetaData "AbstractMode" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-inplace" 'False) (C1 ('MetaCons "AbstractMode" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "ConcreteMode" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "IgnoreAbstractMode" 'PrefixI 'False) (U1 :: Type -> Type)))

type LetBindings = Map Name (Open (Term, Dom Type))

type ContextEntry = Dom (Name, Type)

type Context = [ContextEntry]

The Context is a stack of ContextEntrys.

data UnquoteFlags

Constructors

UnquoteFlags

Fields

• _unquoteNormalise :: Bool

Instances

Data UnquoteFlags

Defined in Agda.TypeChecking.Monad.Base

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> UnquoteFlags -> c UnquoteFlags

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c UnquoteFlags

toConstr :: UnquoteFlags -> Constr

dataTypeOf :: UnquoteFlags -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c UnquoteFlags)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c UnquoteFlags)

gmapT :: (forall b. Data b => b -> b) -> UnquoteFlags -> UnquoteFlags

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> UnquoteFlags -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> UnquoteFlags -> r

gmapQ :: (forall d. Data d => d -> u) -> UnquoteFlags -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> UnquoteFlags -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> UnquoteFlags -> m UnquoteFlags

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> UnquoteFlags -> m UnquoteFlags

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> UnquoteFlags -> m UnquoteFlags

Generic UnquoteFlags

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep UnquoteFlags :: Type -> Type

Methods

from :: UnquoteFlags -> Rep UnquoteFlags x

to :: Rep UnquoteFlags x -> UnquoteFlags

NFData UnquoteFlags

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: UnquoteFlags -> ()

type Rep UnquoteFlags

Defined in Agda.TypeChecking.Monad.Base

type Rep UnquoteFlags = D1 ('MetaData "UnquoteFlags" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-inplace" 'False) (C1 ('MetaCons "UnquoteFlags" 'PrefixI 'True) (S1 ('MetaSel ('Just "_unquoteNormalise") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool)))

class LensTCEnv a where

Methods

lensTCEnv :: Lens' TCEnv a

Instances

LensTCEnv TCEnv

Defined in Agda.TypeChecking.Monad.Base

Methods

lensTCEnv :: Lens' TCEnv TCEnv

LensTCEnv (Closure a)

Defined in Agda.TypeChecking.Monad.Base

Methods

lensTCEnv :: Lens' TCEnv (Closure a)

data Builtin pf

Constructors

Builtin Term

Prim pf

Instances

Foldable Builtin

Defined in Agda.TypeChecking.Monad.Base

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

Defined in Agda.TypeChecking.Monad.Base

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

Defined in Agda.TypeChecking.Monad.Base

Methods

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

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

InstantiateFull a => InstantiateFull (Builtin a)

Defined in Agda.TypeChecking.Reduce

Methods

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

EmbPrj a => EmbPrj (Builtin a)

Defined in Agda.TypeChecking.Serialise.Instances.Internal

Methods

icode :: Builtin a -> S Int32

icod_ :: Builtin a -> S Int32

value :: Int32 -> R (Builtin a)

Generic (Builtin pf)

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep (Builtin pf) :: Type -> Type

Methods

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

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

Show pf => Show (Builtin pf)

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> Builtin pf -> ShowS

show :: Builtin pf -> String

showList :: [Builtin pf] -> ShowS

NFData pf => NFData (Builtin pf)

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: Builtin pf -> ()

type Rep (Builtin pf)

Defined in Agda.TypeChecking.Monad.Base

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

type BuiltinThings pf = Map String (Builtin pf)

data BuiltinInfo

Constructors

BuiltinInfo

Fields

• builtinName :: String
• builtinDesc :: BuiltinDescriptor

data BuiltinDescriptor

Constructors

BuiltinData (TCM Type) [String]

BuiltinDataCons (TCM Type)

BuiltinPrim String (Term -> TCM ())

BuiltinSort String

BuiltinPostulate Relevance (TCM Type)

BuiltinUnknown (Maybe (TCM Type)) (Term -> Type -> TCM ())

Builtin of any kind. Type can be checked (Just t) or inferred (Nothing). The second argument is the hook for the verification function.

type TempInstanceTable = (InstanceTable, Set QName)

When typechecking something of the following form:

instance x : _ x = y

it's not yet known where to add x, so we add it to a list of unresolved instances and we'll deal with it later.

type InstanceTable = Map QName (Set QName)

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

data Call

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

CheckConstructorFitsIn QName 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

CheckWithFunctionType Type

CheckSectionApplication Range ModuleName ModuleApplication

CheckNamedWhere ModuleName

ScopeCheckExpr Expr

ScopeCheckDeclaration NiceDeclaration

ScopeCheckLHS QName Pattern

NoHighlighting

ModuleContents

Interaction command: show module contents.

SetRange Range

used by setCurrentRange

Instances

HasRange Call

Defined in Agda.TypeChecking.Monad.Base

Methods

getRange :: Call -> Range

PrettyTCM Call

Defined in Agda.TypeChecking.Pretty.Call

Methods

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

Pretty Call

Defined in Agda.TypeChecking.Monad.Base

Methods

pretty :: Call -> Doc

prettyPrec :: Int -> Call -> Doc

prettyList :: [Call] -> Doc

Data Call

Defined in Agda.TypeChecking.Monad.Base

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Call -> c Call

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Call

toConstr :: Call -> Constr

dataTypeOf :: Call -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Call)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Call)

gmapT :: (forall b. Data b => b -> b) -> Call -> Call

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Call -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Call -> r

gmapQ :: (forall d. Data d => d -> u) -> Call -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Call -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Call -> m Call

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Call -> m Call

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Call -> m Call

Generic Call

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep Call :: Type -> Type

Methods

from :: Call -> Rep Call x

to :: Rep Call x -> Call

NFData Call

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: Call -> ()

type Rep Call

Defined in Agda.TypeChecking.Monad.Base

type Rep Call = D1 ('MetaData "Call" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-inplace" 'False) (((((C1 ('MetaCons "CheckClause" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 SpineClause)) :+: C1 ('MetaCons "CheckLHS" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 SpineLHS))) :+: (C1 ('MetaCons "CheckPattern" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Pattern) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Telescope) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type))) :+: C1 ('MetaCons "CheckPatternLinearityType" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name)))) :+: ((C1 ('MetaCons "CheckPatternLinearityValue" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name)) :+: C1 ('MetaCons "CheckLetBinding" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 LetBinding))) :+: (C1 ('MetaCons "InferExpr" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Expr)) :+: C1 ('MetaCons "CheckExprCall" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Comparison) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Expr) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type)))))) :+: (((C1 ('MetaCons "CheckDotPattern" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Expr) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term)) :+: C1 ('MetaCons "CheckProjection" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Range) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type)))) :+: (C1 ('MetaCons "IsTypeCall" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Comparison) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Expr) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Sort))) :+: C1 ('MetaCons "IsType_" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Expr)))) :+: ((C1 ('MetaCons "InferVar" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name)) :+: C1 ('MetaCons "InferDef" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName))) :+: (C1 ('MetaCons "CheckArguments" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Range) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [NamedArg Expr])) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe Type)))) :+: (C1 ('MetaCons "CheckMetaSolution" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Range) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 MetaId)) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term))) :+: C1 ('MetaCons "CheckTargetType" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Range) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type)))))))) :+: ((((C1 ('MetaCons "CheckDataDef" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Range) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName)) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [LamBinding]) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Constructor]))) :+: C1 ('MetaCons "CheckRecDef" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Range) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName)) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [LamBinding]) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Constructor])))) :+: (C1 ('MetaCons "CheckConstructor" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Telescope)) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Sort) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Constructor))) :+: C1 ('MetaCons "CheckConstructorFitsIn" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Sort))))) :+: ((C1 ('MetaCons "CheckFunDefCall" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Range) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName)) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Clause]) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool))) :+: C1 ('MetaCons "CheckPragma" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Range) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Pragma))) :+: (C1 ('MetaCons "CheckPrimitive" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Range) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Expr))) :+: (C1 ('MetaCons "CheckIsEmpty" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Range) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type)) :+: C1 ('MetaCons "CheckConfluence" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName)))))) :+: (((C1 ('MetaCons "CheckWithFunctionType" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type)) :+: C1 ('MetaCons "CheckSectionApplication" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Range) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ModuleName) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ModuleApplication)))) :+: (C1 ('MetaCons "CheckNamedWhere" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ModuleName)) :+: C1 ('MetaCons "ScopeCheckExpr" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Expr)))) :+: ((C1 ('MetaCons "ScopeCheckDeclaration" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 NiceDeclaration)) :+: C1 ('MetaCons "ScopeCheckLHS" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Pattern))) :+: (C1 ('MetaCons "NoHighlighting" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "ModuleContents" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "SetRange" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Range))))))))

type Statistics = Map String Integer

newtype MutualId

Constructors

MutId Int32

Instances

KillRange MutualId

Defined in Agda.TypeChecking.Monad.Base

Methods

killRange :: KillRangeT MutualId

HasFresh MutualId

Defined in Agda.TypeChecking.Monad.Base

Methods

freshLens :: Lens' MutualId TCState

nextFresh' :: MutualId -> MutualId

EmbPrj MutualId

Defined in Agda.TypeChecking.Serialise.Instances.Internal

Methods

icode :: MutualId -> S Int32

icod_ :: MutualId -> S Int32

value :: Int32 -> R MutualId

Data MutualId

Defined in Agda.TypeChecking.Monad.Base

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> MutualId -> c MutualId

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c MutualId

toConstr :: MutualId -> Constr

dataTypeOf :: MutualId -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c MutualId)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c MutualId)

gmapT :: (forall b. Data b => b -> b) -> MutualId -> MutualId

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> MutualId -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> MutualId -> r

gmapQ :: (forall d. Data d => d -> u) -> MutualId -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> MutualId -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> MutualId -> m MutualId

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> MutualId -> m MutualId

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> MutualId -> m MutualId

Enum MutualId

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

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

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> MutualId -> ShowS

show :: MutualId -> String

showList :: [MutualId] -> ShowS

NFData MutualId

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: MutualId -> ()

Eq MutualId

Defined in Agda.TypeChecking.Monad.Base

Methods

(==) :: MutualId -> MutualId -> Bool

(/=) :: MutualId -> MutualId -> Bool

Ord MutualId

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 TermHead

Constructors

SortHead

PiHead

ConsHead QName

VarHead Nat

UnknownHead

Instances

KillRange TermHead

Defined in Agda.TypeChecking.Monad.Base

Methods

killRange :: KillRangeT TermHead

EmbPrj TermHead

Defined in Agda.TypeChecking.Serialise.Instances.Internal

Methods

icode :: TermHead -> S Int32

icod_ :: TermHead -> S Int32

value :: Int32 -> R TermHead

Pretty TermHead

Defined in Agda.TypeChecking.Monad.Base

Methods

pretty :: TermHead -> Doc

prettyPrec :: Int -> TermHead -> Doc

prettyList :: [TermHead] -> Doc

Data TermHead

Defined in Agda.TypeChecking.Monad.Base

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> TermHead -> c TermHead

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c TermHead

toConstr :: TermHead -> Constr

dataTypeOf :: TermHead -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c TermHead)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c TermHead)

gmapT :: (forall b. Data b => b -> b) -> TermHead -> TermHead

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> TermHead -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> TermHead -> r

gmapQ :: (forall d. Data d => d -> u) -> TermHead -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> TermHead -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> TermHead -> m TermHead

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> TermHead -> m TermHead

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> TermHead -> m TermHead

Generic TermHead

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep TermHead :: Type -> Type

Methods

from :: TermHead -> Rep TermHead x

to :: Rep TermHead x -> TermHead

Show TermHead

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> TermHead -> ShowS

show :: TermHead -> String

showList :: [TermHead] -> ShowS

NFData TermHead

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: TermHead -> ()

Eq TermHead

Defined in Agda.TypeChecking.Monad.Base

Methods

(==) :: TermHead -> TermHead -> Bool

(/=) :: TermHead -> TermHead -> Bool

Ord TermHead

Defined in Agda.TypeChecking.Monad.Base

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

Defined in Agda.TypeChecking.Monad.Base

type Rep TermHead = D1 ('MetaData "TermHead" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-inplace" 'False) ((C1 ('MetaCons "SortHead" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "PiHead" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "ConsHead" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName)) :+: (C1 ('MetaCons "VarHead" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Nat)) :+: C1 ('MetaCons "UnknownHead" 'PrefixI 'False) (U1 :: Type -> Type))))

data FunctionInverse' c

Constructors

NotInjective

Inverse (InversionMap c)

Instances

DropArgs FunctionInverse

Defined in Agda.TypeChecking.DropArgs

Methods

dropArgs :: Int -> FunctionInverse -> FunctionInverse

InstantiateFull FunctionInverse

Defined in Agda.TypeChecking.Reduce

Methods

instantiateFull' :: FunctionInverse -> ReduceM FunctionInverse

Abstract FunctionInverse

Defined in Agda.TypeChecking.Substitute

Methods

abstract :: Telescope -> FunctionInverse -> FunctionInverse

Apply FunctionInverse

Defined in Agda.TypeChecking.Substitute

Methods

apply :: FunctionInverse -> Args -> FunctionInverse

applyE :: FunctionInverse -> Elims -> FunctionInverse

Functor FunctionInverse'

Defined in Agda.TypeChecking.Monad.Base

Methods

fmap :: (a -> b) -> FunctionInverse' a -> FunctionInverse' b

(<$) :: a -> FunctionInverse' b -> FunctionInverse' a

KillRange c => KillRange (FunctionInverse' c)

Defined in Agda.TypeChecking.Monad.Base

Methods

killRange :: KillRangeT (FunctionInverse' c)

EmbPrj a => EmbPrj (FunctionInverse' a)

Defined in Agda.TypeChecking.Serialise.Instances.Internal

Methods

icode :: FunctionInverse' a -> S Int32

icod_ :: FunctionInverse' a -> S Int32

value :: Int32 -> R (FunctionInverse' a)

Pretty c => Pretty (FunctionInverse' c)

Defined in Agda.TypeChecking.Monad.Base

Methods

pretty :: FunctionInverse' c -> Doc

prettyPrec :: Int -> FunctionInverse' c -> Doc

prettyList :: [FunctionInverse' c] -> Doc

Data c => Data (FunctionInverse' c)

Defined in Agda.TypeChecking.Monad.Base

Methods

gfoldl :: (forall d b. Data d => c0 (d -> b) -> d -> c0 b) -> (forall g. g -> c0 g) -> FunctionInverse' c -> c0 (FunctionInverse' c)

gunfold :: (forall b r. Data b => c0 (b -> r) -> c0 r) -> (forall r. r -> c0 r) -> Constr -> c0 (FunctionInverse' c)

toConstr :: FunctionInverse' c -> Constr

dataTypeOf :: FunctionInverse' c -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c0 (t d)) -> Maybe (c0 (FunctionInverse' c))

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c0 (t d e)) -> Maybe (c0 (FunctionInverse' c))

gmapT :: (forall b. Data b => b -> b) -> FunctionInverse' c -> FunctionInverse' c

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> FunctionInverse' c -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> FunctionInverse' c -> r

gmapQ :: (forall d. Data d => d -> u) -> FunctionInverse' c -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> FunctionInverse' c -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> FunctionInverse' c -> m (FunctionInverse' c)

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> FunctionInverse' c -> m (FunctionInverse' c)

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> FunctionInverse' c -> m (FunctionInverse' c)

Generic (FunctionInverse' c)

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep (FunctionInverse' c) :: Type -> Type

Methods

from :: FunctionInverse' c -> Rep (FunctionInverse' c) x

to :: Rep (FunctionInverse' c) x -> FunctionInverse' c

Show c => Show (FunctionInverse' c)

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> FunctionInverse' c -> ShowS

show :: FunctionInverse' c -> String

showList :: [FunctionInverse' c] -> ShowS

NFData c => NFData (FunctionInverse' c)

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: FunctionInverse' c -> ()

type Rep (FunctionInverse' c)

Defined in Agda.TypeChecking.Monad.Base

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

type InversionMap c = Map TermHead [c]

type FunctionInverse = FunctionInverse' Clause

data PrimFun

Constructors

PrimFun

Fields

• primFunName :: QName
• primFunArity :: Arity
• primFunImplementation :: [Arg Term] -> Int -> ReduceM (Reduced MaybeReducedArgs Term)

Instances

Abstract PrimFun

Defined in Agda.TypeChecking.Substitute

Methods

abstract :: Telescope -> PrimFun -> PrimFun

Apply PrimFun

Defined in Agda.TypeChecking.Substitute

Methods

apply :: PrimFun -> Args -> PrimFun

applyE :: PrimFun -> Elims -> PrimFun

Generic PrimFun

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep PrimFun :: Type -> Type

Methods

from :: PrimFun -> Rep PrimFun x

to :: Rep PrimFun x -> PrimFun

NFData PrimFun

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: PrimFun -> ()

type Rep PrimFun

Defined in Agda.TypeChecking.Monad.Base

type Rep PrimFun = D1 ('MetaData "PrimFun" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-inplace" 'False) (C1 ('MetaCons "PrimFun" 'PrefixI 'True) (S1 ('MetaSel ('Just "primFunName") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName) :*: (S1 ('MetaSel ('Just "primFunArity") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Arity) :*: S1 ('MetaSel ('Just "primFunImplementation") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ([Arg Term] -> Int -> ReduceM (Reduced MaybeReducedArgs Term))))))

data PrimitiveImpl

Primitives

Constructors

PrimImpl Type PrimFun

data ReduceDefs

Constructors

OnlyReduceDefs (Set QName)

DontReduceDefs (Set QName)

Instances

Data ReduceDefs

Defined in Agda.TypeChecking.Monad.Base

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ReduceDefs -> c ReduceDefs

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c ReduceDefs

toConstr :: ReduceDefs -> Constr

dataTypeOf :: ReduceDefs -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c ReduceDefs)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c ReduceDefs)

gmapT :: (forall b. Data b => b -> b) -> ReduceDefs -> ReduceDefs

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ReduceDefs -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ReduceDefs -> r

gmapQ :: (forall d. Data d => d -> u) -> ReduceDefs -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> ReduceDefs -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> ReduceDefs -> m ReduceDefs

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ReduceDefs -> m ReduceDefs

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ReduceDefs -> m ReduceDefs

Monoid ReduceDefs

Defined in Agda.TypeChecking.Monad.Base

Methods

mempty :: ReduceDefs

mappend :: ReduceDefs -> ReduceDefs -> ReduceDefs

mconcat :: [ReduceDefs] -> ReduceDefs

Semigroup ReduceDefs

Defined in Agda.TypeChecking.Monad.Base

Methods

(<>) :: ReduceDefs -> ReduceDefs -> ReduceDefs

sconcat :: NonEmpty ReduceDefs -> ReduceDefs

stimes :: Integral b => b -> ReduceDefs -> ReduceDefs

Generic ReduceDefs

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep ReduceDefs :: Type -> Type

Methods

from :: ReduceDefs -> Rep ReduceDefs x

to :: Rep ReduceDefs x -> ReduceDefs

NFData ReduceDefs

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: ReduceDefs -> ()

type Rep ReduceDefs

Defined in Agda.TypeChecking.Monad.Base

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

type AllowedReductions = SmallSet AllowedReduction

data AllowedReduction

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 Term 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

Data AllowedReduction

Defined in Agda.TypeChecking.Monad.Base

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> AllowedReduction -> c AllowedReduction

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c AllowedReduction

toConstr :: AllowedReduction -> Constr

dataTypeOf :: AllowedReduction -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c AllowedReduction)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c AllowedReduction)

gmapT :: (forall b. Data b => b -> b) -> AllowedReduction -> AllowedReduction

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> AllowedReduction -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> AllowedReduction -> r

gmapQ :: (forall d. Data d => d -> u) -> AllowedReduction -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> AllowedReduction -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> AllowedReduction -> m AllowedReduction

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> AllowedReduction -> m AllowedReduction

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> AllowedReduction -> m AllowedReduction

Bounded AllowedReduction

Defined in Agda.TypeChecking.Monad.Base

Methods

minBound :: AllowedReduction

maxBound :: AllowedReduction

Enum AllowedReduction

Defined in Agda.TypeChecking.Monad.Base

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

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep AllowedReduction :: Type -> Type

Methods

from :: AllowedReduction -> Rep AllowedReduction x

to :: Rep AllowedReduction x -> AllowedReduction

Ix AllowedReduction

Defined in Agda.TypeChecking.Monad.Base

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

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> AllowedReduction -> ShowS

show :: AllowedReduction -> String

showList :: [AllowedReduction] -> ShowS

NFData AllowedReduction

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: AllowedReduction -> ()

Eq AllowedReduction

Defined in Agda.TypeChecking.Monad.Base

Methods

(==) :: AllowedReduction -> AllowedReduction -> Bool

(/=) :: AllowedReduction -> AllowedReduction -> Bool

Ord AllowedReduction

Defined in Agda.TypeChecking.Monad.Base

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

Defined in Agda.TypeChecking.Monad.Base

type Rep AllowedReduction = D1 ('MetaData "AllowedReduction" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-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 MaybeReducedElims = [MaybeReduced Elim]

type MaybeReducedArgs = [MaybeReduced (Arg Term)]

data MaybeReduced a

Constructors

MaybeRed

Fields

• isReduced :: IsReduced
• ignoreReduced :: a

Instances

Functor MaybeReduced

Defined in Agda.TypeChecking.Monad.Base

Methods

fmap :: (a -> b) -> MaybeReduced a -> MaybeReduced b

(<$) :: a -> MaybeReduced b -> MaybeReduced a

IsProjElim e => IsProjElim (MaybeReduced e)

Defined in Agda.TypeChecking.Monad.Base

Methods

isProjElim :: MaybeReduced e -> Maybe (ProjOrigin, QName)

PrettyTCM a => PrettyTCM (MaybeReduced a)

Defined in Agda.TypeChecking.Pretty

Methods

prettyTCM :: MonadPretty m => MaybeReduced a -> m Doc

data IsReduced

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

Constructors

NotReduced

Reduced (Blocked ())

data Reduced no yes

Constructors

NoReduction no

YesReduction Simplification yes

Instances

Functor (Reduced no)

Defined in Agda.TypeChecking.Monad.Base

Methods

fmap :: (a -> b) -> Reduced no a -> Reduced no b

(<$) :: a -> Reduced no b -> Reduced no a

data Simplification

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

Null Simplification

Defined in Agda.TypeChecking.Monad.Base

Methods

empty :: Simplification

null :: Simplification -> Bool

Data Simplification

Defined in Agda.TypeChecking.Monad.Base

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Simplification -> c Simplification

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Simplification

toConstr :: Simplification -> Constr

dataTypeOf :: Simplification -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Simplification)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Simplification)

gmapT :: (forall b. Data b => b -> b) -> Simplification -> Simplification

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Simplification -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Simplification -> r

gmapQ :: (forall d. Data d => d -> u) -> Simplification -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Simplification -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Simplification -> m Simplification

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Simplification -> m Simplification

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Simplification -> m Simplification

Monoid Simplification

Defined in Agda.TypeChecking.Monad.Base

Methods

mempty :: Simplification

mappend :: Simplification -> Simplification -> Simplification

mconcat :: [Simplification] -> Simplification

Semigroup Simplification

Defined in Agda.TypeChecking.Monad.Base

Methods

(<>) :: Simplification -> Simplification -> Simplification

sconcat :: NonEmpty Simplification -> Simplification

stimes :: Integral b => b -> Simplification -> Simplification

Generic Simplification

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep Simplification :: Type -> Type

Methods

from :: Simplification -> Rep Simplification x

to :: Rep Simplification x -> Simplification

Show Simplification

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> Simplification -> ShowS

show :: Simplification -> String

showList :: [Simplification] -> ShowS

NFData Simplification

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: Simplification -> ()

Eq Simplification

Defined in Agda.TypeChecking.Monad.Base

Methods

(==) :: Simplification -> Simplification -> Bool

(/=) :: Simplification -> Simplification -> Bool

type Rep Simplification

Defined in Agda.TypeChecking.Monad.Base

type Rep Simplification = D1 ('MetaData "Simplification" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-inplace" 'False) (C1 ('MetaCons "YesSimplification" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "NoSimplification" 'PrefixI 'False) (U1 :: Type -> Type))

newtype Fields

Constructors

Fields [(Name, Type)]

Instances

Null Fields

Defined in Agda.TypeChecking.Monad.Base

Methods

empty :: Fields

null :: Fields -> Bool

data Defn

Constructors

Axiom

Postulate

Fields

• axiomConstTransp :: Bool

  Can transp for this postulate be constant? Set to True for bultins like String.

DataOrRecSig

Data or record type signature that doesn't yet have a definition

Fields

• datarecPars :: Int

GeneralizableVar

Generalizable variable (introduced in generalize block)

AbstractDefn Defn

Returned by getConstInfo if definition is abstract.

Function

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
• funDelayed :: Delayed

  Are the clauses of this definition delayed?

• funProjection :: Maybe 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.

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

Datatype

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)

Record

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.

• recAbstr :: IsAbstract
• recComp :: CompKit

Constructor

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
• conInd :: Induction

  Inductive or coinductive?

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

Primitive

Primitive or builtin functions.

Fields

• primAbstr :: IsAbstract
• primName :: String
• 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.

PrimitiveSort

Fields

• primName :: String
• primSort :: Sort

Instances

NamesIn Defn

Defined in Agda.Syntax.Internal.Names

Methods

namesIn' :: Monoid m => (QName -> m) -> Defn -> m

KillRange Defn

Defined in Agda.TypeChecking.Monad.Base

Methods

killRange :: KillRangeT Defn

Occurs Defn

Defined in Agda.TypeChecking.MetaVars.Occurs

Methods

occurs :: Defn -> OccursM Defn

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

InstantiateFull Defn

Defined in Agda.TypeChecking.Reduce

Methods

instantiateFull' :: Defn -> ReduceM Defn

EmbPrj Defn

Defined in Agda.TypeChecking.Serialise.Instances.Internal

Methods

icode :: Defn -> S Int32

icod_ :: Defn -> S Int32

value :: Int32 -> R Defn

Abstract Defn

Defined in Agda.TypeChecking.Substitute

Methods

abstract :: Telescope -> Defn -> Defn

Apply Defn

Defined in Agda.TypeChecking.Substitute

Methods

apply :: Defn -> Args -> Defn

applyE :: Defn -> Elims -> Defn

Pretty Defn

Defined in Agda.TypeChecking.Monad.Base

Methods

pretty :: Defn -> Doc

prettyPrec :: Int -> Defn -> Doc

prettyList :: [Defn] -> Doc

Data Defn

Defined in Agda.TypeChecking.Monad.Base

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Defn -> c Defn

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Defn

toConstr :: Defn -> Constr

dataTypeOf :: Defn -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Defn)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Defn)

gmapT :: (forall b. Data b => b -> b) -> Defn -> Defn

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Defn -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Defn -> r

gmapQ :: (forall d. Data d => d -> u) -> Defn -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Defn -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Defn -> m Defn

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Defn -> m Defn

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Defn -> m Defn

Generic Defn

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep Defn :: Type -> Type

Methods

from :: Defn -> Rep Defn x

to :: Rep Defn x -> Defn

Show Defn

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> Defn -> ShowS

show :: Defn -> String

showList :: [Defn] -> ShowS

NFData Defn

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: Defn -> ()

type Rep Defn

Defined in Agda.TypeChecking.Monad.Base

type Rep Defn = D1 ('MetaData "Defn" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-inplace" 'False) (((C1 ('MetaCons "Axiom" 'PrefixI 'True) (S1 ('MetaSel ('Just "axiomConstTransp") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool)) :+: C1 ('MetaCons "DataOrRecSig" 'PrefixI 'True) (S1 ('MetaSel ('Just "datarecPars") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Int))) :+: (C1 ('MetaCons "GeneralizableVar" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "AbstractDefn" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Defn)) :+: C1 ('MetaCons "Function" 'PrefixI 'True) (((S1 ('MetaSel ('Just "funClauses") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Clause]) :*: (S1 ('MetaSel ('Just "funCompiled") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe CompiledClauses)) :*: S1 ('MetaSel ('Just "funSplitTree") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe SplitTree)))) :*: ((S1 ('MetaSel ('Just "funTreeless") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe Compiled)) :*: S1 ('MetaSel ('Just "funCovering") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Clause])) :*: (S1 ('MetaSel ('Just "funInv") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 FunctionInverse) :*: S1 ('MetaSel ('Just "funMutual") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe [QName]))))) :*: ((S1 ('MetaSel ('Just "funAbstr") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 IsAbstract) :*: (S1 ('MetaSel ('Just "funDelayed") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Delayed) :*: S1 ('MetaSel ('Just "funProjection") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe Projection)))) :*: ((S1 ('MetaSel ('Just "funFlags") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Set FunctionFlag)) :*: S1 ('MetaSel ('Just "funTerminates") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe Bool))) :*: (S1 ('MetaSel ('Just "funExtLam") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe ExtLamInfo)) :*: S1 ('MetaSel ('Just "funWith") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe QName))))))))) :+: ((C1 ('MetaCons "Datatype" 'PrefixI 'True) (((S1 ('MetaSel ('Just "dataPars") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Nat) :*: S1 ('MetaSel ('Just "dataIxs") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Nat)) :*: (S1 ('MetaSel ('Just "dataClause") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe Clause)) :*: S1 ('MetaSel ('Just "dataCons") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [QName]))) :*: ((S1 ('MetaSel ('Just "dataSort") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Sort) :*: S1 ('MetaSel ('Just "dataMutual") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe [QName]))) :*: (S1 ('MetaSel ('Just "dataAbstr") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 IsAbstract) :*: S1 ('MetaSel ('Just "dataPathCons") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [QName])))) :+: C1 ('MetaCons "Record" 'PrefixI 'True) (((S1 ('MetaSel ('Just "recPars") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Nat) :*: (S1 ('MetaSel ('Just "recClause") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe Clause)) :*: S1 ('MetaSel ('Just "recConHead") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ConHead))) :*: (S1 ('MetaSel ('Just "recNamedCon") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool) :*: (S1 ('MetaSel ('Just "recFields") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Dom QName]) :*: S1 ('MetaSel ('Just "recTel") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Telescope)))) :*: ((S1 ('MetaSel ('Just "recMutual") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe [QName])) :*: (S1 ('MetaSel ('Just "recEtaEquality'") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 EtaEquality) :*: S1 ('MetaSel ('Just "recPatternMatching") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 PatternOrCopattern))) :*: (S1 ('MetaSel ('Just "recInduction") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe Induction)) :*: (S1 ('MetaSel ('Just "recAbstr") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 IsAbstract) :*: S1 ('MetaSel ('Just "recComp") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 CompKit)))))) :+: (C1 ('MetaCons "Constructor" 'PrefixI 'True) (((S1 ('MetaSel ('Just "conPars") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Int) :*: S1 ('MetaSel ('Just "conArity") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Int)) :*: (S1 ('MetaSel ('Just "conSrcCon") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ConHead) :*: (S1 ('MetaSel ('Just "conData") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName) :*: S1 ('MetaSel ('Just "conAbstr") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 IsAbstract)))) :*: ((S1 ('MetaSel ('Just "conInd") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Induction) :*: S1 ('MetaSel ('Just "conComp") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 CompKit)) :*: (S1 ('MetaSel ('Just "conProj") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe [QName])) :*: (S1 ('MetaSel ('Just "conForced") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [IsForced]) :*: S1 ('MetaSel ('Just "conErased") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe [Bool])))))) :+: (C1 ('MetaCons "Primitive" 'PrefixI 'True) ((S1 ('MetaSel ('Just "primAbstr") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 IsAbstract) :*: S1 ('MetaSel ('Just "primName") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String)) :*: (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))))) :+: C1 ('MetaCons "PrimitiveSort" 'PrefixI 'True) (S1 ('MetaSel ('Just "primName") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String) :*: S1 ('MetaSel ('Just "primSort") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Sort))))))

data CompKit

Constructors

CompKit

Fields

• nameOfHComp :: Maybe QName
• nameOfTransp :: Maybe QName

Instances

NamesIn CompKit

Defined in Agda.Syntax.Internal.Names

Methods

namesIn' :: Monoid m => (QName -> m) -> CompKit -> m

KillRange CompKit

Defined in Agda.TypeChecking.Monad.Base

Methods

killRange :: KillRangeT CompKit

EmbPrj CompKit

Defined in Agda.TypeChecking.Serialise.Instances.Internal

Methods

icode :: CompKit -> S Int32

icod_ :: CompKit -> S Int32

value :: Int32 -> R CompKit

Data CompKit

Defined in Agda.TypeChecking.Monad.Base

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> CompKit -> c CompKit

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c CompKit

toConstr :: CompKit -> Constr

dataTypeOf :: CompKit -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c CompKit)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c CompKit)

gmapT :: (forall b. Data b => b -> b) -> CompKit -> CompKit

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> CompKit -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> CompKit -> r

gmapQ :: (forall d. Data d => d -> u) -> CompKit -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> CompKit -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> CompKit -> m CompKit

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> CompKit -> m CompKit

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> CompKit -> m CompKit

Generic CompKit

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep CompKit :: Type -> Type

Methods

from :: CompKit -> Rep CompKit x

to :: Rep CompKit x -> CompKit

Show CompKit

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> CompKit -> ShowS

show :: CompKit -> String

showList :: [CompKit] -> ShowS

NFData CompKit

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: CompKit -> ()

Eq CompKit

Defined in Agda.TypeChecking.Monad.Base

Methods

(==) :: CompKit -> CompKit -> Bool

(/=) :: CompKit -> CompKit -> Bool

Ord CompKit

Defined in Agda.TypeChecking.Monad.Base

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

Defined in Agda.TypeChecking.Monad.Base

type Rep CompKit = D1 ('MetaData "CompKit" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-inplace" 'False) (C1 ('MetaCons "CompKit" 'PrefixI 'True) (S1 ('MetaSel ('Just "nameOfHComp") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe QName)) :*: S1 ('MetaSel ('Just "nameOfTransp") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe QName))))

data FunctionFlag

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

KillRange FunctionFlag

Defined in Agda.TypeChecking.Monad.Base

Methods

killRange :: KillRangeT FunctionFlag

EmbPrj FunctionFlag

Defined in Agda.TypeChecking.Serialise.Instances.Internal

Methods

icode :: FunctionFlag -> S Int32

icod_ :: FunctionFlag -> S Int32

value :: Int32 -> R FunctionFlag

Data FunctionFlag

Defined in Agda.TypeChecking.Monad.Base

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> FunctionFlag -> c FunctionFlag

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c FunctionFlag

toConstr :: FunctionFlag -> Constr

dataTypeOf :: FunctionFlag -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c FunctionFlag)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c FunctionFlag)

gmapT :: (forall b. Data b => b -> b) -> FunctionFlag -> FunctionFlag

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> FunctionFlag -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> FunctionFlag -> r

gmapQ :: (forall d. Data d => d -> u) -> FunctionFlag -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> FunctionFlag -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> FunctionFlag -> m FunctionFlag

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> FunctionFlag -> m FunctionFlag

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> FunctionFlag -> m FunctionFlag

Enum FunctionFlag

Defined in Agda.TypeChecking.Monad.Base

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

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep FunctionFlag :: Type -> Type

Methods

from :: FunctionFlag -> Rep FunctionFlag x

to :: Rep FunctionFlag x -> FunctionFlag

Show FunctionFlag

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> FunctionFlag -> ShowS

show :: FunctionFlag -> String

showList :: [FunctionFlag] -> ShowS

NFData FunctionFlag

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: FunctionFlag -> ()

Eq FunctionFlag

Defined in Agda.TypeChecking.Monad.Base

Methods

(==) :: FunctionFlag -> FunctionFlag -> Bool

(/=) :: FunctionFlag -> FunctionFlag -> Bool

Ord FunctionFlag

Defined in Agda.TypeChecking.Monad.Base

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

Defined in Agda.TypeChecking.Monad.Base

type Rep FunctionFlag = D1 ('MetaData "FunctionFlag" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-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 EtaEquality

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

CopatternMatchingAllowed EtaEquality

Defined in Agda.TypeChecking.Monad.Base

Methods

copatternMatchingAllowed :: EtaEquality -> Bool

PatternMatchingAllowed EtaEquality

Defined in Agda.TypeChecking.Monad.Base

Methods

patternMatchingAllowed :: EtaEquality -> Bool

KillRange EtaEquality

Defined in Agda.TypeChecking.Monad.Base

Methods

killRange :: KillRangeT EtaEquality

EmbPrj EtaEquality

Defined in Agda.TypeChecking.Serialise.Instances.Internal

Methods

icode :: EtaEquality -> S Int32

icod_ :: EtaEquality -> S Int32

value :: Int32 -> R EtaEquality

Data EtaEquality

Defined in Agda.TypeChecking.Monad.Base

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> EtaEquality -> c EtaEquality

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c EtaEquality

toConstr :: EtaEquality -> Constr

dataTypeOf :: EtaEquality -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c EtaEquality)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c EtaEquality)

gmapT :: (forall b. Data b => b -> b) -> EtaEquality -> EtaEquality

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> EtaEquality -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> EtaEquality -> r

gmapQ :: (forall d. Data d => d -> u) -> EtaEquality -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> EtaEquality -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> EtaEquality -> m EtaEquality

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> EtaEquality -> m EtaEquality

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> EtaEquality -> m EtaEquality

Generic EtaEquality

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep EtaEquality :: Type -> Type

Methods

from :: EtaEquality -> Rep EtaEquality x

to :: Rep EtaEquality x -> EtaEquality

Show EtaEquality

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> EtaEquality -> ShowS

show :: EtaEquality -> String

showList :: [EtaEquality] -> ShowS

NFData EtaEquality

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: EtaEquality -> ()

Eq EtaEquality

Defined in Agda.TypeChecking.Monad.Base

Methods

(==) :: EtaEquality -> EtaEquality -> Bool

(/=) :: EtaEquality -> EtaEquality -> Bool

type Rep EtaEquality

Defined in Agda.TypeChecking.Monad.Base

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

newtype ProjLams

Abstractions to build projection function (dropping parameters).

Constructors

ProjLams

Fields

• getProjLams :: [Arg ArgName]

Instances

KillRange ProjLams

Defined in Agda.TypeChecking.Monad.Base

Methods

killRange :: KillRangeT ProjLams

EmbPrj ProjLams

Defined in Agda.TypeChecking.Serialise.Instances.Internal

Methods

icode :: ProjLams -> S Int32

icod_ :: ProjLams -> S Int32

value :: Int32 -> R ProjLams

Abstract ProjLams

Defined in Agda.TypeChecking.Substitute

Methods

abstract :: Telescope -> ProjLams -> ProjLams

Apply ProjLams

Defined in Agda.TypeChecking.Substitute

Methods

apply :: ProjLams -> Args -> ProjLams

applyE :: ProjLams -> Elims -> ProjLams

Null ProjLams

Defined in Agda.TypeChecking.Monad.Base

Methods

empty :: ProjLams

null :: ProjLams -> Bool

Pretty ProjLams

Defined in Agda.TypeChecking.Monad.Base

Methods

pretty :: ProjLams -> Doc

prettyPrec :: Int -> ProjLams -> Doc

prettyList :: [ProjLams] -> Doc

Data ProjLams

Defined in Agda.TypeChecking.Monad.Base

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ProjLams -> c ProjLams

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c ProjLams

toConstr :: ProjLams -> Constr

dataTypeOf :: ProjLams -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c ProjLams)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c ProjLams)

gmapT :: (forall b. Data b => b -> b) -> ProjLams -> ProjLams

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ProjLams -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ProjLams -> r

gmapQ :: (forall d. Data d => d -> u) -> ProjLams -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> ProjLams -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> ProjLams -> m ProjLams

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ProjLams -> m ProjLams

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ProjLams -> m ProjLams

Generic ProjLams

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep ProjLams :: Type -> Type

Methods

from :: ProjLams -> Rep ProjLams x

to :: Rep ProjLams x -> ProjLams

Show ProjLams

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> ProjLams -> ShowS

show :: ProjLams -> String

showList :: [ProjLams] -> ShowS

NFData ProjLams

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: ProjLams -> ()

type Rep ProjLams

Defined in Agda.TypeChecking.Monad.Base

type Rep ProjLams = D1 ('MetaData "ProjLams" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-inplace" 'True) (C1 ('MetaCons "ProjLams" 'PrefixI 'True) (S1 ('MetaSel ('Just "getProjLams") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Arg ArgName])))

data Projection

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

KillRange Projection

Defined in Agda.TypeChecking.Monad.Base

Methods

killRange :: KillRangeT Projection

EmbPrj Projection

Defined in Agda.TypeChecking.Serialise.Instances.Internal

Methods

icode :: Projection -> S Int32

icod_ :: Projection -> S Int32

value :: Int32 -> R Projection

Abstract Projection

Defined in Agda.TypeChecking.Substitute

Methods

abstract :: Telescope -> Projection -> Projection

Apply Projection

Defined in Agda.TypeChecking.Substitute

Methods

apply :: Projection -> Args -> Projection

applyE :: Projection -> Elims -> Projection

Pretty Projection

Defined in Agda.TypeChecking.Monad.Base

Methods

pretty :: Projection -> Doc

prettyPrec :: Int -> Projection -> Doc

prettyList :: [Projection] -> Doc

Data Projection

Defined in Agda.TypeChecking.Monad.Base

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Projection -> c Projection

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Projection

toConstr :: Projection -> Constr

dataTypeOf :: Projection -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Projection)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Projection)

gmapT :: (forall b. Data b => b -> b) -> Projection -> Projection

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Projection -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Projection -> r

gmapQ :: (forall d. Data d => d -> u) -> Projection -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Projection -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Projection -> m Projection

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Projection -> m Projection

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Projection -> m Projection

Generic Projection

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep Projection :: Type -> Type

Methods

from :: Projection -> Rep Projection x

to :: Rep Projection x -> Projection

Show Projection

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> Projection -> ShowS

show :: Projection -> String

showList :: [Projection] -> ShowS

NFData Projection

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: Projection -> ()

type Rep Projection

Defined in Agda.TypeChecking.Monad.Base

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

data ExtLamInfo

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

KillRange ExtLamInfo

Defined in Agda.TypeChecking.Monad.Base

Methods

killRange :: KillRangeT ExtLamInfo

InstantiateFull ExtLamInfo

Defined in Agda.TypeChecking.Reduce

Methods

instantiateFull' :: ExtLamInfo -> ReduceM ExtLamInfo

EmbPrj ExtLamInfo

Defined in Agda.TypeChecking.Serialise.Instances.Internal

Methods

icode :: ExtLamInfo -> S Int32

icod_ :: ExtLamInfo -> S Int32

value :: Int32 -> R ExtLamInfo

Apply ExtLamInfo

Defined in Agda.TypeChecking.Substitute

Methods

apply :: ExtLamInfo -> Args -> ExtLamInfo

applyE :: ExtLamInfo -> Elims -> ExtLamInfo

Data ExtLamInfo

Defined in Agda.TypeChecking.Monad.Base

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ExtLamInfo -> c ExtLamInfo

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c ExtLamInfo

toConstr :: ExtLamInfo -> Constr

dataTypeOf :: ExtLamInfo -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c ExtLamInfo)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c ExtLamInfo)

gmapT :: (forall b. Data b => b -> b) -> ExtLamInfo -> ExtLamInfo

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ExtLamInfo -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ExtLamInfo -> r

gmapQ :: (forall d. Data d => d -> u) -> ExtLamInfo -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> ExtLamInfo -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> ExtLamInfo -> m ExtLamInfo

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ExtLamInfo -> m ExtLamInfo

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ExtLamInfo -> m ExtLamInfo

Generic ExtLamInfo

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep ExtLamInfo :: Type -> Type

Methods

from :: ExtLamInfo -> Rep ExtLamInfo x

to :: Rep ExtLamInfo x -> ExtLamInfo

Show ExtLamInfo

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> ExtLamInfo -> ShowS

show :: ExtLamInfo -> String

showList :: [ExtLamInfo] -> ShowS

NFData ExtLamInfo

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: ExtLamInfo -> ()

type Rep ExtLamInfo

Defined in Agda.TypeChecking.Monad.Base

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

data System

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

KillRange System

Defined in Agda.TypeChecking.Monad.Base

Methods

killRange :: KillRangeT System

InstantiateFull System

Defined in Agda.TypeChecking.Reduce

Methods

instantiateFull' :: System -> ReduceM System

EmbPrj System

Defined in Agda.TypeChecking.Serialise.Instances.Internal

Methods

icode :: System -> S Int32

icod_ :: System -> S Int32

value :: Int32 -> R System

Abstract System

Defined in Agda.TypeChecking.Substitute

Methods

abstract :: Telescope -> System -> System

Apply System

Defined in Agda.TypeChecking.Substitute

Methods

apply :: System -> Args -> System

applyE :: System -> Elims -> System

Data System

Defined in Agda.TypeChecking.Monad.Base

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> System -> c System

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c System

toConstr :: System -> Constr

dataTypeOf :: System -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c System)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c System)

gmapT :: (forall b. Data b => b -> b) -> System -> System

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> System -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> System -> r

gmapQ :: (forall d. Data d => d -> u) -> System -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> System -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> System -> m System

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> System -> m System

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> System -> m System

Generic System

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep System :: Type -> Type

Methods

from :: System -> Rep System x

to :: Rep System x -> System

Show System

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> System -> ShowS

show :: System -> String

showList :: [System] -> ShowS

NFData System

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: System -> ()

Reify (QNamed System)

Defined in Agda.Syntax.Translation.InternalToAbstract

Associated Types

type ReifiesTo (QNamed System)

Methods

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

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

type Rep System

Defined in Agda.TypeChecking.Monad.Base

type Rep System = D1 ('MetaData "System" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-inplace" 'False) (C1 ('MetaCons "System" 'PrefixI 'True) (S1 ('MetaSel ('Just "systemTel") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Telescope) :*: S1 ('MetaSel ('Just "systemClauses") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [(Face, Term)])))

type ReifiesTo (QNamed System)

Defined in Agda.Syntax.Translation.InternalToAbstract

type ReifiesTo (QNamed System) = [Clause]

type Face = [(Term, Bool)]

type CompiledRepresentation = Map BackendName [CompilerPragma]

data CompilerPragma

The backends are responsible for parsing their own pragmas.

Constructors

CompilerPragma Range String

Instances

HasRange CompilerPragma

Defined in Agda.TypeChecking.Monad.Base

Methods

getRange :: CompilerPragma -> Range

KillRange CompiledRepresentation

Defined in Agda.TypeChecking.Monad.Base

Methods

killRange :: KillRangeT CompiledRepresentation

EmbPrj CompilerPragma

Defined in Agda.TypeChecking.Serialise.Instances.Compilers

Methods

icode :: CompilerPragma -> S Int32

icod_ :: CompilerPragma -> S Int32

value :: Int32 -> R CompilerPragma

Data CompilerPragma

Defined in Agda.TypeChecking.Monad.Base

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> CompilerPragma -> c CompilerPragma

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c CompilerPragma

toConstr :: CompilerPragma -> Constr

dataTypeOf :: CompilerPragma -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c CompilerPragma)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c CompilerPragma)

gmapT :: (forall b. Data b => b -> b) -> CompilerPragma -> CompilerPragma

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> CompilerPragma -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> CompilerPragma -> r

gmapQ :: (forall d. Data d => d -> u) -> CompilerPragma -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> CompilerPragma -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> CompilerPragma -> m CompilerPragma

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> CompilerPragma -> m CompilerPragma

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> CompilerPragma -> m CompilerPragma

Generic CompilerPragma

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep CompilerPragma :: Type -> Type

Methods

from :: CompilerPragma -> Rep CompilerPragma x

to :: Rep CompilerPragma x -> CompilerPragma

Show CompilerPragma

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> CompilerPragma -> ShowS

show :: CompilerPragma -> String

showList :: [CompilerPragma] -> ShowS

NFData CompilerPragma

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: CompilerPragma -> ()

Eq CompilerPragma

Defined in Agda.TypeChecking.Monad.Base

Methods

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

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

type Rep CompilerPragma

Defined in Agda.TypeChecking.Monad.Base

type Rep CompilerPragma = D1 ('MetaData "CompilerPragma" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-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 IsForced

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

Constructors

Forced

NotForced

Instances

KillRange IsForced

Defined in Agda.TypeChecking.Monad.Base

Methods

killRange :: KillRangeT IsForced

PrettyTCM IsForced

Defined in Agda.TypeChecking.Pretty

Methods

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

ChooseFlex IsForced

Defined in Agda.TypeChecking.Rules.LHS.Problem

Methods

chooseFlex :: IsForced -> IsForced -> FlexChoice

EmbPrj IsForced

Defined in Agda.TypeChecking.Serialise.Instances.Internal

Methods

icode :: IsForced -> S Int32

icod_ :: IsForced -> S Int32

value :: Int32 -> R IsForced

Data IsForced

Defined in Agda.TypeChecking.Monad.Base

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> IsForced -> c IsForced

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c IsForced

toConstr :: IsForced -> Constr

dataTypeOf :: IsForced -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c IsForced)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c IsForced)

gmapT :: (forall b. Data b => b -> b) -> IsForced -> IsForced

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> IsForced -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> IsForced -> r

gmapQ :: (forall d. Data d => d -> u) -> IsForced -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> IsForced -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> IsForced -> m IsForced

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> IsForced -> m IsForced

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> IsForced -> m IsForced

Generic IsForced

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep IsForced :: Type -> Type

Methods

from :: IsForced -> Rep IsForced x

to :: Rep IsForced x -> IsForced

Show IsForced

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> IsForced -> ShowS

show :: IsForced -> String

showList :: [IsForced] -> ShowS

NFData IsForced

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: IsForced -> ()

Eq IsForced

Defined in Agda.TypeChecking.Monad.Base

Methods

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

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

type Rep IsForced

Defined in Agda.TypeChecking.Monad.Base

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

data NumGeneralizableArgs

Constructors

NoGeneralizableArgs

SomeGeneralizableArgs !Int

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

Instances

KillRange NumGeneralizableArgs

Defined in Agda.TypeChecking.Monad.Base

Methods

killRange :: KillRangeT NumGeneralizableArgs

EmbPrj NumGeneralizableArgs

Defined in Agda.TypeChecking.Serialise.Instances.Internal

Methods

icode :: NumGeneralizableArgs -> S Int32

icod_ :: NumGeneralizableArgs -> S Int32

value :: Int32 -> R NumGeneralizableArgs

Abstract NumGeneralizableArgs

Defined in Agda.TypeChecking.Substitute

Methods

abstract :: Telescope -> NumGeneralizableArgs -> NumGeneralizableArgs

Apply NumGeneralizableArgs

Defined in Agda.TypeChecking.Substitute

Methods

apply :: NumGeneralizableArgs -> Args -> NumGeneralizableArgs

applyE :: NumGeneralizableArgs -> Elims -> NumGeneralizableArgs

Data NumGeneralizableArgs

Defined in Agda.TypeChecking.Monad.Base

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> NumGeneralizableArgs -> c NumGeneralizableArgs

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c NumGeneralizableArgs

toConstr :: NumGeneralizableArgs -> Constr

dataTypeOf :: NumGeneralizableArgs -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c NumGeneralizableArgs)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c NumGeneralizableArgs)

gmapT :: (forall b. Data b => b -> b) -> NumGeneralizableArgs -> NumGeneralizableArgs

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> NumGeneralizableArgs -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> NumGeneralizableArgs -> r

gmapQ :: (forall d. Data d => d -> u) -> NumGeneralizableArgs -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> NumGeneralizableArgs -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> NumGeneralizableArgs -> m NumGeneralizableArgs

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> NumGeneralizableArgs -> m NumGeneralizableArgs

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> NumGeneralizableArgs -> m NumGeneralizableArgs

Show NumGeneralizableArgs

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> NumGeneralizableArgs -> ShowS

show :: NumGeneralizableArgs -> String

showList :: [NumGeneralizableArgs] -> ShowS

NFData NumGeneralizableArgs

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: NumGeneralizableArgs -> ()

data Definition

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

  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

LensArgInfo Definition

Defined in Agda.TypeChecking.Monad.Base

Methods

getArgInfo :: Definition -> ArgInfo

setArgInfo :: ArgInfo -> Definition -> Definition

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

LensModality Definition

Defined in Agda.TypeChecking.Monad.Base

Methods

getModality :: Definition -> Modality

setModality :: Modality -> Definition -> Definition

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

LensQuantity Definition

Defined in Agda.TypeChecking.Monad.Base

Methods

getQuantity :: Definition -> Quantity

setQuantity :: Quantity -> Definition -> Definition

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

LensRelevance Definition

Defined in Agda.TypeChecking.Monad.Base

Methods

getRelevance :: Definition -> Relevance

setRelevance :: Relevance -> Definition -> Definition

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

NamesIn Definition

Defined in Agda.Syntax.Internal.Names

Methods

namesIn' :: Monoid m => (QName -> m) -> Definition -> m

KillRange Definition

Defined in Agda.TypeChecking.Monad.Base

Methods

killRange :: KillRangeT Definition

KillRange Definitions

Defined in Agda.TypeChecking.Monad.Base

Methods

killRange :: KillRangeT Definitions

InstantiateFull Definition

Defined in Agda.TypeChecking.Reduce

Methods

instantiateFull' :: Definition -> ReduceM Definition

EmbPrj Definition

Defined in Agda.TypeChecking.Serialise.Instances.Internal

Methods

icode :: Definition -> S Int32

icod_ :: Definition -> S Int32

value :: Int32 -> R Definition

Abstract Definition

Defined in Agda.TypeChecking.Substitute

Methods

abstract :: Telescope -> Definition -> Definition

Apply Definition

Defined in Agda.TypeChecking.Substitute

Methods

apply :: Definition -> Args -> Definition

applyE :: Definition -> Elims -> Definition

Pretty Definition

Defined in Agda.TypeChecking.Monad.Base

Methods

pretty :: Definition -> Doc

prettyPrec :: Int -> Definition -> Doc

prettyList :: [Definition] -> Doc

Generic Definition

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep Definition :: Type -> Type

Methods

from :: Definition -> Rep Definition x

to :: Rep Definition x -> Definition

Show Definition

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> Definition -> ShowS

show :: Definition -> String

showList :: [Definition] -> ShowS

NFData Definition

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: Definition -> ()

type Rep Definition

Defined in Agda.TypeChecking.Monad.Base

type Rep Definition = D1 ('MetaData "Definition" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-inplace" 'False) (C1 ('MetaCons "Defn" 'PrefixI 'True) ((((S1 ('MetaSel ('Just "defArgInfo") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ArgInfo) :*: S1 ('MetaSel ('Just "defName") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName)) :*: (S1 ('MetaSel ('Just "defType") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type) :*: S1 ('MetaSel ('Just "defPolarity") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Polarity]))) :*: ((S1 ('MetaSel ('Just "defArgOccurrences") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Occurrence]) :*: S1 ('MetaSel ('Just "defArgGeneralizable") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 NumGeneralizableArgs)) :*: (S1 ('MetaSel ('Just "defGeneralizedParams") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Maybe Name]) :*: (S1 ('MetaSel ('Just "defDisplay") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [LocalDisplayForm]) :*: S1 ('MetaSel ('Just "defMutual") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 MutualId))))) :*: (((S1 ('MetaSel ('Just "defCompiledRep") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 CompiledRepresentation) :*: S1 ('MetaSel ('Just "defInstance") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe QName))) :*: (S1 ('MetaSel ('Just "defCopy") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool) :*: (S1 ('MetaSel ('Just "defMatchable") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Set QName)) :*: S1 ('MetaSel ('Just "defNoCompilation") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool)))) :*: ((S1 ('MetaSel ('Just "defInjective") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool) :*: S1 ('MetaSel ('Just "defCopatternLHS") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool)) :*: (S1 ('MetaSel ('Just "defBlocked") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Blocked_) :*: (S1 ('MetaSel ('Just "defLanguage") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Language) :*: S1 ('MetaSel ('Just "theDef") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Defn)))))))

data RewriteRule

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

KillRange RewriteRule

Defined in Agda.TypeChecking.Monad.Base

Methods

killRange :: KillRangeT RewriteRule

KillRange RewriteRuleMap

Defined in Agda.TypeChecking.Monad.Base

Methods

killRange :: KillRangeT RewriteRuleMap

PrettyTCM RewriteRule

Defined in Agda.TypeChecking.Pretty

Methods

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

InstantiateFull RewriteRule

Defined in Agda.TypeChecking.Reduce

Methods

instantiateFull' :: RewriteRule -> ReduceM RewriteRule

GetMatchables RewriteRule

Defined in Agda.TypeChecking.Rewriting.NonLinPattern

Methods

getMatchables :: RewriteRule -> [QName]

EmbPrj RewriteRule

Defined in Agda.TypeChecking.Serialise.Instances.Internal

Methods

icode :: RewriteRule -> S Int32

icod_ :: RewriteRule -> S Int32

value :: Int32 -> R RewriteRule

Abstract RewriteRule

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

Defined in Agda.TypeChecking.Substitute

Methods

abstract :: Telescope -> RewriteRule -> RewriteRule

Apply RewriteRule

Defined in Agda.TypeChecking.Substitute

Methods

apply :: RewriteRule -> Args -> RewriteRule

applyE :: RewriteRule -> Elims -> RewriteRule

Subst RewriteRule

Defined in Agda.TypeChecking.Substitute

Associated Types

type SubstArg RewriteRule

Methods

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

Data RewriteRule

Defined in Agda.TypeChecking.Monad.Base

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> RewriteRule -> c RewriteRule

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c RewriteRule

toConstr :: RewriteRule -> Constr

dataTypeOf :: RewriteRule -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c RewriteRule)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c RewriteRule)

gmapT :: (forall b. Data b => b -> b) -> RewriteRule -> RewriteRule

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> RewriteRule -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> RewriteRule -> r

gmapQ :: (forall d. Data d => d -> u) -> RewriteRule -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> RewriteRule -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> RewriteRule -> m RewriteRule

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> RewriteRule -> m RewriteRule

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> RewriteRule -> m RewriteRule

Generic RewriteRule

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep RewriteRule :: Type -> Type

Methods

from :: RewriteRule -> Rep RewriteRule x

to :: Rep RewriteRule x -> RewriteRule

Show RewriteRule

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> RewriteRule -> ShowS

show :: RewriteRule -> String

showList :: [RewriteRule] -> ShowS

NFData RewriteRule

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: RewriteRule -> ()

type SubstArg RewriteRule

Defined in Agda.TypeChecking.Substitute

type SubstArg RewriteRule = NLPat

type Rep RewriteRule

Defined in Agda.TypeChecking.Monad.Base

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

type RewriteRules = [RewriteRule]

data NLPSort

Constructors

PType NLPat

PProp NLPat

PInf IsFibrant Integer

PSizeUniv

PLockUniv

Instances

KillRange NLPSort

Defined in Agda.TypeChecking.Monad.Base

Methods

killRange :: KillRangeT NLPSort

Free NLPSort

Defined in Agda.TypeChecking.Rewriting.NonLinPattern

Methods

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

PrettyTCM NLPSort

Defined in Agda.TypeChecking.Pretty

Methods

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

InstantiateFull NLPSort

Defined in Agda.TypeChecking.Reduce

Methods

instantiateFull' :: NLPSort -> ReduceM NLPSort

GetMatchables NLPSort

Defined in Agda.TypeChecking.Rewriting.NonLinPattern

Methods

getMatchables :: NLPSort -> [QName]

NLPatVars NLPSort

Defined in Agda.TypeChecking.Rewriting.NonLinPattern

Methods

nlPatVarsUnder :: Int -> NLPSort -> IntSet

nlPatVars :: NLPSort -> IntSet

EmbPrj NLPSort

Defined in Agda.TypeChecking.Serialise.Instances.Internal

Methods

icode :: NLPSort -> S Int32

icod_ :: NLPSort -> S Int32

value :: Int32 -> R NLPSort

Subst NLPSort

Defined in Agda.TypeChecking.Substitute

Associated Types

type SubstArg NLPSort

Methods

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

Data NLPSort

Defined in Agda.TypeChecking.Monad.Base

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> NLPSort -> c NLPSort

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c NLPSort

toConstr :: NLPSort -> Constr

dataTypeOf :: NLPSort -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c NLPSort)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c NLPSort)

gmapT :: (forall b. Data b => b -> b) -> NLPSort -> NLPSort

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> NLPSort -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> NLPSort -> r

gmapQ :: (forall d. Data d => d -> u) -> NLPSort -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> NLPSort -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> NLPSort -> m NLPSort

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> NLPSort -> m NLPSort

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> NLPSort -> m NLPSort

Generic NLPSort

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep NLPSort :: Type -> Type

Methods

from :: NLPSort -> Rep NLPSort x

to :: Rep NLPSort x -> NLPSort

Show NLPSort

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> NLPSort -> ShowS

show :: NLPSort -> String

showList :: [NLPSort] -> ShowS

NFData NLPSort

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: NLPSort -> ()

NLPatToTerm NLPSort Sort

Defined in Agda.TypeChecking.Rewriting.NonLinPattern

Methods

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

Match () NLPSort Sort

Defined in Agda.TypeChecking.Rewriting.NonLinMatch

Methods

match :: Relevance -> Telescope -> Telescope -> () -> NLPSort -> Sort -> NLM ()

PatternFrom () Sort NLPSort

Defined in Agda.TypeChecking.Rewriting.NonLinPattern

Methods

patternFrom :: Relevance -> Int -> () -> Sort -> TCM NLPSort

type SubstArg NLPSort

Defined in Agda.TypeChecking.Substitute

type SubstArg NLPSort = NLPat

type Rep NLPSort

Defined in Agda.TypeChecking.Monad.Base

type Rep NLPSort = D1 ('MetaData "NLPSort" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-inplace" 'False) ((C1 ('MetaCons "PType" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 NLPat)) :+: C1 ('MetaCons "PProp" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 NLPat))) :+: (C1 ('MetaCons "PInf" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 IsFibrant) :*: 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))))

data NLPType

Constructors

NLPType

Fields

• nlpTypeSort :: NLPSort
• nlpTypeUnEl :: NLPat

Instances

KillRange NLPType

Defined in Agda.TypeChecking.Monad.Base

Methods

killRange :: KillRangeT NLPType

Free NLPType

Defined in Agda.TypeChecking.Rewriting.NonLinPattern

Methods

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

PrettyTCM NLPType

Defined in Agda.TypeChecking.Pretty

Methods

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

InstantiateFull NLPType

Defined in Agda.TypeChecking.Reduce

Methods

instantiateFull' :: NLPType -> ReduceM NLPType

GetMatchables NLPType

Defined in Agda.TypeChecking.Rewriting.NonLinPattern

Methods

getMatchables :: NLPType -> [QName]

NLPatVars NLPType

Defined in Agda.TypeChecking.Rewriting.NonLinPattern

Methods

nlPatVarsUnder :: Int -> NLPType -> IntSet

nlPatVars :: NLPType -> IntSet

EmbPrj NLPType

Defined in Agda.TypeChecking.Serialise.Instances.Internal

Methods

icode :: NLPType -> S Int32

icod_ :: NLPType -> S Int32

value :: Int32 -> R NLPType

Subst NLPType

Defined in Agda.TypeChecking.Substitute

Associated Types

type SubstArg NLPType

Methods

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

Data NLPType

Defined in Agda.TypeChecking.Monad.Base

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> NLPType -> c NLPType

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c NLPType

toConstr :: NLPType -> Constr

dataTypeOf :: NLPType -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c NLPType)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c NLPType)

gmapT :: (forall b. Data b => b -> b) -> NLPType -> NLPType

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> NLPType -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> NLPType -> r

gmapQ :: (forall d. Data d => d -> u) -> NLPType -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> NLPType -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> NLPType -> m NLPType

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> NLPType -> m NLPType

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> NLPType -> m NLPType

Generic NLPType

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep NLPType :: Type -> Type

Methods

from :: NLPType -> Rep NLPType x

to :: Rep NLPType x -> NLPType

Show NLPType

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> NLPType -> ShowS

show :: NLPType -> String

showList :: [NLPType] -> ShowS

NFData NLPType

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: NLPType -> ()

NLPatToTerm NLPType Type

Defined in Agda.TypeChecking.Rewriting.NonLinPattern

Methods

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

Match () NLPType Type

Defined in Agda.TypeChecking.Rewriting.NonLinMatch

Methods

match :: Relevance -> Telescope -> Telescope -> () -> NLPType -> Type -> NLM ()

PatternFrom () Type NLPType

Defined in Agda.TypeChecking.Rewriting.NonLinPattern

Methods

patternFrom :: Relevance -> Int -> () -> Type -> TCM NLPType

type SubstArg NLPType

Defined in Agda.TypeChecking.Substitute

type SubstArg NLPType = NLPat

type Rep NLPType

Defined in Agda.TypeChecking.Monad.Base

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

type PElims = [Elim' NLPat]

data NLPat

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

KillRange NLPat

Defined in Agda.TypeChecking.Monad.Base

Methods

killRange :: KillRangeT NLPat

Free NLPat

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

Defined in Agda.TypeChecking.Rewriting.NonLinPattern

Methods

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

PrettyTCM NLPat

Defined in Agda.TypeChecking.Pretty

Methods

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

InstantiateFull NLPat

Defined in Agda.TypeChecking.Reduce

Methods

instantiateFull' :: NLPat -> ReduceM NLPat

GetMatchables NLPat

Defined in Agda.TypeChecking.Rewriting.NonLinPattern

Methods

getMatchables :: NLPat -> [QName]

NLPatVars NLPat

Defined in Agda.TypeChecking.Rewriting.NonLinPattern

Methods

nlPatVarsUnder :: Int -> NLPat -> IntSet

nlPatVars :: NLPat -> IntSet

EmbPrj NLPat

Defined in Agda.TypeChecking.Serialise.Instances.Internal

Methods

icode :: NLPat -> S Int32

icod_ :: NLPat -> S Int32

value :: Int32 -> R NLPat

Subst NLPat

Defined in Agda.TypeChecking.Substitute

Associated Types

type SubstArg NLPat

Methods

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

DeBruijn NLPat

Defined in Agda.TypeChecking.Substitute

Methods

deBruijnVar :: Int -> NLPat

debruijnNamedVar :: String -> Int -> NLPat

deBruijnView :: NLPat -> Maybe Int

Data NLPat

Defined in Agda.TypeChecking.Monad.Base

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> NLPat -> c NLPat

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c NLPat

toConstr :: NLPat -> Constr

dataTypeOf :: NLPat -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c NLPat)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c NLPat)

gmapT :: (forall b. Data b => b -> b) -> NLPat -> NLPat

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> NLPat -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> NLPat -> r

gmapQ :: (forall d. Data d => d -> u) -> NLPat -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> NLPat -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> NLPat -> m NLPat

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> NLPat -> m NLPat

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> NLPat -> m NLPat

Generic NLPat

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep NLPat :: Type -> Type

Methods

from :: NLPat -> Rep NLPat x

to :: Rep NLPat x -> NLPat

Show NLPat

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> NLPat -> ShowS

show :: NLPat -> String

showList :: [NLPat] -> ShowS

NFData NLPat

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: NLPat -> ()

NLPatToTerm NLPat Level

Defined in Agda.TypeChecking.Rewriting.NonLinPattern

Methods

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

NLPatToTerm NLPat Term

Defined in Agda.TypeChecking.Rewriting.NonLinPattern

Methods

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

Match Type NLPat Term

Defined in Agda.TypeChecking.Rewriting.NonLinMatch

Methods

match :: Relevance -> Telescope -> Telescope -> Type -> NLPat -> Term -> NLM ()

Match () NLPat Level

Defined in Agda.TypeChecking.Rewriting.NonLinMatch

Methods

match :: Relevance -> Telescope -> Telescope -> () -> NLPat -> Level -> NLM ()

PatternFrom Type Term NLPat

Defined in Agda.TypeChecking.Rewriting.NonLinPattern

Methods

patternFrom :: Relevance -> Int -> Type -> Term -> TCM NLPat

PatternFrom () Level NLPat

Defined in Agda.TypeChecking.Rewriting.NonLinPattern

Methods

patternFrom :: Relevance -> Int -> () -> Level -> TCM NLPat

PrettyTCM (Type' NLPat)

Defined in Agda.TypeChecking.Pretty

Methods

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

PrettyTCM (Elim' NLPat)

Defined in Agda.TypeChecking.Pretty

Methods

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

ToNLPat (Arg DeBruijnPattern) (Elim' NLPat)

Defined in Agda.TypeChecking.Rewriting.Clause

Methods

toNLPat :: Arg DeBruijnPattern -> Elim' NLPat

ToNLPat (NamedArg DeBruijnPattern) (Elim' NLPat)

Defined in Agda.TypeChecking.Rewriting.Clause

Methods

toNLPat :: NamedArg DeBruijnPattern -> Elim' NLPat

PatternFrom (Type, Term) Elims [Elim' NLPat]

Defined in Agda.TypeChecking.Rewriting.NonLinPattern

Methods

patternFrom :: Relevance -> Int -> (Type, Term) -> Elims -> TCM [Elim' NLPat]

Match (Type, Elims -> Term) [Elim' NLPat] Elims

Defined in Agda.TypeChecking.Rewriting.NonLinMatch

Methods

match :: Relevance -> Telescope -> Telescope -> (Type, Elims -> Term) -> [Elim' NLPat] -> Elims -> NLM ()

type SubstArg NLPat

Defined in Agda.TypeChecking.Substitute

type SubstArg NLPat = NLPat

type Rep NLPat

Defined in Agda.TypeChecking.Monad.Base

type Rep NLPat = D1 ('MetaData "NLPat" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-inplace" 'False) ((C1 ('MetaCons "PVar" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Int) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Arg Int])) :+: (C1 ('MetaCons "PDef" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 PElims)) :+: C1 ('MetaCons "PLam" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ArgInfo) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Abs NLPat))))) :+: ((C1 ('MetaCons "PPi" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Dom NLPType)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Abs NLPType))) :+: C1 ('MetaCons "PSort" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 NLPSort))) :+: (C1 ('MetaCons "PBoundVar" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'SourceUnpack 'SourceStrict 'DecidedStrict) (Rec0 Int) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 PElims)) :+: C1 ('MetaCons "PTerm" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term)))))

data DisplayTerm

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 DisplayTerms 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

.v.

DTerm Term

v.

Instances

NamesIn DisplayTerm

Defined in Agda.Syntax.Internal.Names

Methods

namesIn' :: Monoid m => (QName -> m) -> DisplayTerm -> m

KillRange DisplayTerm

Defined in Agda.TypeChecking.Monad.Base

Methods

killRange :: KillRangeT DisplayTerm

Reify DisplayTerm

Defined in Agda.Syntax.Translation.InternalToAbstract

Associated Types

type ReifiesTo DisplayTerm

Methods

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

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

Free DisplayTerm

Defined in Agda.TypeChecking.Monad.Base

Methods

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

PrettyTCM DisplayTerm

Defined in Agda.TypeChecking.Pretty

Methods

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

InstantiateFull DisplayTerm

Defined in Agda.TypeChecking.Reduce

Methods

instantiateFull' :: DisplayTerm -> ReduceM DisplayTerm

EmbPrj DisplayTerm

Defined in Agda.TypeChecking.Serialise.Instances.Internal

Methods

icode :: DisplayTerm -> S Int32

icod_ :: DisplayTerm -> S Int32

value :: Int32 -> R DisplayTerm

Apply DisplayTerm

Defined in Agda.TypeChecking.Substitute

Methods

apply :: DisplayTerm -> Args -> DisplayTerm

applyE :: DisplayTerm -> Elims -> DisplayTerm

Subst DisplayTerm

Defined in Agda.TypeChecking.Substitute

Associated Types

type SubstArg DisplayTerm

Methods

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

Pretty DisplayTerm

Defined in Agda.TypeChecking.Monad.Base

Methods

pretty :: DisplayTerm -> Doc

prettyPrec :: Int -> DisplayTerm -> Doc

prettyList :: [DisplayTerm] -> Doc

Data DisplayTerm

Defined in Agda.TypeChecking.Monad.Base

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> DisplayTerm -> c DisplayTerm

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c DisplayTerm

toConstr :: DisplayTerm -> Constr

dataTypeOf :: DisplayTerm -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c DisplayTerm)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c DisplayTerm)

gmapT :: (forall b. Data b => b -> b) -> DisplayTerm -> DisplayTerm

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> DisplayTerm -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> DisplayTerm -> r

gmapQ :: (forall d. Data d => d -> u) -> DisplayTerm -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> DisplayTerm -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> DisplayTerm -> m DisplayTerm

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> DisplayTerm -> m DisplayTerm

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> DisplayTerm -> m DisplayTerm

Generic DisplayTerm

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep DisplayTerm :: Type -> Type

Methods

from :: DisplayTerm -> Rep DisplayTerm x

to :: Rep DisplayTerm x -> DisplayTerm

Show DisplayTerm

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> DisplayTerm -> ShowS

show :: DisplayTerm -> String

showList :: [DisplayTerm] -> ShowS

NFData DisplayTerm

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: DisplayTerm -> ()

PrettyTCM (Elim' DisplayTerm)

Defined in Agda.TypeChecking.Pretty

Methods

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

type ReifiesTo DisplayTerm

Defined in Agda.Syntax.Translation.InternalToAbstract

type ReifiesTo DisplayTerm = Expr

type SubstArg DisplayTerm

Defined in Agda.TypeChecking.Substitute

type SubstArg DisplayTerm = Term

type Rep DisplayTerm

Defined in Agda.TypeChecking.Monad.Base

type Rep DisplayTerm = D1 ('MetaData "DisplayTerm" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-inplace" 'False) ((C1 ('MetaCons "DWithApp" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 DisplayTerm) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [DisplayTerm]) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Elims))) :+: C1 ('MetaCons "DCon" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ConHead) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ConInfo) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Arg DisplayTerm])))) :+: (C1 ('MetaCons "DDef" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Elim' DisplayTerm])) :+: (C1 ('MetaCons "DDot" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term)) :+: C1 ('MetaCons "DTerm" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term)))))

type LocalDisplayForm = Open DisplayForm

data DisplayForm

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

NamesIn DisplayForm

Defined in Agda.Syntax.Internal.Names

Methods

namesIn' :: Monoid m => (QName -> m) -> DisplayForm -> m

KillRange DisplayForm

Defined in Agda.TypeChecking.Monad.Base

Methods

killRange :: KillRangeT DisplayForm

Free DisplayForm

Defined in Agda.TypeChecking.Monad.Base

Methods

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

InstantiateFull DisplayForm

Defined in Agda.TypeChecking.Reduce

Methods

instantiateFull' :: DisplayForm -> ReduceM DisplayForm

Normalise DisplayForm

Defined in Agda.TypeChecking.Reduce

Methods

normalise' :: DisplayForm -> ReduceM DisplayForm

Simplify DisplayForm

Defined in Agda.TypeChecking.Reduce

Methods

simplify' :: DisplayForm -> ReduceM DisplayForm

EmbPrj DisplayForm

Defined in Agda.TypeChecking.Serialise.Instances.Internal

Methods

icode :: DisplayForm -> S Int32

icod_ :: DisplayForm -> S Int32

value :: Int32 -> R DisplayForm

Subst DisplayForm

Defined in Agda.TypeChecking.Substitute

Associated Types

type SubstArg DisplayForm

Methods

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

Pretty DisplayForm

Defined in Agda.TypeChecking.Monad.Base

Methods

pretty :: DisplayForm -> Doc

prettyPrec :: Int -> DisplayForm -> Doc

prettyList :: [DisplayForm] -> Doc

Data DisplayForm

Defined in Agda.TypeChecking.Monad.Base

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> DisplayForm -> c DisplayForm

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c DisplayForm

toConstr :: DisplayForm -> Constr

dataTypeOf :: DisplayForm -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c DisplayForm)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c DisplayForm)

gmapT :: (forall b. Data b => b -> b) -> DisplayForm -> DisplayForm

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> DisplayForm -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> DisplayForm -> r

gmapQ :: (forall d. Data d => d -> u) -> DisplayForm -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> DisplayForm -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> DisplayForm -> m DisplayForm

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> DisplayForm -> m DisplayForm

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> DisplayForm -> m DisplayForm

Generic DisplayForm

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep DisplayForm :: Type -> Type

Methods

from :: DisplayForm -> Rep DisplayForm x

to :: Rep DisplayForm x -> DisplayForm

Show DisplayForm

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> DisplayForm -> ShowS

show :: DisplayForm -> String

showList :: [DisplayForm] -> ShowS

NFData DisplayForm

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: DisplayForm -> ()

type SubstArg DisplayForm

Defined in Agda.TypeChecking.Substitute

type SubstArg DisplayForm = Term

type Rep DisplayForm

Defined in Agda.TypeChecking.Monad.Base

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

newtype Section

Constructors

Section

Fields

• _secTelescope :: Telescope

Instances

KillRange Section

Defined in Agda.TypeChecking.Monad.Base

Methods

killRange :: KillRangeT Section

KillRange Sections

Defined in Agda.TypeChecking.Monad.Base

Methods

killRange :: KillRangeT Sections

InstantiateFull Section

Defined in Agda.TypeChecking.Reduce

Methods

instantiateFull' :: Section -> ReduceM Section

EmbPrj Section

Defined in Agda.TypeChecking.Serialise.Instances.Internal

Methods

icode :: Section -> S Int32

icod_ :: Section -> S Int32

value :: Int32 -> R Section

Pretty Section

Defined in Agda.TypeChecking.Monad.Base

Methods

pretty :: Section -> Doc

prettyPrec :: Int -> Section -> Doc

prettyList :: [Section] -> Doc

Data Section

Defined in Agda.TypeChecking.Monad.Base

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Section -> c Section

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Section

toConstr :: Section -> Constr

dataTypeOf :: Section -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Section)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Section)

gmapT :: (forall b. Data b => b -> b) -> Section -> Section

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Section -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Section -> r

gmapQ :: (forall d. Data d => d -> u) -> Section -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Section -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Section -> m Section

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Section -> m Section

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Section -> m Section

Show Section

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> Section -> ShowS

show :: Section -> String

showList :: [Section] -> ShowS

NFData Section

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: Section -> ()

Eq Section

Defined in Agda.TypeChecking.Substitute

Methods

(==) :: Section -> Section -> Bool

(/=) :: Section -> Section -> Bool

type DisplayForms = HashMap QName [LocalDisplayForm]

type RewriteRuleMap = HashMap QName RewriteRules

type Definitions = HashMap QName Definition

type Sections = Map ModuleName Section

data Signature

Constructors

Sig

Fields

• _sigSections :: Sections
• _sigDefinitions :: Definitions
• _sigRewriteRules :: RewriteRuleMap

  The rewrite rules defined in this file.

Instances

KillRange Signature

Defined in Agda.TypeChecking.Monad.Base

Methods

killRange :: KillRangeT Signature

InstantiateFull Signature

Defined in Agda.TypeChecking.Reduce

Methods

instantiateFull' :: Signature -> ReduceM Signature

EmbPrj Signature

Defined in Agda.TypeChecking.Serialise.Instances.Internal

Methods

icode :: Signature -> S Int32

icod_ :: Signature -> S Int32

value :: Int32 -> R Signature

Generic Signature

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep Signature :: Type -> Type

Methods

from :: Signature -> Rep Signature x

to :: Rep Signature x -> Signature

Show Signature

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> Signature -> ShowS

show :: Signature -> String

showList :: [Signature] -> ShowS

NFData Signature

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: Signature -> ()

type Rep Signature

Defined in Agda.TypeChecking.Monad.Base

type Rep Signature = D1 ('MetaData "Signature" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-inplace" 'False) (C1 ('MetaCons "Sig" 'PrefixI 'True) (S1 ('MetaSel ('Just "_sigSections") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Sections) :*: (S1 ('MetaSel ('Just "_sigDefinitions") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Definitions) :*: S1 ('MetaSel ('Just "_sigRewriteRules") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 RewriteRuleMap))))

data IPClause

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.

• ipcBoundary :: [Closure IPBoundary]

  The boundary imposed by the LHS.

IPNoClause

The interaction point is not in the rhs of a clause.

Instances

Generic IPClause

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep IPClause :: Type -> Type

Methods

from :: IPClause -> Rep IPClause x

to :: Rep IPClause x -> IPClause

NFData IPClause

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: IPClause -> ()

Eq IPClause

Defined in Agda.TypeChecking.Monad.Base

Methods

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

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

type Rep IPClause

Defined in Agda.TypeChecking.Monad.Base

type Rep IPClause = D1 ('MetaData "IPClause" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-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 ())) :*: S1 ('MetaSel ('Just "ipcBoundary") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Closure IPBoundary])))) :+: C1 ('MetaCons "IPNoClause" 'PrefixI 'False) (U1 :: Type -> Type))

type IPBoundary = IPBoundary' Term

data IPBoundary' t

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

Constructors

IPBoundary

Fields

• ipbEquations :: [(t, t)]

  x_0 = u_0, ... ,x_n = u_n

• ipbValue :: t

  t

• ipbMetaApp :: t

  ?n es

• ipbOverapplied :: Overapplied

  Is ?n overapplied in ?n es ?

Instances

Foldable IPBoundary'

Defined in Agda.TypeChecking.Monad.Base

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'

Defined in Agda.TypeChecking.Monad.Base

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'

Defined in Agda.TypeChecking.Monad.Base

Methods

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

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

ToConcrete a => ToConcrete (IPBoundary' a)

Defined in Agda.Interaction.BasicOps

Associated Types

type ConOfAbs (IPBoundary' a)

Methods

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

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

Reify a => Reify (IPBoundary' a)

Defined in Agda.Interaction.BasicOps

Associated Types

type ReifiesTo (IPBoundary' a)

Methods

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

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

Instantiate t => Instantiate (IPBoundary' t)

Defined in Agda.TypeChecking.Reduce

Methods

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

InstantiateFull t => InstantiateFull (IPBoundary' t)

Defined in Agda.TypeChecking.Reduce

Methods

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

Normalise t => Normalise (IPBoundary' t)

Defined in Agda.TypeChecking.Reduce

Methods

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

Reduce t => Reduce (IPBoundary' t)

Defined in Agda.TypeChecking.Reduce

Methods

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

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

Simplify t => Simplify (IPBoundary' t)

Defined in Agda.TypeChecking.Reduce

Methods

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

Pretty c => Pretty (IPBoundary' c)

Defined in Agda.Interaction.BasicOps

Methods

pretty :: IPBoundary' c -> Doc

prettyPrec :: Int -> IPBoundary' c -> Doc

prettyList :: [IPBoundary' c] -> Doc

Data t => Data (IPBoundary' t)

Defined in Agda.TypeChecking.Monad.Base

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> IPBoundary' t -> c (IPBoundary' t)

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (IPBoundary' t)

toConstr :: IPBoundary' t -> Constr

dataTypeOf :: IPBoundary' t -> DataType

dataCast1 :: Typeable t0 => (forall d. Data d => c (t0 d)) -> Maybe (c (IPBoundary' t))

dataCast2 :: Typeable t0 => (forall d e. (Data d, Data e) => c (t0 d e)) -> Maybe (c (IPBoundary' t))

gmapT :: (forall b. Data b => b -> b) -> IPBoundary' t -> IPBoundary' t

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> IPBoundary' t -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> IPBoundary' t -> r

gmapQ :: (forall d. Data d => d -> u) -> IPBoundary' t -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> IPBoundary' t -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> IPBoundary' t -> m (IPBoundary' t)

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> IPBoundary' t -> m (IPBoundary' t)

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> IPBoundary' t -> m (IPBoundary' t)

Generic (IPBoundary' t)

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep (IPBoundary' t) :: Type -> Type

Methods

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

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

Show t => Show (IPBoundary' t)

Defined in Agda.TypeChecking.Monad.Base

Methods

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

show :: IPBoundary' t -> String

showList :: [IPBoundary' t] -> ShowS

NFData t => NFData (IPBoundary' t)

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: IPBoundary' t -> ()

type ConOfAbs (IPBoundary' a)

Defined in Agda.Interaction.BasicOps

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

type ReifiesTo (IPBoundary' a)

Defined in Agda.Interaction.BasicOps

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

type Rep (IPBoundary' t)

Defined in Agda.TypeChecking.Monad.Base

type Rep (IPBoundary' t) = D1 ('MetaData "IPBoundary'" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-inplace" 'False) (C1 ('MetaCons "IPBoundary" 'PrefixI 'True) ((S1 ('MetaSel ('Just "ipbEquations") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [(t, t)]) :*: S1 ('MetaSel ('Just "ipbValue") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 t)) :*: (S1 ('MetaSel ('Just "ipbMetaApp") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 t) :*: S1 ('MetaSel ('Just "ipbOverapplied") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Overapplied))))

data Overapplied

Flag to indicate whether the meta is overapplied in the constraint. A meta is overapplied if it has more arguments than the size of the telescope in its creation environment (as stored in MetaInfo).

Constructors

Overapplied

NotOverapplied

Instances

Data Overapplied

Defined in Agda.TypeChecking.Monad.Base

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Overapplied -> c Overapplied

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Overapplied

toConstr :: Overapplied -> Constr

dataTypeOf :: Overapplied -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Overapplied)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Overapplied)

gmapT :: (forall b. Data b => b -> b) -> Overapplied -> Overapplied

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Overapplied -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Overapplied -> r

gmapQ :: (forall d. Data d => d -> u) -> Overapplied -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Overapplied -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Overapplied -> m Overapplied

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Overapplied -> m Overapplied

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Overapplied -> m Overapplied

Generic Overapplied

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep Overapplied :: Type -> Type

Methods

from :: Overapplied -> Rep Overapplied x

to :: Rep Overapplied x -> Overapplied

Show Overapplied

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> Overapplied -> ShowS

show :: Overapplied -> String

showList :: [Overapplied] -> ShowS

NFData Overapplied

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: Overapplied -> ()

Eq Overapplied

Defined in Agda.TypeChecking.Monad.Base

Methods

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

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

type Rep Overapplied

Defined in Agda.TypeChecking.Monad.Base

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

type InteractionPoints = BiMap InteractionId InteractionPoint

Data structure managing the interaction points.

We never remove interaction points from this map, only set their ipSolved to True. (Issue #2368)

data InteractionPoint

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.

Instances

HasTag InteractionPoint

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Tag InteractionPoint

Methods

tag :: InteractionPoint -> Maybe (Tag InteractionPoint)

Generic InteractionPoint

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep InteractionPoint :: Type -> Type

Methods

from :: InteractionPoint -> Rep InteractionPoint x

to :: Rep InteractionPoint x -> InteractionPoint

NFData InteractionPoint

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: InteractionPoint -> ()

NFData InteractionPoints

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: InteractionPoints -> ()

Eq InteractionPoint

Defined in Agda.TypeChecking.Monad.Base

Methods

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

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

type Tag InteractionPoint

Defined in Agda.TypeChecking.Monad.Base

type Tag InteractionPoint = MetaId

type Rep InteractionPoint

Defined in Agda.TypeChecking.Monad.Base

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

type MetaStore = IntMap MetaVariable

type MetaNameSuggestion = String

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

data MetaInfo

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

LensIsAbstract MetaInfo

Defined in Agda.TypeChecking.Monad.Base

Methods

lensIsAbstract :: Lens' IsAbstract MetaInfo

LensModality MetaInfo

Defined in Agda.TypeChecking.Monad.Base

Methods

getModality :: MetaInfo -> Modality

setModality :: Modality -> MetaInfo -> MetaInfo

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

LensQuantity MetaInfo

Defined in Agda.TypeChecking.Monad.Base

Methods

getQuantity :: MetaInfo -> Quantity

setQuantity :: Quantity -> MetaInfo -> MetaInfo

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

HasRange MetaInfo

Defined in Agda.TypeChecking.Monad.Base

Methods

getRange :: MetaInfo -> Range

SetRange MetaInfo

Defined in Agda.TypeChecking.Monad.Base

Methods

setRange :: Range -> MetaInfo -> MetaInfo

Generic MetaInfo

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep MetaInfo :: Type -> Type

Methods

from :: MetaInfo -> Rep MetaInfo x

to :: Rep MetaInfo x -> MetaInfo

NFData MetaInfo

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: MetaInfo -> ()

LensClosure Range MetaInfo

Defined in Agda.TypeChecking.Monad.Base

Methods

lensClosure :: Lens' (Closure Range) MetaInfo

type Rep MetaInfo

Defined in Agda.TypeChecking.Monad.Base

type Rep MetaInfo = D1 ('MetaData "MetaInfo" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-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 RunMetaOccursCheck

Constructors

RunMetaOccursCheck

DontRunMetaOccursCheck

Instances

Generic RunMetaOccursCheck

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep RunMetaOccursCheck :: Type -> Type

Methods

from :: RunMetaOccursCheck -> Rep RunMetaOccursCheck x

to :: Rep RunMetaOccursCheck x -> RunMetaOccursCheck

Show RunMetaOccursCheck

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> RunMetaOccursCheck -> ShowS

show :: RunMetaOccursCheck -> String

showList :: [RunMetaOccursCheck] -> ShowS

NFData RunMetaOccursCheck

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: RunMetaOccursCheck -> ()

Eq RunMetaOccursCheck

Defined in Agda.TypeChecking.Monad.Base

Methods

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

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

Ord RunMetaOccursCheck

Defined in Agda.TypeChecking.Monad.Base

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

Defined in Agda.TypeChecking.Monad.Base

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

newtype MetaPriority

Meta variable priority: When we have an equation between meta-variables, which one should be instantiated?

Higher value means higher priority to be instantiated.

Constructors

MetaPriority Int

Instances

Show MetaPriority

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> MetaPriority -> ShowS

show :: MetaPriority -> String

showList :: [MetaPriority] -> ShowS

NFData MetaPriority

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: MetaPriority -> ()

Eq MetaPriority

Defined in Agda.TypeChecking.Monad.Base

Methods

(==) :: MetaPriority -> MetaPriority -> Bool

(/=) :: MetaPriority -> MetaPriority -> Bool

Ord MetaPriority

Defined in Agda.TypeChecking.Monad.Base

Methods

compare :: MetaPriority -> MetaPriority -> Ordering

(<) :: MetaPriority -> MetaPriority -> Bool

(<=) :: MetaPriority -> MetaPriority -> Bool

(>) :: MetaPriority -> MetaPriority -> Bool

(>=) :: MetaPriority -> MetaPriority -> Bool

max :: MetaPriority -> MetaPriority -> MetaPriority

min :: MetaPriority -> MetaPriority -> MetaPriority

data TypeCheckingProblem

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

PrettyTCM TypeCheckingProblem

Defined in Agda.TypeChecking.Pretty

Methods

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

Generic TypeCheckingProblem

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep TypeCheckingProblem :: Type -> Type

Methods

from :: TypeCheckingProblem -> Rep TypeCheckingProblem x

to :: Rep TypeCheckingProblem x -> TypeCheckingProblem

NFData TypeCheckingProblem

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: TypeCheckingProblem -> ()

type Rep TypeCheckingProblem

Defined in Agda.TypeChecking.Monad.Base

type Rep TypeCheckingProblem = D1 ('MetaData "TypeCheckingProblem" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-inplace" 'False) ((C1 ('MetaCons "CheckExpr" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Comparison) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Expr) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type))) :+: C1 ('MetaCons "CheckArgs" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Comparison) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ExpandHidden) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Range))) :*: ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [NamedArg Expr]) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type)) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (ArgsCheckState CheckedTarget -> TCM Term)))))) :+: (C1 ('MetaCons "CheckProjAppToKnownPrincipalArg" 'PrefixI 'False) (((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Comparison) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Expr)) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ProjOrigin) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (List1 QName)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Args)))) :*: ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Int)) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 PrincipalArgTypeMetas))))) :+: (C1 ('MetaCons "CheckLambda" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Comparison) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Arg (List1 (WithHiding Name), Maybe Type)))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Expr) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type))) :+: C1 ('MetaCons "DoQuoteTerm" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Comparison) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type))))))

data PrincipalArgTypeMetas

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

Generic PrincipalArgTypeMetas

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep PrincipalArgTypeMetas :: Type -> Type

Methods

from :: PrincipalArgTypeMetas -> Rep PrincipalArgTypeMetas x

to :: Rep PrincipalArgTypeMetas x -> PrincipalArgTypeMetas

NFData PrincipalArgTypeMetas

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: PrincipalArgTypeMetas -> ()

type Rep PrincipalArgTypeMetas

Defined in Agda.TypeChecking.Monad.Base

type Rep PrincipalArgTypeMetas = D1 ('MetaData "PrincipalArgTypeMetas" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-inplace" 'False) (C1 ('MetaCons "PrincipalArgTypeMetas" 'PrefixI 'True) (S1 ('MetaSel ('Just "patmMetas") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Args) :*: S1 ('MetaSel ('Just "patmRemainder") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type)))

data CheckedTarget

Solving a CheckArgs constraint may or may not check the target type. If it did, it returns a handle to any unsolved constraints.

Constructors

CheckedTarget (Maybe ProblemId)

NotCheckedTarget

data MetaInstantiation

Constructors

InstV [Arg String] Term

solved by term (abstracted over some free variables)

Open

unsolved

OpenInstance

open, to be instantiated by instance search

BlockedConst Term

solution blocked by unsolved constraints

PostponedTypeCheckingProblem (Closure TypeCheckingProblem)

Instances

Generic MetaInstantiation

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep MetaInstantiation :: Type -> Type

Methods

from :: MetaInstantiation -> Rep MetaInstantiation x

to :: Rep MetaInstantiation x -> MetaInstantiation

Show MetaInstantiation

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> MetaInstantiation -> ShowS

show :: MetaInstantiation -> String

showList :: [MetaInstantiation] -> ShowS

NFData MetaInstantiation

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: MetaInstantiation -> ()

type Rep MetaInstantiation

Defined in Agda.TypeChecking.Monad.Base

type Rep MetaInstantiation = D1 ('MetaData "MetaInstantiation" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-inplace" 'False) ((C1 ('MetaCons "InstV" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Arg String]) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term)) :+: 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 Frozen

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

Generic Frozen

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep Frozen :: Type -> Type

Methods

from :: Frozen -> Rep Frozen x

to :: Rep Frozen x -> Frozen

Show Frozen

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> Frozen -> ShowS

show :: Frozen -> String

showList :: [Frozen] -> ShowS

NFData Frozen

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: Frozen -> ()

Eq Frozen

Defined in Agda.TypeChecking.Monad.Base

Methods

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

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

type Rep Frozen

Defined in Agda.TypeChecking.Monad.Base

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

data Listener

Constructors

EtaExpand MetaId

CheckConstraint Nat ProblemConstraint

Instances

Generic Listener

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep Listener :: Type -> Type

Methods

from :: Listener -> Rep Listener x

to :: Rep Listener x -> Listener

NFData Listener

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: Listener -> ()

Eq Listener

Defined in Agda.TypeChecking.Monad.Base

Methods

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

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

Ord Listener

Defined in Agda.TypeChecking.Monad.Base

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

Defined in Agda.TypeChecking.Monad.Base

type Rep Listener = D1 ('MetaData "Listener" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-inplace" 'False) (C1 ('MetaCons "EtaExpand" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 MetaId)) :+: C1 ('MetaCons "CheckConstraint" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Nat) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ProblemConstraint)))

data MetaVariable

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

LensModality MetaVariable

Defined in Agda.TypeChecking.Monad.Base

Methods

getModality :: MetaVariable -> Modality

setModality :: Modality -> MetaVariable -> MetaVariable

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

LensQuantity MetaVariable

Defined in Agda.TypeChecking.Monad.Base

Methods

getQuantity :: MetaVariable -> Quantity

setQuantity :: Quantity -> MetaVariable -> MetaVariable

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

HasRange MetaVariable

Defined in Agda.TypeChecking.Monad.Base

Methods

getRange :: MetaVariable -> Range

SetRange MetaVariable

Defined in Agda.TypeChecking.Monad.Base

Methods

setRange :: Range -> MetaVariable -> MetaVariable

Generic MetaVariable

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep MetaVariable :: Type -> Type

Methods

from :: MetaVariable -> Rep MetaVariable x

to :: Rep MetaVariable x -> MetaVariable

NFData MetaVariable

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: MetaVariable -> ()

LensClosure Range MetaVariable

Defined in Agda.TypeChecking.Monad.Base

Methods

lensClosure :: Lens' (Closure Range) MetaVariable

type Rep MetaVariable

Defined in Agda.TypeChecking.Monad.Base

type Rep MetaVariable = D1 ('MetaData "MetaVariable" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-inplace" 'False) (C1 ('MetaCons "MetaVar" 'PrefixI 'True) (((S1 ('MetaSel ('Just "mvInfo") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 MetaInfo) :*: S1 ('MetaSel ('Just "mvPriority") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 MetaPriority)) :*: (S1 ('MetaSel ('Just "mvPermutation") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Permutation) :*: S1 ('MetaSel ('Just "mvJudgement") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Judgement MetaId)))) :*: ((S1 ('MetaSel ('Just "mvInstantiation") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 MetaInstantiation) :*: S1 ('MetaSel ('Just "mvListeners") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Set Listener))) :*: (S1 ('MetaSel ('Just "mvFrozen") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Frozen) :*: S1 ('MetaSel ('Just "mvTwin") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe MetaId))))))

data GeneralizedValue

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

Data GeneralizedValue

Defined in Agda.TypeChecking.Monad.Base

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> GeneralizedValue -> c GeneralizedValue

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c GeneralizedValue

toConstr :: GeneralizedValue -> Constr

dataTypeOf :: GeneralizedValue -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c GeneralizedValue)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c GeneralizedValue)

gmapT :: (forall b. Data b => b -> b) -> GeneralizedValue -> GeneralizedValue

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> GeneralizedValue -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> GeneralizedValue -> r

gmapQ :: (forall d. Data d => d -> u) -> GeneralizedValue -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> GeneralizedValue -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> GeneralizedValue -> m GeneralizedValue

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> GeneralizedValue -> m GeneralizedValue

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> GeneralizedValue -> m GeneralizedValue

Generic GeneralizedValue

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep GeneralizedValue :: Type -> Type

Methods

from :: GeneralizedValue -> Rep GeneralizedValue x

to :: Rep GeneralizedValue x -> GeneralizedValue

Show GeneralizedValue

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> GeneralizedValue -> ShowS

show :: GeneralizedValue -> String

showList :: [GeneralizedValue] -> ShowS

NFData GeneralizedValue

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: GeneralizedValue -> ()

type Rep GeneralizedValue

Defined in Agda.TypeChecking.Monad.Base

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

data DoGeneralize

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

KillRange DoGeneralize

Defined in Agda.TypeChecking.Monad.Base

Methods

killRange :: KillRangeT DoGeneralize

EmbPrj DoGeneralize

Defined in Agda.TypeChecking.Serialise.Instances.Internal

Methods

icode :: DoGeneralize -> S Int32

icod_ :: DoGeneralize -> S Int32

value :: Int32 -> R DoGeneralize

Data DoGeneralize

Defined in Agda.TypeChecking.Monad.Base

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> DoGeneralize -> c DoGeneralize

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c DoGeneralize

toConstr :: DoGeneralize -> Constr

dataTypeOf :: DoGeneralize -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c DoGeneralize)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c DoGeneralize)

gmapT :: (forall b. Data b => b -> b) -> DoGeneralize -> DoGeneralize

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> DoGeneralize -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> DoGeneralize -> r

gmapQ :: (forall d. Data d => d -> u) -> DoGeneralize -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> DoGeneralize -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> DoGeneralize -> m DoGeneralize

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> DoGeneralize -> m DoGeneralize

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> DoGeneralize -> m DoGeneralize

Generic DoGeneralize

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep DoGeneralize :: Type -> Type

Methods

from :: DoGeneralize -> Rep DoGeneralize x

to :: Rep DoGeneralize x -> DoGeneralize

Show DoGeneralize

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> DoGeneralize -> ShowS

show :: DoGeneralize -> String

showList :: [DoGeneralize] -> ShowS

NFData DoGeneralize

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: DoGeneralize -> ()

Eq DoGeneralize

Defined in Agda.TypeChecking.Monad.Base

Methods

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

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

Ord DoGeneralize

Defined in Agda.TypeChecking.Monad.Base

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

Defined in Agda.TypeChecking.Monad.Base

type Rep DoGeneralize = D1 ('MetaData "DoGeneralize" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-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 Judgement a

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

PrettyTCM a => PrettyTCM (Judgement a)

Defined in Agda.TypeChecking.Pretty

Methods

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

Pretty a => Pretty (Judgement a)

Defined in Agda.TypeChecking.Monad.Base

Methods

pretty :: Judgement a -> Doc

prettyPrec :: Int -> Judgement a -> Doc

prettyList :: [Judgement a] -> Doc

Generic (Judgement a)

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep (Judgement a) :: Type -> Type

Methods

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

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

NFData a => NFData (Judgement a)

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: Judgement a -> ()

type Rep (Judgement a)

Defined in Agda.TypeChecking.Monad.Base

type Rep (Judgement a) = D1 ('MetaData "Judgement" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-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 Open a

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

Decoration Open

Defined in Agda.TypeChecking.Monad.Base

Methods

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

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

Foldable Open

Defined in Agda.TypeChecking.Monad.Base

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

Defined in Agda.TypeChecking.Monad.Base

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

Defined in Agda.TypeChecking.Monad.Base

Methods

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

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

NamesIn a => NamesIn (Open a)

Defined in Agda.Syntax.Internal.Names

Methods

namesIn' :: Monoid m => (QName -> m) -> Open a -> m

KillRange a => KillRange (Open a)

Defined in Agda.TypeChecking.Monad.Base

Methods

killRange :: KillRangeT (Open a)

InstantiateFull t => InstantiateFull (Open t)

Defined in Agda.TypeChecking.Reduce

Methods

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

EmbPrj a => EmbPrj (Open a)

Defined in Agda.TypeChecking.Serialise.Instances.Internal

Methods

icode :: Open a -> S Int32

icod_ :: Open a -> S Int32

value :: Int32 -> R (Open a)

Pretty a => Pretty (Open a)

Defined in Agda.TypeChecking.Monad.Base

Methods

pretty :: Open a -> Doc

prettyPrec :: Int -> Open a -> Doc

prettyList :: [Open a] -> Doc

Generic (Open a)

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep (Open a) :: Type -> Type

Methods

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

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

Show a => Show (Open a)

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> Open a -> ShowS

show :: Open a -> String

showList :: [Open a] -> ShowS

NFData a => NFData (Open a)

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: Open a -> ()

type Rep (Open a)

Defined in Agda.TypeChecking.Monad.Base

type Rep (Open a) = D1 ('MetaData "Open" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-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 CompareAs

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

TermLike CompareAs

Defined in Agda.TypeChecking.Monad.Base

Methods

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

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

AllMetas CompareAs

Defined in Agda.TypeChecking.Monad.Base

Methods

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

Free CompareAs

Defined in Agda.TypeChecking.Monad.Base

Methods

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

MentionsMeta CompareAs

Defined in Agda.TypeChecking.MetaVars.Mention

Methods

mentionsMetas :: HashSet MetaId -> CompareAs -> Bool

IsSizeType CompareAs

Defined in Agda.TypeChecking.Monad.SizedTypes

Methods

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

PrettyTCM CompareAs

Defined in Agda.TypeChecking.Pretty

Methods

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

Instantiate CompareAs

Defined in Agda.TypeChecking.Reduce

Methods

instantiate' :: CompareAs -> ReduceM CompareAs

InstantiateFull CompareAs

Defined in Agda.TypeChecking.Reduce

Methods

instantiateFull' :: CompareAs -> ReduceM CompareAs

IsMeta CompareAs

Defined in Agda.TypeChecking.Reduce

Methods

isMeta :: CompareAs -> Maybe MetaId

Normalise CompareAs

Defined in Agda.TypeChecking.Reduce

Methods

normalise' :: CompareAs -> ReduceM CompareAs

Reduce CompareAs

Defined in Agda.TypeChecking.Reduce

Methods

reduce' :: CompareAs -> ReduceM CompareAs

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

Simplify CompareAs

Defined in Agda.TypeChecking.Reduce

Methods

simplify' :: CompareAs -> ReduceM CompareAs

Subst CompareAs

Defined in Agda.TypeChecking.Substitute

Associated Types

type SubstArg CompareAs

Methods

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

Data CompareAs

Defined in Agda.TypeChecking.Monad.Base

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> CompareAs -> c CompareAs

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c CompareAs

toConstr :: CompareAs -> Constr

dataTypeOf :: CompareAs -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c CompareAs)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c CompareAs)

gmapT :: (forall b. Data b => b -> b) -> CompareAs -> CompareAs

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> CompareAs -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> CompareAs -> r

gmapQ :: (forall d. Data d => d -> u) -> CompareAs -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> CompareAs -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> CompareAs -> m CompareAs

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> CompareAs -> m CompareAs

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> CompareAs -> m CompareAs

Generic CompareAs

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep CompareAs :: Type -> Type

Methods

from :: CompareAs -> Rep CompareAs x

to :: Rep CompareAs x -> CompareAs

Show CompareAs

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> CompareAs -> ShowS

show :: CompareAs -> String

showList :: [CompareAs] -> ShowS

NFData CompareAs

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: CompareAs -> ()

type SubstArg CompareAs

Defined in Agda.TypeChecking.Substitute

type SubstArg CompareAs = Term

type Rep CompareAs

Defined in Agda.TypeChecking.Monad.Base

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

An extension of Comparison to >=.

Constructors

DirEq

DirLeq

DirGeq

Instances

Pretty CompareDirection

Defined in Agda.TypeChecking.Monad.Base

Methods

pretty :: CompareDirection -> Doc

prettyPrec :: Int -> CompareDirection -> Doc

prettyList :: [CompareDirection] -> Doc

Show CompareDirection

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> CompareDirection -> ShowS

show :: CompareDirection -> String

showList :: [CompareDirection] -> ShowS

Eq CompareDirection

Defined in Agda.TypeChecking.Monad.Base

Methods

(==) :: CompareDirection -> CompareDirection -> Bool

(/=) :: CompareDirection -> CompareDirection -> Bool

data Constraint

Constructors

ValueCmp Comparison CompareAs Term Term

ValueCmpOnFace Comparison Term Type Term Term

ElimCmp [Polarity] [IsForced] Type Term [Elim] [Elim]

SortCmp Comparison Sort Sort

LevelCmp Comparison Level Level

HasBiggerSort Sort

HasPTSRule (Dom Type) (Abs Sort)

CheckMetaInst MetaId

CheckType Type

UnBlock MetaId

Meta created for a term blocked by a postponed type checking problem or unsolved constraints. The MetaInstantiation for the meta (when unsolved) is either BlockedConst or PostponedTypeCheckingProblem.

IsEmpty Range Type

The range is the one of the absurd pattern.

CheckSizeLtSat Term

Check that the Term is either not a SIZELT or a non-empty SIZELT.

FindInstance MetaId (Maybe [Candidate])

the first argument is the instance argument and the second one is the list of candidates (or Nothing if we haven’t determined the list of candidates yet)

CheckFunDef Delayed DefInfo QName [Clause] TCErr

Last argument is the error causing us to postpone.

UnquoteTactic Term Term Type

First argument is computation and the others are hole and goal type

CheckLockedVars Term Type (Arg Term) Type

CheckLockedVars t ty lk lk_ty with t : ty, lk : lk_ty and t lk well-typed.

UsableAtModality Modality Term

is the term usable at the given modality?

Instances

TermLike Constraint

Defined in Agda.TypeChecking.Monad.Base

Methods

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

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

AllMetas Constraint

Defined in Agda.TypeChecking.Monad.Base

Methods

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

HasRange Constraint

Defined in Agda.TypeChecking.Monad.Base

Methods

getRange :: Constraint -> Range

Reify Constraint

Defined in Agda.Interaction.BasicOps

Associated Types

type ReifiesTo Constraint

Methods

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

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

Free Constraint

Defined in Agda.TypeChecking.Monad.Base

Methods

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

MentionsMeta Constraint

Defined in Agda.TypeChecking.MetaVars.Mention

Methods

mentionsMetas :: HashSet MetaId -> Constraint -> Bool

PrettyTCM Constraint

Defined in Agda.TypeChecking.Pretty.Constraint

Methods

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

Instantiate Constraint

Defined in Agda.TypeChecking.Reduce

Methods

instantiate' :: Constraint -> ReduceM Constraint

InstantiateFull Constraint

Defined in Agda.TypeChecking.Reduce

Methods

instantiateFull' :: Constraint -> ReduceM Constraint

Normalise Constraint

Defined in Agda.TypeChecking.Reduce

Methods

normalise' :: Constraint -> ReduceM Constraint

Reduce Constraint

Defined in Agda.TypeChecking.Reduce

Methods

reduce' :: Constraint -> ReduceM Constraint

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

Simplify Constraint

Defined in Agda.TypeChecking.Reduce

Methods

simplify' :: Constraint -> ReduceM Constraint

Subst Constraint

Defined in Agda.TypeChecking.Substitute

Associated Types

type SubstArg Constraint

Methods

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

Generic Constraint

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep Constraint :: Type -> Type

Methods

from :: Constraint -> Rep Constraint x

to :: Rep Constraint x -> Constraint

Show Constraint

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> Constraint -> ShowS

show :: Constraint -> String

showList :: [Constraint] -> ShowS

NFData Constraint

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: Constraint -> ()

type ReifiesTo Constraint

Defined in Agda.Interaction.BasicOps

type ReifiesTo Constraint = OutputConstraint Expr Expr

type SubstArg Constraint

Defined in Agda.TypeChecking.Substitute

type SubstArg Constraint = Term

type Rep Constraint

Defined in Agda.TypeChecking.Monad.Base

type Rep Constraint = D1 ('MetaData "Constraint" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-inplace" 'False) ((((C1 ('MetaCons "ValueCmp" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Comparison) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 CompareAs)) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term))) :+: C1 ('MetaCons "ValueCmpOnFace" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Comparison) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term)) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term))))) :+: (C1 ('MetaCons "ElimCmp" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Polarity]) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [IsForced]) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Elim]) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Elim])))) :+: C1 ('MetaCons "SortCmp" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Comparison) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Sort) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Sort))))) :+: ((C1 ('MetaCons "LevelCmp" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Comparison) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Level) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Level))) :+: C1 ('MetaCons "HasBiggerSort" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Sort))) :+: (C1 ('MetaCons "HasPTSRule" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Dom Type)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Abs Sort))) :+: C1 ('MetaCons "CheckMetaInst" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 MetaId))))) :+: (((C1 ('MetaCons "CheckType" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type)) :+: C1 ('MetaCons "UnBlock" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 MetaId))) :+: (C1 ('MetaCons "IsEmpty" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Range) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type)) :+: C1 ('MetaCons "CheckSizeLtSat" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term)))) :+: ((C1 ('MetaCons "FindInstance" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 MetaId) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe [Candidate]))) :+: C1 ('MetaCons "CheckFunDef" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Delayed) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 DefInfo)) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Clause]) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 TCErr))))) :+: (C1 ('MetaCons "UnquoteTactic" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type))) :+: (C1 ('MetaCons "CheckLockedVars" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type)) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Arg Term)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type))) :+: C1 ('MetaCons "UsableAtModality" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Modality) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Term)))))))

data ProblemConstraint

Constructors

PConstr

Fields

• constraintProblems :: Set ProblemId
• constraintUnblocker :: Blocker
• theConstraint :: Closure Constraint

Instances

HasRange ProblemConstraint

Defined in Agda.TypeChecking.Monad.Base

Methods

getRange :: ProblemConstraint -> Range

Reify ProblemConstraint

Defined in Agda.Interaction.BasicOps

Associated Types

type ReifiesTo ProblemConstraint

Methods

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

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

MentionsMeta ProblemConstraint

Defined in Agda.TypeChecking.MetaVars.Mention

Methods

mentionsMetas :: HashSet MetaId -> ProblemConstraint -> Bool

PrettyTCM ProblemConstraint

Defined in Agda.TypeChecking.Pretty.Constraint

Methods

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

InstantiateFull ProblemConstraint

Defined in Agda.TypeChecking.Reduce

Methods

instantiateFull' :: ProblemConstraint -> ReduceM ProblemConstraint

Normalise ProblemConstraint

Defined in Agda.TypeChecking.Reduce

Methods

normalise' :: ProblemConstraint -> ReduceM ProblemConstraint

Simplify ProblemConstraint

Defined in Agda.TypeChecking.Reduce

Methods

simplify' :: ProblemConstraint -> ReduceM ProblemConstraint

Generic ProblemConstraint

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep ProblemConstraint :: Type -> Type

Methods

from :: ProblemConstraint -> Rep ProblemConstraint x

to :: Rep ProblemConstraint x -> ProblemConstraint

Show ProblemConstraint

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> ProblemConstraint -> ShowS

show :: ProblemConstraint -> String

showList :: [ProblemConstraint] -> ShowS

NFData ProblemConstraint

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: ProblemConstraint -> ()

type ReifiesTo ProblemConstraint

Defined in Agda.Interaction.BasicOps

type ReifiesTo ProblemConstraint = Closure (OutputForm Expr Expr)

type Rep ProblemConstraint

Defined in Agda.TypeChecking.Monad.Base

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

type Constraints = [ProblemConstraint]

class LensClosure a b | b -> a where

Methods

lensClosure :: Lens' (Closure a) b

Instances

LensClosure Range MetaInfo

Defined in Agda.TypeChecking.Monad.Base

Methods

lensClosure :: Lens' (Closure Range) MetaInfo

LensClosure Range MetaVariable

Defined in Agda.TypeChecking.Monad.Base

Methods

lensClosure :: Lens' (Closure Range) MetaVariable

LensClosure a (Closure a)

Defined in Agda.TypeChecking.Monad.Base

Methods

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

data Closure a

Constructors

Closure

Fields

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

Instances

Foldable Closure

Defined in Agda.TypeChecking.Monad.Base

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

Defined in Agda.TypeChecking.Monad.Base

Methods

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

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

LensClosure a (Closure a)

Defined in Agda.TypeChecking.Monad.Base

Methods

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

LensIsAbstract (Closure a)

Defined in Agda.TypeChecking.Monad.Base

Methods

lensIsAbstract :: Lens' IsAbstract (Closure a)

HasRange a => HasRange (Closure a)

Defined in Agda.TypeChecking.Monad.Base

Methods

getRange :: Closure a -> Range

KillRange a => KillRange (Closure a)

Defined in Agda.TypeChecking.Monad.Base

Methods

killRange :: KillRangeT (Closure a)

MentionsMeta a => MentionsMeta (Closure a)

Defined in Agda.TypeChecking.MetaVars.Mention

Methods

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

LensTCEnv (Closure a)

Defined in Agda.TypeChecking.Monad.Base

Methods

lensTCEnv :: Lens' TCEnv (Closure a)

PrettyTCM a => PrettyTCM (Closure a)

Defined in Agda.TypeChecking.Pretty

Methods

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

Instantiate a => Instantiate (Closure a)

Defined in Agda.TypeChecking.Reduce

Methods

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

InstantiateFull a => InstantiateFull (Closure a)

Defined in Agda.TypeChecking.Reduce

Methods

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

Normalise a => Normalise (Closure a)

Defined in Agda.TypeChecking.Reduce

Methods

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

Reduce a => Reduce (Closure a)

Defined in Agda.TypeChecking.Reduce

Methods

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

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

Simplify a => Simplify (Closure a)

Defined in Agda.TypeChecking.Reduce

Methods

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

Generic (Closure a)

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep (Closure a) :: Type -> Type

Methods

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

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

Show a => Show (Closure a)

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> Closure a -> ShowS

show :: Closure a -> String

showList :: [Closure a] -> ShowS

NFData a => NFData (Closure a)

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: Closure a -> ()

type Rep (Closure a)

Defined in Agda.TypeChecking.Monad.Base

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

data Interface

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 :: [(ModuleName, Hash)]

  Imported modules and their hashes.

• iModuleName :: ModuleName

  Module name of this interface.

• 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
• 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 (String, QName)
• iForeignCode :: Map BackendName [ForeignCode]
• 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

Instances

InstantiateFull Interface

Defined in Agda.TypeChecking.Reduce

Methods

instantiateFull' :: Interface -> ReduceM Interface

EmbPrj Interface

Defined in Agda.TypeChecking.Serialise.Instances

Methods

icode :: Interface -> S Int32

icod_ :: Interface -> S Int32

value :: Int32 -> R Interface

Pretty Interface

Defined in Agda.TypeChecking.Monad.Base

Methods

pretty :: Interface -> Doc

prettyPrec :: Int -> Interface -> Doc

prettyList :: [Interface] -> Doc

Generic Interface

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep Interface :: Type -> Type

Methods

from :: Interface -> Rep Interface x

to :: Rep Interface x -> Interface

Show Interface

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> Interface -> ShowS

show :: Interface -> String

showList :: [Interface] -> ShowS

NFData Interface

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: Interface -> ()

type Rep Interface

Defined in Agda.TypeChecking.Monad.Base

type Rep Interface = D1 ('MetaData "Interface" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-inplace" 'False) (C1 ('MetaCons "Interface" 'PrefixI 'True) ((((S1 ('MetaSel ('Just "iSourceHash") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Hash) :*: S1 ('MetaSel ('Just "iSource") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Text)) :*: (S1 ('MetaSel ('Just "iFileType") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 FileType) :*: (S1 ('MetaSel ('Just "iImportedModules") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [(ModuleName, Hash)]) :*: S1 ('MetaSel ('Just "iModuleName") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ModuleName)))) :*: ((S1 ('MetaSel ('Just "iScope") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Map ModuleName Scope)) :*: S1 ('MetaSel ('Just "iInsideScope") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ScopeInfo)) :*: (S1 ('MetaSel ('Just "iSignature") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Signature) :*: (S1 ('MetaSel ('Just "iDisplayForms") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 DisplayForms) :*: S1 ('MetaSel ('Just "iUserWarnings") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Map QName Text)))))) :*: (((S1 ('MetaSel ('Just "iImportWarning") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe Text)) :*: S1 ('MetaSel ('Just "iBuiltin") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (BuiltinThings (String, QName)))) :*: (S1 ('MetaSel ('Just "iForeignCode") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Map BackendName [ForeignCode])) :*: (S1 ('MetaSel ('Just "iHighlighting") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 HighlightingInfo) :*: S1 ('MetaSel ('Just "iDefaultPragmaOptions") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [OptionsPragma])))) :*: ((S1 ('MetaSel ('Just "iFilePragmaOptions") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [OptionsPragma]) :*: S1 ('MetaSel ('Just "iOptionsUsed") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 PragmaOptions)) :*: (S1 ('MetaSel ('Just "iPatternSyns") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 PatternSynDefns) :*: (S1 ('MetaSel ('Just "iWarnings") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [TCWarning]) :*: S1 ('MetaSel ('Just "iPartialDefs") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Set QName))))))))

data ForeignCode

Constructors

ForeignCode Range String

Instances

EmbPrj ForeignCode

Defined in Agda.TypeChecking.Serialise.Instances.Compilers

Methods

icode :: ForeignCode -> S Int32

icod_ :: ForeignCode -> S Int32

value :: Int32 -> R ForeignCode

Generic ForeignCode

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep ForeignCode :: Type -> Type

Methods

from :: ForeignCode -> Rep ForeignCode x

to :: Rep ForeignCode x -> ForeignCode

Show ForeignCode

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> ForeignCode -> ShowS

show :: ForeignCode -> String

showList :: [ForeignCode] -> ShowS

NFData ForeignCode

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: ForeignCode -> ()

type Rep ForeignCode

Defined in Agda.TypeChecking.Monad.Base

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

type DecodedModules = Map TopLevelModuleName ModuleInfo

type VisitedModules = Map TopLevelModuleName ModuleInfo

data ModuleInfo

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

Generic ModuleInfo

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep ModuleInfo :: Type -> Type

Methods

from :: ModuleInfo -> Rep ModuleInfo x

to :: Rep ModuleInfo x -> ModuleInfo

NFData ModuleInfo

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: ModuleInfo -> ()

type Rep ModuleInfo

Defined in Agda.TypeChecking.Monad.Base

type Rep ModuleInfo = D1 ('MetaData "ModuleInfo" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-inplace" 'False) (C1 ('MetaCons "ModuleInfo" 'PrefixI 'True) ((S1 ('MetaSel ('Just "miInterface") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Interface) :*: S1 ('MetaSel ('Just "miWarnings") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [TCWarning])) :*: (S1 ('MetaSel ('Just "miPrimitive") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool) :*: S1 ('MetaSel ('Just "miMode") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ModuleCheckMode))))

data ModuleCheckMode

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

Constructors

ModuleScopeChecked

ModuleTypeChecked

Instances

Bounded ModuleCheckMode

Defined in Agda.TypeChecking.Monad.Base

Methods

minBound :: ModuleCheckMode

maxBound :: ModuleCheckMode

Enum ModuleCheckMode

Defined in Agda.TypeChecking.Monad.Base

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

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep ModuleCheckMode :: Type -> Type

Methods

from :: ModuleCheckMode -> Rep ModuleCheckMode x

to :: Rep ModuleCheckMode x -> ModuleCheckMode

Show ModuleCheckMode

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> ModuleCheckMode -> ShowS

show :: ModuleCheckMode -> String

showList :: [ModuleCheckMode] -> ShowS

NFData ModuleCheckMode

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: ModuleCheckMode -> ()

Eq ModuleCheckMode

Defined in Agda.TypeChecking.Monad.Base

Methods

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

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

Ord ModuleCheckMode

Defined in Agda.TypeChecking.Monad.Base

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

Defined in Agda.TypeChecking.Monad.Base

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

class Monad m => MonadStConcreteNames m where

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

useConcreteNames :: m ConcreteNames

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

Instances

MonadStConcreteNames AbsToCon

Defined in Agda.Syntax.Translation.AbstractToConcrete

Methods

runStConcreteNames :: StateT ConcreteNames AbsToCon a -> AbsToCon a

useConcreteNames :: AbsToCon ConcreteNames

modifyConcreteNames :: (ConcreteNames -> ConcreteNames) -> AbsToCon ()

MonadStConcreteNames TCM

Defined in Agda.TypeChecking.Monad.Base

Methods

runStConcreteNames :: StateT ConcreteNames TCM a -> TCM a

useConcreteNames :: TCM ConcreteNames

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

ReadTCState m => MonadStConcreteNames (PureConversionT m)

Defined in Agda.TypeChecking.Conversion.Pure

Methods

runStConcreteNames :: StateT ConcreteNames (PureConversionT m) a -> PureConversionT m a

useConcreteNames :: PureConversionT m ConcreteNames

modifyConcreteNames :: (ConcreteNames -> ConcreteNames) -> PureConversionT m ()

MonadStConcreteNames m => MonadStConcreteNames (IdentityT m)

Defined in Agda.TypeChecking.Monad.Base

Methods

runStConcreteNames :: StateT ConcreteNames (IdentityT m) a -> IdentityT m a

useConcreteNames :: IdentityT m ConcreteNames

modifyConcreteNames :: (ConcreteNames -> ConcreteNames) -> IdentityT m ()

MonadStConcreteNames m => MonadStConcreteNames (ReaderT r m)

Defined in Agda.TypeChecking.Monad.Base

Methods

runStConcreteNames :: StateT ConcreteNames (ReaderT r m) a -> ReaderT r m a

useConcreteNames :: ReaderT r m ConcreteNames

modifyConcreteNames :: (ConcreteNames -> ConcreteNames) -> ReaderT r m ()

MonadStConcreteNames m => MonadStConcreteNames (StateT s m)

Defined in Agda.TypeChecking.Monad.Base

Methods

runStConcreteNames :: StateT ConcreteNames (StateT s m) a -> StateT s m a

useConcreteNames :: StateT s m ConcreteNames

modifyConcreteNames :: (ConcreteNames -> ConcreteNames) -> StateT s m ()

type SourceToModule = Map AbsolutePath TopLevelModuleName

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

class FreshName a where

Create a fresh name from a.

Methods

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

Instances

FreshName Range

Defined in Agda.TypeChecking.Monad.Base

Methods

freshName_ :: MonadFresh NameId m => Range -> m Name

FreshName String

Defined in Agda.TypeChecking.Monad.Base

Methods

freshName_ :: MonadFresh NameId m => String -> m Name

FreshName ()

Defined in Agda.TypeChecking.Monad.Base

Methods

freshName_ :: MonadFresh NameId m => () -> m Name

FreshName (Range, String)

Defined in Agda.TypeChecking.Monad.Base

Methods

freshName_ :: MonadFresh NameId m => (Range, String) -> m Name

newtype CheckpointId

Constructors

CheckpointId Int

Instances

HasFresh CheckpointId

Defined in Agda.TypeChecking.Monad.Base

Methods

freshLens :: Lens' CheckpointId TCState

nextFresh' :: CheckpointId -> CheckpointId

PrettyTCM CheckpointId

Defined in Agda.TypeChecking.Pretty

Methods

prettyTCM :: MonadPretty m => CheckpointId -> m Doc

EmbPrj CheckpointId

Defined in Agda.TypeChecking.Serialise.Instances.Internal

Methods

icode :: CheckpointId -> S Int32

icod_ :: CheckpointId -> S Int32

value :: Int32 -> R CheckpointId

Pretty CheckpointId

Defined in Agda.TypeChecking.Monad.Base

Methods

pretty :: CheckpointId -> Doc

prettyPrec :: Int -> CheckpointId -> Doc

prettyList :: [CheckpointId] -> Doc

Data CheckpointId

Defined in Agda.TypeChecking.Monad.Base

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> CheckpointId -> c CheckpointId

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c CheckpointId

toConstr :: CheckpointId -> Constr

dataTypeOf :: CheckpointId -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c CheckpointId)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c CheckpointId)

gmapT :: (forall b. Data b => b -> b) -> CheckpointId -> CheckpointId

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> CheckpointId -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> CheckpointId -> r

gmapQ :: (forall d. Data d => d -> u) -> CheckpointId -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> CheckpointId -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> CheckpointId -> m CheckpointId

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> CheckpointId -> m CheckpointId

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> CheckpointId -> m CheckpointId

Enum CheckpointId

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

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

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

Defined in Agda.TypeChecking.Monad.Base

Methods

toRational :: CheckpointId -> Rational

Show CheckpointId

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> CheckpointId -> ShowS

show :: CheckpointId -> String

showList :: [CheckpointId] -> ShowS

NFData CheckpointId

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: CheckpointId -> ()

Eq CheckpointId

Defined in Agda.TypeChecking.Monad.Base

Methods

(==) :: CheckpointId -> CheckpointId -> Bool

(/=) :: CheckpointId -> CheckpointId -> Bool

Ord CheckpointId

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

class Monad m => MonadFresh i m where

Minimal complete definition

Nothing

Methods

fresh :: m i

default fresh :: (MonadTrans t, MonadFresh i n, t n ~ m) => m i

Instances

HasFresh i => MonadFresh i TCM

Defined in Agda.TypeChecking.Monad.Base

Methods

fresh :: TCM i

Monad m => MonadFresh NameId (PureConversionT m)

Defined in Agda.TypeChecking.Conversion.Pure

Methods

fresh :: PureConversionT m NameId

Monad m => MonadFresh ProblemId (PureConversionT m)

Defined in Agda.TypeChecking.Conversion.Pure

Methods

fresh :: PureConversionT m ProblemId

Monad m => MonadFresh Int (PureConversionT m)

Defined in Agda.TypeChecking.Conversion.Pure

Methods

fresh :: PureConversionT m Int

MonadFresh i m => MonadFresh i (ListT m)

Defined in Agda.TypeChecking.Monad.Base

Methods

fresh :: ListT m i

MonadFresh i m => MonadFresh i (IdentityT m)

Defined in Agda.TypeChecking.Monad.Base

Methods

fresh :: IdentityT m i

MonadFresh i m => MonadFresh i (ReaderT r m)

Defined in Agda.TypeChecking.Monad.Base

Methods

fresh :: ReaderT r m i

MonadFresh i m => MonadFresh i (StateT s m)

Defined in Agda.TypeChecking.Monad.Base

Methods

fresh :: StateT s m i

class Enum i => HasFresh i where

Minimal complete definition

freshLens

Methods

freshLens :: Lens' i TCState

nextFresh' :: i -> i

Instances

HasFresh InteractionId

Defined in Agda.TypeChecking.Monad.Base

Methods

freshLens :: Lens' InteractionId TCState

nextFresh' :: InteractionId -> InteractionId

HasFresh MetaId

Defined in Agda.TypeChecking.Monad.Base

Methods

freshLens :: Lens' MetaId TCState

nextFresh' :: MetaId -> MetaId

HasFresh NameId

Defined in Agda.TypeChecking.Monad.Base

Methods

freshLens :: Lens' NameId TCState

nextFresh' :: NameId -> NameId

HasFresh ProblemId

Defined in Agda.TypeChecking.Monad.Base

Methods

freshLens :: Lens' ProblemId TCState

nextFresh' :: ProblemId -> ProblemId

HasFresh CheckpointId

Defined in Agda.TypeChecking.Monad.Base

Methods

freshLens :: Lens' CheckpointId TCState

nextFresh' :: CheckpointId -> CheckpointId

HasFresh MutualId

Defined in Agda.TypeChecking.Monad.Base

Methods

freshLens :: Lens' MutualId TCState

nextFresh' :: MutualId -> MutualId

HasFresh Int

Defined in Agda.TypeChecking.Monad.Base

Methods

freshLens :: Lens' Int TCState

nextFresh' :: Int -> Int

data TypeCheckAction

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 !ModuleName !Telescope

LeaveSection !ModuleName

Decl !Declaration

Never a Section or ScopeDecl

Pragmas !PragmaOptions

Instances

Generic TypeCheckAction

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep TypeCheckAction :: Type -> Type

Methods

from :: TypeCheckAction -> Rep TypeCheckAction x

to :: Rep TypeCheckAction x -> TypeCheckAction

NFData TypeCheckAction

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: TypeCheckAction -> ()

type Rep TypeCheckAction

Defined in Agda.TypeChecking.Monad.Base

type Rep TypeCheckAction = D1 ('MetaData "TypeCheckAction" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-inplace" 'False) ((C1 ('MetaCons "EnterSection" 'PrefixI 'False) (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))))

type CurrentTypeCheckLog = [(TypeCheckAction, PostScopeState)]

Like CachedTypeCheckLog, but storing the log for an ongoing type checking of a module. Stored in reverse order (last performed action first).

type CachedTypeCheckLog = [(TypeCheckAction, PostScopeState)]

A log of what the type checker does and states after the action is completed. The cached version is stored first executed action first.

data LoadedFileCache

Constructors

LoadedFileCache

Fields

• lfcCached :: !CachedTypeCheckLog
• lfcCurrent :: !CurrentTypeCheckLog

Instances

Generic LoadedFileCache

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep LoadedFileCache :: Type -> Type

Methods

from :: LoadedFileCache -> Rep LoadedFileCache x

to :: Rep LoadedFileCache x -> LoadedFileCache

NFData LoadedFileCache

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: LoadedFileCache -> ()

type Rep LoadedFileCache

Defined in Agda.TypeChecking.Monad.Base

type Rep LoadedFileCache = D1 ('MetaData "LoadedFileCache" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-inplace" 'False) (C1 ('MetaCons "LoadedFileCache" 'PrefixI 'True) (S1 ('MetaSel ('Just "lfcCached") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 CachedTypeCheckLog) :*: S1 ('MetaSel ('Just "lfcCurrent") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 CurrentTypeCheckLog)))

data PersistentTCState

A part of the state which is not reverted when an error is thrown or the state is reset.

Constructors

PersistentTCSt

Fields

• stDecodedModules :: !DecodedModules
• 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

LensCommandLineOptions PersistentTCState

Defined in Agda.Interaction.Options.Lenses

Methods

getCommandLineOptions :: PersistentTCState -> CommandLineOptions

setCommandLineOptions :: CommandLineOptions -> PersistentTCState -> PersistentTCState

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

LensIncludePaths PersistentTCState

Defined in Agda.Interaction.Options.Lenses

Methods

getIncludePaths :: PersistentTCState -> [FilePath]

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

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

getAbsoluteIncludePaths :: PersistentTCState -> [AbsolutePath]

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

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

LensPersistentVerbosity PersistentTCState

Defined in Agda.Interaction.Options.Lenses

Methods

getPersistentVerbosity :: PersistentTCState -> PersistentVerbosity

setPersistentVerbosity :: PersistentVerbosity -> PersistentTCState -> PersistentTCState

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

LensSafeMode PersistentTCState

Defined in Agda.Interaction.Options.Lenses

Methods

getSafeMode :: PersistentTCState -> SafeMode

setSafeMode :: SafeMode -> PersistentTCState -> PersistentTCState

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

Generic PersistentTCState

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep PersistentTCState :: Type -> Type

Methods

from :: PersistentTCState -> Rep PersistentTCState x

to :: Rep PersistentTCState x -> PersistentTCState

NFData PersistentTCState

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: PersistentTCState -> ()

type Rep PersistentTCState

Defined in Agda.TypeChecking.Monad.Base

type Rep PersistentTCState = D1 ('MetaData "PersistentTCState" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-inplace" 'False) (C1 ('MetaCons "PersistentTCSt" 'PrefixI 'True) ((S1 ('MetaSel ('Just "stDecodedModules") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 DecodedModules) :*: (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])))))

data MutualBlock

A mutual block of names in the signature.

Constructors

MutualBlock

Fields

• mutualInfo :: MutualInfo

  The original info of the mutual block.

• mutualNames :: Set QName

Instances

Null MutualBlock

Defined in Agda.TypeChecking.Monad.Base

Methods

empty :: MutualBlock

null :: MutualBlock -> Bool

Generic MutualBlock

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep MutualBlock :: Type -> Type

Methods

from :: MutualBlock -> Rep MutualBlock x

to :: Rep MutualBlock x -> MutualBlock

Show MutualBlock

Defined in Agda.TypeChecking.Monad.Base

Methods

showsPrec :: Int -> MutualBlock -> ShowS

show :: MutualBlock -> String

showList :: [MutualBlock] -> ShowS

NFData MutualBlock

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: MutualBlock -> ()

Eq MutualBlock

Defined in Agda.TypeChecking.Monad.Base

Methods

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

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

type Rep MutualBlock

Defined in Agda.TypeChecking.Monad.Base

type Rep MutualBlock = D1 ('MetaData "MutualBlock" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-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 PostScopeState

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.

• stPostMetaStore :: !MetaStore
• 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)

  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 [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 [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
• 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

Instances

Generic PostScopeState

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep PostScopeState :: Type -> Type

Methods

from :: PostScopeState -> Rep PostScopeState x

to :: Rep PostScopeState x -> PostScopeState

NFData PostScopeState

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

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: PostScopeState -> ()

type Rep PostScopeState

Defined in Agda.TypeChecking.Monad.Base

type Rep PostScopeState = D1 ('MetaData "PostScopeState" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-inplace" 'False) (C1 ('MetaCons "PostScopeState" 'PrefixI 'True) ((((S1 ('MetaSel ('Just "stPostSyntaxInfo") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 HighlightingInfo) :*: (S1 ('MetaSel ('Just "stPostDisambiguatedNames") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 DisambiguatedNames) :*: S1 ('MetaSel ('Just "stPostMetaStore") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 MetaStore))) :*: ((S1 ('MetaSel ('Just "stPostInteractionPoints") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 InteractionPoints) :*: S1 ('MetaSel ('Just "stPostAwakeConstraints") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Constraints)) :*: (S1 ('MetaSel ('Just "stPostSleepingConstraints") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Constraints) :*: S1 ('MetaSel ('Just "stPostDirty") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Bool)))) :*: (((S1 ('MetaSel ('Just "stPostOccursCheckDefs") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (Set QName)) :*: S1 ('MetaSel ('Just "stPostSignature") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Signature)) :*: (S1 ('MetaSel ('Just "stPostModuleCheckpoints") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (Map ModuleName CheckpointId)) :*: S1 ('MetaSel ('Just "stPostImportsDisplayForms") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 DisplayForms))) :*: ((S1 ('MetaSel ('Just "stPostCurrentModule") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (Maybe ModuleName)) :*: S1 ('MetaSel ('Just "stPostInstanceDefs") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 TempInstanceTable)) :*: (S1 ('MetaSel ('Just "stPostConcreteNames") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 ConcreteNames) :*: S1 ('MetaSel ('Just "stPostUsedNames") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (Map RawName [RawName])))))) :*: ((((S1 ('MetaSel ('Just "stPostShadowingNames") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (Map Name [RawName])) :*: S1 ('MetaSel ('Just "stPostStatistics") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Statistics)) :*: (S1 ('MetaSel ('Just "stPostTCWarnings") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 [TCWarning]) :*: S1 ('MetaSel ('Just "stPostMutualBlocks") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (Map MutualId MutualBlock)))) :*: ((S1 ('MetaSel ('Just "stPostLocalBuiltins") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (BuiltinThings PrimFun)) :*: S1 ('MetaSel ('Just "stPostFreshMetaId") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 MetaId)) :*: (S1 ('MetaSel ('Just "stPostFreshMutualId") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 MutualId) :*: S1 ('MetaSel ('Just "stPostFreshProblemId") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 ProblemId)))) :*: (((S1 ('MetaSel ('Just "stPostFreshCheckpointId") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 CheckpointId) :*: S1 ('MetaSel ('Just "stPostFreshInt") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Int)) :*: (S1 ('MetaSel ('Just "stPostFreshNameId") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 NameId) :*: S1 ('MetaSel ('Just "stPostAreWeCaching") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Bool))) :*: ((S1 ('MetaSel ('Just "stPostPostponeInstanceSearch") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Bool) :*: S1 ('MetaSel ('Just "stPostConsideringInstance") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Bool)) :*: (S1 ('MetaSel ('Just "stPostInstantiateBlocking") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Bool) :*: S1 ('MetaSel ('Just "stPostLocalPartialDefs") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (Set QName))))))))

type ConcreteNames = Map Name [Name]

type DisambiguatedNames = IntMap DisambiguatedName

data DisambiguatedName

Name disambiguation for the sake of highlighting.

Constructors

DisambiguatedName NameKind QName

Instances

Generic DisambiguatedName

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep DisambiguatedName :: Type -> Type

Methods

from :: DisambiguatedName -> Rep DisambiguatedName x

to :: Rep DisambiguatedName x -> DisambiguatedName

NFData DisambiguatedName

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: DisambiguatedName -> ()

type Rep DisambiguatedName

Defined in Agda.TypeChecking.Monad.Base

type Rep DisambiguatedName = D1 ('MetaData "DisambiguatedName" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-inplace" 'False) (C1 ('MetaCons "DisambiguatedName" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 NameKind) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 QName)))

data PreScopeState

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 ModuleName)
• 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 [ForeignCode])

  {-# 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.

Instances

Generic PreScopeState

Defined in Agda.TypeChecking.Monad.Base

Associated Types

type Rep PreScopeState :: Type -> Type

Methods

from :: PreScopeState -> Rep PreScopeState x

to :: Rep PreScopeState x -> PreScopeState

NFData PreScopeState

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

Defined in Agda.TypeChecking.Monad.Base

Methods

rnf :: PreScopeState -> ()

type Rep PreScopeState

Defined in Agda.TypeChecking.Monad.Base

type Rep PreScopeState = D1 ('MetaData "PreScopeState" "Agda.TypeChecking.Monad.Base" "Agda-2.6.2.1.20220327-inplace" 'False) (C1 ('MetaCons "PreScopeState" 'PrefixI 'True) ((((S1 ('MetaSel ('Just "stPreTokens") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 HighlightingInfo) :*: S1 ('MetaSel ('Just "stPreImports") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Signature)) :*: (S1 ('MetaSel ('Just "stPreImportedModules") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (Set ModuleName)) :*: (S1 ('MetaSel ('Just "stPreModuleToSource") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 ModuleToSource) :*: S1 ('MetaSel ('Just "stPreVisitedModules") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 VisitedModules)))) :*: ((S1 ('MetaSel ('Just "stPreScope") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 ScopeInfo) :*: S1 ('MetaSel ('Just "stPrePatternSyns") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 PatternSynDefns)) :*: (S1 ('MetaSel ('Just "stPrePatternSynImports") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 PatternSynDefns) :*: (S1 ('MetaSel ('Just "stPreGeneralizedVars") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (Maybe (Set QName))) :*: S1 ('MetaSel ('Just "stPrePragmaOptions") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 PragmaOptions))))) :*: (((S1 ('MetaSel ('Just "stPreImportedBuiltins") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (BuiltinThings PrimFun)) :*: S1 ('MetaSel ('Just "stPreImportedDisplayForms") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 DisplayForms)) :*: (S1 ('MetaSel ('Just "stPreImportedInstanceDefs") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 InstanceTable) :*: (S1 ('MetaSel ('Just "stPreForeignCode") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (Map BackendName [ForeignCode])) :*: S1 ('MetaSel ('Just "stPreFreshInteractionId") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 InteractionId)))) :*: ((S1 ('MetaSel ('Just "stPreImportedUserWarnings") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (Map QName Text)) :*: (S1 ('MetaSel ('Just "stPreLocalUserWarnings") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (Map QName Text)) :*: S1 ('MetaSel ('Just "stPreWarningOnImport") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (Maybe Text)))) :*: (S1 ('MetaSel ('Just "stPreImportedPartialDefs") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (Set QName)) :*: (S1 ('MetaSel ('Just "stPreProjectConfigs") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (Map FilePath ProjectConfig)) :*: S1 ('MetaSel ('Just "stPreAgdaLibFiles") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (Map FilePath AgdaLibFile))))))))

class Monad m => ReadTCState m where

Minimal complete definition

Nothing

Methods

getTCState :: m TCState

default getTCState :: (MonadTrans t, ReadTCState n, t n ~ m) => m TCState

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

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

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

Instances

ReadTCState IM

Defined in Agda.Interaction.Monad

Methods

getTCState :: IM TCState

locallyTCState :: Lens' a TCState -> (a -> a) -> IM b -> IM b

withTCState :: (TCState -> TCState) -> IM a -> IM a

ReadTCState AbsToCon

Defined in Agda.Syntax.Translation.AbstractToConcrete

Methods

getTCState :: AbsToCon TCState

locallyTCState :: Lens' a TCState -> (a -> a) -> AbsToCon b -> AbsToCon b

withTCState :: (TCState -> TCState) -> AbsToCon a -> AbsToCon a

ReadTCState TerM

Defined in Agda.Termination.Monad

Methods

getTCState :: TerM TCState

locallyTCState :: Lens' a TCState -> (a -> a) -> TerM b -> TerM b

withTCState :: (TCState -> TCState) -> TerM a -> TerM a

ReadTCState ReduceM

Defined in Agda.TypeChecking.Monad.Base

Methods

getTCState :: ReduceM TCState

locallyTCState :: Lens' a TCState -> (a -> a) -> ReduceM b -> ReduceM b

withTCState :: (TCState -> TCState) -> ReduceM a -> ReduceM a

ReadTCState NLM

Defined in Agda.TypeChecking.Rewriting.NonLinMatch

Methods

getTCState :: NLM TCState

locallyTCState :: Lens' a TCState -> (a -> a) -> NLM b -> NLM b

withTCState :: (TCState -> TCState) -> NLM a -> NLM a

ReadTCState m => ReadTCState (PureConversionT m)

Defined in Agda.TypeChecking.Conversion.Pure

Methods

getTCState :: PureConversionT m TCState

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

withTCState :: (TCState -> TCState) -> PureConversionT m a -> PureConversionT m a

ReadTCState m => ReadTCState (BlockT m)

Defined in Agda.TypeChecking.Monad.Base

Methods

getTCState :: BlockT m TCState

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

withTCState :: (TCState -> TCState) -> BlockT m a -> BlockT m a

MonadIO m => ReadTCState (TCMT m)

Defined in Agda.TypeChecking.Monad.Base

Methods

getTCState :: TCMT m TCState

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

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

ReadTCState m => ReadTCState (NamesT m)

Defined in Agda.TypeChecking.Names

Methods

getTCState :: NamesT m TCState

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

withTCState :: (TCState -> TCState) -> NamesT m a -> NamesT m a

ReadTCState m => ReadTCState (ListT m)

Defined in Agda.TypeChecking.Monad.Base

Methods

getTCState :: ListT m TCState

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

withTCState :: (TCState -> TCState) -> ListT m a -> ListT m a

ReadTCState m => ReadTCState (ChangeT m)

Defined in Agda.TypeChecking.Monad.Base

Methods

getTCState :: ChangeT m TCState

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

withTCState :: (TCState -> TCState) -> ChangeT m a -> ChangeT m a

ReadTCState m => ReadTCState (MaybeT m)

Defined in Agda.TypeChecking.Monad.Base

Methods

getTCState :: MaybeT m TCState

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

withTCState :: (TCState -> TCState) -> MaybeT m a -> MaybeT m a

ReadTCState m => ReadTCState (ExceptT err m)

Defined in Agda.TypeChecking.Monad.Base

Methods

getTCState :: ExceptT err m TCState

locallyTCState :: Lens' a TCState -> (a -> a) -> ExceptT err m b -> ExceptT err m b

withTCState :: (TCState -> TCState) -> ExceptT err m a -> ExceptT err m a

ReadTCState m => ReadTCState (IdentityT m)

Defined in Agda.TypeChecking.Monad.Base

Methods

getTCState :: IdentityT m TCState

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

withTCState :: (TCState -> TCState) -> IdentityT m a -> IdentityT m a

ReadTCState m => ReadTCState (ReaderT r m)

Defined in Agda.TypeChecking.Monad.Base

Methods

getTCState :: ReaderT r m TCState

locallyTCState :: Lens' a TCState -> (a -> a) -> ReaderT r m b -> ReaderT r m b

withTCState :: (TCState -> TCState) -> ReaderT r m a -> ReaderT r m a

ReadTCState m => ReadTCState (StateT s m)

Defined in Agda.TypeChecking.Monad.Base

Methods

getTCState :: StateT s m TCState

locallyTCState :: Lens' a TCState -> (a -> a) -> StateT s m b -> StateT s m b

withTCState :: (TCState -> TCState) -> StateT s m a -> StateT s m a

(Monoid w, ReadTCState m) => ReadTCState (WriterT w m)

Defined in Agda.TypeChecking.Monad.Base

Methods

getTCState :: WriterT w m TCState

locallyTCState :: Lens' a TCState -> (a -> a) -> WriterT w m b -> WriterT w m b

withTCState :: (TCState -> TCState) -> WriterT w m a -> WriterT w m a

initPersistentState :: PersistentTCState

Empty persistent state.

initPreScopeState :: PreScopeState

Empty state of type checker.

initPostScopeState :: PostScopeState

initState :: TCState

stTokens :: Lens' HighlightingInfo TCState

stImports :: Lens' Signature TCState

stImportedModules :: Lens' (Set ModuleName) TCState

stModuleToSource :: Lens' ModuleToSource TCState

stVisitedModules :: Lens' VisitedModules TCState

stScope :: Lens' ScopeInfo TCState

stPatternSyns :: Lens' PatternSynDefns TCState

stPatternSynImports :: Lens' PatternSynDefns TCState

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

stPragmaOptions :: Lens' PragmaOptions TCState

stImportedBuiltins :: Lens' (BuiltinThings PrimFun) TCState

stForeignCode :: Lens' (Map BackendName [ForeignCode]) TCState

stFreshInteractionId :: Lens' InteractionId TCState

stImportedUserWarnings :: Lens' (Map QName Text) TCState

stLocalUserWarnings :: Lens' (Map QName Text) TCState

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

stWarningOnImport :: Lens' (Maybe Text) TCState

stImportedPartialDefs :: Lens' (Set QName) TCState

stLocalPartialDefs :: Lens' (Set QName) TCState

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

stLoadedFileCache :: Lens' (Maybe LoadedFileCache) TCState

stBackends :: Lens' [Backend] TCState

stProjectConfigs :: Lens' (Map FilePath ProjectConfig) TCState

stAgdaLibFiles :: Lens' (Map FilePath AgdaLibFile) TCState

stFreshNameId :: Lens' NameId TCState

stSyntaxInfo :: Lens' HighlightingInfo TCState

stDisambiguatedNames :: Lens' DisambiguatedNames TCState

stMetaStore :: Lens' MetaStore TCState

stInteractionPoints :: Lens' InteractionPoints TCState

stAwakeConstraints :: Lens' Constraints TCState

stSleepingConstraints :: Lens' Constraints TCState

stDirty :: Lens' Bool TCState

stOccursCheckDefs :: Lens' (Set QName) TCState

stSignature :: Lens' Signature TCState

stModuleCheckpoints :: Lens' (Map ModuleName CheckpointId) TCState

stImportsDisplayForms :: Lens' DisplayForms TCState

stImportedDisplayForms :: Lens' DisplayForms TCState

stCurrentModule :: Lens' (Maybe ModuleName) TCState

stImportedInstanceDefs :: Lens' InstanceTable TCState

stInstanceDefs :: Lens' TempInstanceTable TCState

stConcreteNames :: Lens' ConcreteNames TCState

stUsedNames :: Lens' (Map RawName [RawName]) TCState

stShadowingNames :: Lens' (Map Name [RawName]) TCState

stStatistics :: Lens' Statistics TCState

stTCWarnings :: Lens' [TCWarning] TCState

stMutualBlocks :: Lens' (Map MutualId MutualBlock) TCState

stLocalBuiltins :: Lens' (BuiltinThings PrimFun) TCState

stFreshMetaId :: Lens' MetaId TCState

stFreshMutualId :: Lens' MutualId TCState

stFreshProblemId :: Lens' ProblemId TCState

stFreshCheckpointId :: Lens' CheckpointId TCState

stFreshInt :: Lens' Int TCState

stAreWeCaching :: Lens' Bool TCState

stPostponeInstanceSearch :: Lens' Bool TCState

stConsideringInstance :: Lens' Bool TCState

stInstantiateBlocking :: Lens' Bool TCState

stBuiltinThings :: TCState -> BuiltinThings PrimFun

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

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

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

freshNoName_ :: MonadFresh NameId m => m Name

freshRecordName :: MonadFresh NameId m => m Name

sourceToModule :: TCM SourceToModule

Creates a SourceToModule map based on stModuleToSource.

O(n log n).

For a single reverse lookup in stModuleToSource, rather use lookupModuleFromSourse.

lookupModuleFromSource :: ReadTCState m => AbsolutePath -> m (Maybe TopLevelModuleName)

Lookup an AbsolutePath in sourceToModule.

O(n).

iFullHash :: Interface -> Hash

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

intSignature :: Lens' Signature Interface

A lens for the iSignature field of the Interface type.

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

fromCmp :: Comparison -> CompareDirection

Embed Comparison into CompareDirection.

flipCmp :: CompareDirection -> CompareDirection

Flip the direction of comparison.

dirToCmp :: (Comparison -> a -> a -> c) -> CompareDirection -> a -> a -> c

Turn a Comparison function into a CompareDirection function.

Property: dirToCmp f (fromCmp cmp) = f cmp

normalMetaPriority :: MetaPriority

lowMetaPriority :: MetaPriority

highMetaPriority :: MetaPriority

getMetaInfo :: MetaVariable -> Closure Range

getMetaScope :: MetaVariable -> ScopeInfo

getMetaEnv :: MetaVariable -> TCEnv

getMetaSig :: MetaVariable -> Signature

getMetaRelevance :: MetaVariable -> Relevance

getMetaModality :: MetaVariable -> Modality

metaFrozen :: Lens' Frozen MetaVariable

_mvInfo :: Lens' MetaInfo MetaVariable

sigSections :: Lens' Sections Signature

sigDefinitions :: Lens' Definitions Signature

sigRewriteRules :: Lens' RewriteRuleMap Signature

secTelescope :: Lens' Telescope Section

emptySignature :: Signature

defaultDisplayForm :: QName -> [LocalDisplayForm]

By default, we have no display form.

theDefLens :: Lens' Defn Definition

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

Create a definition with sensible defaults.

jsBackendName :: BackendName

ghcBackendName :: BackendName

noCompiledRep :: CompiledRepresentation

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

projDropPars :: Projection -> ProjOrigin -> Term

Building the projection function (which drops the parameters).

projArgInfo :: Projection -> ArgInfo

The info of the principal (record) argument.

setEtaEquality :: EtaEquality -> HasEta -> EtaEquality

Make sure we do not overwrite a user specification.

emptyCompKit :: CompKit

defaultAxiom :: Defn

constTranspAxiom :: Defn

recRecursive :: Defn -> Bool

Is the record type recursive?

recEtaEquality :: Defn -> HasEta

emptyFunction :: Defn

A template for creating Function definitions, with sensible defaults.

funFlag :: FunctionFlag -> Lens' Bool Defn

funStatic :: Lens' Bool Defn

funInline :: Lens' Bool Defn

funMacro :: Lens' Bool Defn

isMacro :: Defn -> Bool

isEmptyFunction :: Defn -> Bool

Checking whether we are dealing with a function yet to be defined.

isCopatternLHS :: [Clause] -> Bool

recCon :: Defn -> QName

defIsRecord :: Defn -> Bool

defIsDataOrRecord :: Defn -> Bool

defConstructors :: Defn -> [QName]

redReturn :: a -> ReduceM (Reduced a' a)

redBind :: ReduceM (Reduced a a') -> (a -> b) -> (a' -> ReduceM (Reduced b b')) -> ReduceM (Reduced b b')

Conceptually: redBind m f k = either (return . Left . f) k =<< m

notReduced :: a -> MaybeReduced a

reduced :: Blocked (Arg Term) -> MaybeReduced (Arg Term)

allReductions :: AllowedReductions

Not quite all reductions (skip non-terminating reductions)

reallyAllReductions :: AllowedReductions

reduceAllDefs :: ReduceDefs

locallyReduceDefs :: MonadTCEnv m => ReduceDefs -> m a -> m a

locallyReduceAllDefs :: MonadTCEnv m => m a -> m a

shouldReduceDef :: MonadTCEnv m => QName -> m Bool

locallyReconstructed :: MonadTCEnv m => m a -> m a

isReconstructed :: MonadTCEnv m => m Bool

primFun :: QName -> Arity -> ([Arg Term] -> ReduceM (Reduced MaybeReducedArgs Term)) -> PrimFun

defClauses :: Definition -> [Clause]

defCompiled :: Definition -> Maybe CompiledClauses

defParameters :: Definition -> Maybe Nat

defInverse :: Definition -> FunctionInverse

defCompilerPragmas :: BackendName -> Definition -> [CompilerPragma]

defDelayed :: Definition -> Delayed

Are the clauses of this definition delayed?

defNonterminating :: Definition -> Bool

Has the definition failed the termination checker?

defTerminationUnconfirmed :: Definition -> Bool

Has the definition not termination checked or did the check fail?

defAbstract :: Definition -> IsAbstract

defForced :: Definition -> [IsForced]

ifTopLevelAndHighlightingLevelIsOr :: MonadTCEnv tcm => HighlightingLevel -> Bool -> tcm () -> tcm ()

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

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.

initEnv :: TCEnv

defaultUnquoteFlags :: UnquoteFlags

unquoteNormalise :: Lens' Bool UnquoteFlags

eUnquoteNormalise :: Lens' Bool TCEnv

eContext :: Lens' Context TCEnv

eLetBindings :: Lens' LetBindings TCEnv

eCurrentModule :: Lens' ModuleName TCEnv

eCurrentPath :: Lens' (Maybe AbsolutePath) TCEnv

eAnonymousModules :: Lens' [(ModuleName, Nat)] TCEnv

eImportPath :: Lens' [TopLevelModuleName] TCEnv

eMutualBlock :: Lens' (Maybe MutualId) TCEnv

eTerminationCheck :: Lens' (TerminationCheck ()) TCEnv

eCoverageCheck :: Lens' CoverageCheck TCEnv

eMakeCase :: Lens' Bool TCEnv

eSolvingConstraints :: Lens' Bool TCEnv

eCheckingWhere :: Lens' Bool TCEnv

eWorkingOnTypes :: Lens' Bool TCEnv

eAssignMetas :: Lens' Bool TCEnv

eActiveProblems :: Lens' (Set ProblemId) TCEnv

eAbstractMode :: Lens' AbstractMode TCEnv

eModality :: Lens' Modality TCEnv

eRelevance :: Lens' Relevance TCEnv

eQuantity :: Lens' Quantity TCEnv

eSplitOnStrict :: Lens' Bool TCEnv

eDisplayFormsEnabled :: Lens' Bool TCEnv

eRange :: Lens' Range TCEnv

eHighlightingRange :: Lens' Range TCEnv

eCall :: Lens' (Maybe (Closure Call)) TCEnv

eHighlightingLevel :: Lens' HighlightingLevel TCEnv

eHighlightingMethod :: Lens' HighlightingMethod TCEnv

eExpandLast :: Lens' ExpandHidden TCEnv

eAppDef :: Lens' (Maybe QName) TCEnv

eSimplification :: Lens' Simplification TCEnv

eAllowedReductions :: Lens' AllowedReductions TCEnv

eReduceDefs :: Lens' ReduceDefs TCEnv

eReconstructed :: Lens' Bool TCEnv

eInjectivityDepth :: Lens' Int TCEnv

eCompareBlocked :: Lens' Bool TCEnv

ePrintDomainFreePi :: Lens' Bool TCEnv

ePrintMetasBare :: Lens' Bool TCEnv

eInsideDotPattern :: Lens' Bool TCEnv

eUnquoteFlags :: Lens' UnquoteFlags TCEnv

eInstanceDepth :: Lens' Int TCEnv

eIsDebugPrinting :: Lens' Bool TCEnv

ePrintingPatternLambdas :: Lens' [QName] TCEnv

eCallByNeed :: Lens' Bool TCEnv

eCurrentCheckpoint :: Lens' CheckpointId TCEnv

eCheckpoints :: Lens' (Map CheckpointId Substitution) TCEnv

eGeneralizeMetas :: Lens' DoGeneralize TCEnv

eGeneralizedVars :: Lens' (Map QName GeneralizedValue) TCEnv

eActiveBackendName :: Lens' (Maybe BackendName) TCEnv

eConflComputingOverlap :: Lens' Bool TCEnv

eCurrentlyElaborating :: Lens' Bool TCEnv

aDefToMode :: IsAbstract -> AbstractMode

aModeToDef :: AbstractMode -> Maybe IsAbstract

isDontExpandLast :: ExpandHidden -> Bool

recordFieldWarningToError :: RecordFieldWarning -> TypeError

warningName :: Warning -> WarningName

tcWarningOrigin :: TCWarning -> SrcFile

sizedTypesOption :: HasOptions m => m Bool

guardednessOption :: HasOptions m => m Bool

withoutKOption :: HasOptions m => m Bool

enableCaching :: HasOptions m => m Bool

mapRedEnv :: (TCEnv -> TCEnv) -> ReduceEnv -> ReduceEnv

mapRedSt :: (TCState -> TCState) -> ReduceEnv -> ReduceEnv

mapRedEnvSt :: (TCEnv -> TCEnv) -> (TCState -> TCState) -> ReduceEnv -> ReduceEnv

reduceEnv :: Lens' TCEnv ReduceEnv

reduceSt :: Lens' TCState ReduceEnv

onReduceEnv :: (ReduceEnv -> ReduceEnv) -> ReduceM a -> ReduceM a

fmapReduce :: (a -> b) -> ReduceM a -> ReduceM b

apReduce :: ReduceM (a -> b) -> ReduceM a -> ReduceM b

thenReduce :: ReduceM a -> ReduceM b -> ReduceM b

beforeReduce :: ReduceM a -> ReduceM b -> ReduceM a

bindReduce :: ReduceM a -> (a -> ReduceM b) -> ReduceM b

runReduceM :: ReduceM a -> TCM a

runReduceF :: (a -> ReduceM b) -> TCM (a -> b)

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

askR :: ReduceM ReduceEnv

localR :: (ReduceEnv -> ReduceEnv) -> ReduceM a -> ReduceM a

asksTC :: MonadTCEnv m => (TCEnv -> a) -> m a

viewTC :: MonadTCEnv m => Lens' a TCEnv -> m a

locallyTC :: MonadTCEnv m => Lens' a TCEnv -> (a -> a) -> m b -> m b

Modify the lens-indicated part of the TCEnv in a subcomputation.

getsTC :: ReadTCState m => (TCState -> a) -> m a

modifyTC' :: MonadTCState m => (TCState -> TCState) -> m ()

A variant of modifyTC in which the computation is strict in the new state.

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

setTCLens :: MonadTCState m => Lens' a TCState -> a -> m () infix 4

Overwrite the part of the TCState focused on by the lens.

modifyTCLens :: MonadTCState m => Lens' a TCState -> (a -> a) -> m ()

Modify the part of the TCState focused on by the lens.

modifyTCLensM :: MonadTCState m => Lens' a TCState -> (a -> m a) -> m ()

Modify a part of the state monadically.

stateTCLens :: MonadTCState m => Lens' a TCState -> (a -> (r, a)) -> m r

Modify the part of the TCState focused on by the lens, and return some result.

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

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

runBlocked :: Monad m => BlockT m a -> m (Either Blocker a)

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

pureTCM :: MonadIO m => (TCState -> TCEnv -> a) -> TCMT m a

returnTCMT :: Applicative m => a -> TCMT m a

bindTCMT :: Monad m => TCMT m a -> (a -> TCMT m b) -> TCMT m b

thenTCMT :: Applicative m => TCMT m a -> TCMT m b -> TCMT m b

fmapTCMT :: Functor m => (a -> b) -> TCMT m a -> TCMT m b

apTCMT :: Applicative m => TCMT m (a -> b) -> TCMT m a -> TCMT m b

catchError_ :: TCM a -> (TCErr -> TCM a) -> TCM a

Preserve the state of the failing computation.

finally_ :: TCM a -> TCM b -> TCM a

Execute a finalizer even when an exception is thrown. Does not catch any errors. In case both the regular computation and the finalizer throw an exception, the one of the finalizer is propagated.

internalError :: (HasCallStack, MonadTCM tcm) => String -> tcm a

locatedTypeError :: MonadTCError m => (a -> TypeError) -> HasCallStack => a -> m b

Utility function for 1-arg constructed type errors. Note that the HasCallStack constraint is on the *resulting* function.

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

genericDocError :: (HasCallStack, MonadTCError m) => Doc -> m a

typeError' :: MonadTCError m => CallStack -> TypeError -> m a

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

typeError'_ :: (MonadTCEnv m, ReadTCState m) => CallStack -> TypeError -> m TCErr

typeError_ :: (HasCallStack, MonadTCEnv m, ReadTCState m) => TypeError -> m TCErr

runTCM :: MonadIO m => TCEnv -> TCState -> TCMT m a -> m (a, TCState)

Running the type checking monad (most general form).

runTCMTop :: TCM a -> IO (Either TCErr a)

Running the type checking monad on toplevel (with initial state).

runTCMTop' :: MonadIO m => TCMT m a -> m a

runSafeTCM :: TCM a -> TCState -> IO (a, TCState)

runSafeTCM runs a safe TCMT action (a TCMT action which cannot fail, except that it might raise IOExceptions) in the initial environment.

forkTCM :: TCM a -> TCM ()

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

Base name for patterns in telescopes

extendedLambdaName :: String

Base name for extended lambda patterns

isExtendedLambdaName :: QName -> Bool

Check whether we have an definition from an extended lambda.

absurdLambdaName :: String

Name of absurdLambda definitions.

isAbsurdLambdaName :: QName -> Bool

Check whether we have an definition from an absurd lambda.

generalizedFieldName :: String

Base name for generalized variable projections

getGeneralizedFieldName :: QName -> Maybe String

Check whether we have a generalized variable field

getIncludeDirs :: HasOptions m => m [AbsolutePath]

Gets the include directories.

Precondition: optAbsoluteIncludePaths must be nonempty (i.e. setCommandLineOptions must have run).

libToTCM :: LibM a -> TCM a

class (MonadTCEnv m, ReadTCState m) => MonadInteractionPoints m where

Minimal complete definition

Nothing

Methods

freshInteractionId :: m InteractionId

default freshInteractionId :: (MonadTrans t, MonadInteractionPoints n, t n ~ m) => m InteractionId

modifyInteractionPoints :: (InteractionPoints -> InteractionPoints) -> m ()

default modifyInteractionPoints :: (MonadTrans t, MonadInteractionPoints n, t n ~ m) => (InteractionPoints -> InteractionPoints) -> m ()

Instances

MonadInteractionPoints TCM

Defined in Agda.TypeChecking.Monad.MetaVars

Methods

freshInteractionId :: TCM InteractionId

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

(PureTCM m, MonadBlock m) => MonadInteractionPoints (PureConversionT m)

Defined in Agda.TypeChecking.Conversion.Pure

Methods

freshInteractionId :: PureConversionT m InteractionId

modifyInteractionPoints :: (InteractionPoints -> InteractionPoints) -> PureConversionT m ()

MonadInteractionPoints m => MonadInteractionPoints (IdentityT m)

Defined in Agda.TypeChecking.Monad.MetaVars

Methods

freshInteractionId :: IdentityT m InteractionId

modifyInteractionPoints :: (InteractionPoints -> InteractionPoints) -> IdentityT m ()

MonadInteractionPoints m => MonadInteractionPoints (ReaderT r m)

Defined in Agda.TypeChecking.Monad.MetaVars

Methods

freshInteractionId :: ReaderT r m InteractionId

modifyInteractionPoints :: (InteractionPoints -> InteractionPoints) -> ReaderT r m ()

MonadInteractionPoints m => MonadInteractionPoints (StateT s m)

Defined in Agda.TypeChecking.Monad.MetaVars

Methods

freshInteractionId :: StateT s m InteractionId

modifyInteractionPoints :: (InteractionPoints -> InteractionPoints) -> StateT s m ()

addImport :: ModuleName -> TCM ()

addImportCycleCheck :: TopLevelModuleName -> TCM a -> TCM a

getImports :: TCM (Set ModuleName)

isImported :: ModuleName -> TCM Bool

getImportPath :: TCM [TopLevelModuleName]

visitModule :: ModuleInfo -> TCM ()

setVisitedModules :: VisitedModules -> TCM ()

getVisitedModules :: ReadTCState m => m VisitedModules

getPrettyVisitedModules :: ReadTCState m => m Doc

getVisitedModule :: ReadTCState m => TopLevelModuleName -> m (Maybe ModuleInfo)

getDecodedModules :: TCM DecodedModules

setDecodedModules :: DecodedModules -> TCM ()

getDecodedModule :: TopLevelModuleName -> TCM (Maybe ModuleInfo)

storeDecodedModule :: ModuleInfo -> TCM ()

dropDecodedModule :: TopLevelModuleName -> TCM ()

withImportPath :: [TopLevelModuleName] -> TCM a -> TCM a

checkForImportCycle :: TCM ()

Assumes that the first module in the import path is the module we are worried about.

currentModule :: MonadTCEnv m => m ModuleName

Get the name of the current module, if any.

withCurrentModule :: MonadTCEnv m => ModuleName -> m a -> m a

Set the name of the current module.

getCurrentPath :: MonadTCEnv m => m AbsolutePath

Get the path of the currently checked file

getAnonymousVariables :: MonadTCEnv m => ModuleName -> m Nat

Get the number of variables bound by anonymous modules.

withAnonymousModule :: ModuleName -> Nat -> TCM a -> TCM a

Add variables bound by an anonymous module.

withEnv :: MonadTCEnv m => TCEnv -> m a -> m a

Set the current environment to the given

getEnv :: TCM TCEnv

Get the current environment

withHighlightingLevel :: HighlightingLevel -> TCM a -> TCM a

Set highlighting level

doExpandLast :: TCM a -> TCM a

Restore setting for ExpandLast to default.

dontExpandLast :: TCM a -> TCM a

reallyDontExpandLast :: TCM a -> TCM a

performedSimplification :: MonadTCEnv m => m a -> m a

If the reduced did a proper match (constructor or literal pattern), then record this as simplification step.

performedSimplification' :: MonadTCEnv m => Simplification -> m a -> m a

getSimplification :: MonadTCEnv m => m Simplification

updateAllowedReductions :: (AllowedReductions -> AllowedReductions) -> TCEnv -> TCEnv

Lens for AllowedReductions.

modifyAllowedReductions :: MonadTCEnv m => (AllowedReductions -> AllowedReductions) -> m a -> m a

putAllowedReductions :: MonadTCEnv m => AllowedReductions -> m a -> m a

onlyReduceProjections :: MonadTCEnv m => m a -> m a

Reduce Def f vs only if f is a projection.

allowAllReductions :: MonadTCEnv m => m a -> m a

Allow all reductions except for non-terminating functions (default).

allowNonTerminatingReductions :: MonadTCEnv m => m a -> m a

Allow all reductions including non-terminating functions.

onlyReduceTypes :: MonadTCEnv m => m a -> m a

Allow all reductions when reducing types. Otherwise only allow inlined functions to be unfolded.

typeLevelReductions :: MonadTCEnv m => m a -> m a

Update allowed reductions when working on types

insideDotPattern :: TCM a -> TCM a

isInsideDotPattern :: TCM Bool

callByName :: TCM a -> TCM a

Don't use call-by-need evaluation for the given computation.

class MonadTCEnv m => MonadAddContext m where

Minimal complete definition

Nothing

Methods

addCtx :: Name -> Dom Type -> m a -> m a

addCtx x arg cont add a variable to the context.

Chooses an unused Name.

Warning: Does not update module parameter substitution!

default addCtx :: (MonadAddContext n, MonadTransControl t, t n ~ m) => Name -> Dom Type -> m a -> m a

addLetBinding' :: Name -> Term -> Dom Type -> m a -> m a

Add a let bound variable to the context

default addLetBinding' :: (MonadAddContext n, MonadTransControl t, t n ~ m) => Name -> Term -> Dom Type -> m a -> m a

updateContext :: Substitution -> (Context -> Context) -> m a -> m a

Update the context. Requires a substitution that transports things living in the old context to the new.

default updateContext :: (MonadAddContext n, MonadTransControl t, t n ~ m) => Substitution -> (Context -> Context) -> m a -> m a

withFreshName :: Range -> ArgName -> (Name -> m a) -> m a

default withFreshName :: (MonadAddContext n, MonadTransControl t, t n ~ m) => Range -> ArgName -> (Name -> m a) -> m a

Instances

MonadAddContext TerM

Defined in Agda.Termination.Monad

Methods

addCtx :: Name -> Dom Type -> TerM a -> TerM a

addLetBinding' :: Name -> Term -> Dom Type -> TerM a -> TerM a

updateContext :: Substitution -> (Context -> Context) -> TerM a -> TerM a

withFreshName :: Range -> ArgName -> (Name -> TerM a) -> TerM a

MonadAddContext ReduceM

Defined in Agda.TypeChecking.Reduce.Monad

Methods

addCtx :: Name -> Dom Type -> ReduceM a -> ReduceM a

addLetBinding' :: Name -> Term -> Dom Type -> ReduceM a -> ReduceM a

updateContext :: Substitution -> (Context -> Context) -> ReduceM a -> ReduceM a

withFreshName :: Range -> ArgName -> (Name -> ReduceM a) -> ReduceM a

MonadAddContext TCM

Defined in Agda.TypeChecking.Monad.Context

Methods

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

addLetBinding' :: Name -> Term -> Dom Type -> TCM a -> TCM a

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

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

MonadAddContext NLM

Defined in Agda.TypeChecking.Rewriting.NonLinMatch

Methods

addCtx :: Name -> Dom Type -> NLM a -> NLM a

addLetBinding' :: Name -> Term -> Dom Type -> NLM a -> NLM a

updateContext :: Substitution -> (Context -> Context) -> NLM a -> NLM a

withFreshName :: Range -> ArgName -> (Name -> NLM a) -> NLM a

MonadAddContext m => MonadAddContext (PureConversionT m)

Defined in Agda.TypeChecking.Conversion.Pure

Methods

addCtx :: Name -> Dom Type -> PureConversionT m a -> PureConversionT m a

addLetBinding' :: Name -> Term -> Dom Type -> PureConversionT m a -> PureConversionT m a

updateContext :: Substitution -> (Context -> Context) -> PureConversionT m a -> PureConversionT m a

withFreshName :: Range -> ArgName -> (Name -> PureConversionT m a) -> PureConversionT m a

MonadAddContext m => MonadAddContext (BlockT m)

Defined in Agda.TypeChecking.Monad.Context

Methods

addCtx :: Name -> Dom Type -> BlockT m a -> BlockT m a

addLetBinding' :: Name -> Term -> Dom Type -> BlockT m a -> BlockT m a

updateContext :: Substitution -> (Context -> Context) -> BlockT m a -> BlockT m a

withFreshName :: Range -> ArgName -> (Name -> BlockT m a) -> BlockT m a

MonadAddContext m => MonadAddContext (NamesT m)

Defined in Agda.TypeChecking.Names

Methods

addCtx :: Name -> Dom Type -> NamesT m a -> NamesT m a

addLetBinding' :: Name -> Term -> Dom Type -> NamesT m a -> NamesT m a

updateContext :: Substitution -> (Context -> Context) -> NamesT m a -> NamesT m a

withFreshName :: Range -> ArgName -> (Name -> NamesT m a) -> NamesT m a

MonadAddContext m => MonadAddContext (ListT m)

Defined in Agda.TypeChecking.Monad.Context

Methods

addCtx :: Name -> Dom Type -> ListT m a -> ListT m a

addLetBinding' :: Name -> Term -> Dom Type -> ListT m a -> ListT m a

updateContext :: Substitution -> (Context -> Context) -> ListT m a -> ListT m a

withFreshName :: Range -> ArgName -> (Name -> ListT m a) -> ListT m a

MonadAddContext m => MonadAddContext (MaybeT m)

Defined in Agda.TypeChecking.Monad.Context

Methods

addCtx :: Name -> Dom Type -> MaybeT m a -> MaybeT m a

addLetBinding' :: Name -> Term -> Dom Type -> MaybeT m a -> MaybeT m a

updateContext :: Substitution -> (Context -> Context) -> MaybeT m a -> MaybeT m a

withFreshName :: Range -> ArgName -> (Name -> MaybeT m a) -> MaybeT m a

MonadAddContext m => MonadAddContext (ExceptT e m)

Defined in Agda.TypeChecking.Monad.Context

Methods

addCtx :: Name -> Dom Type -> ExceptT e m a -> ExceptT e m a

addLetBinding' :: Name -> Term -> Dom Type -> ExceptT e m a -> ExceptT e m a

updateContext :: Substitution -> (Context -> Context) -> ExceptT e m a -> ExceptT e m a

withFreshName :: Range -> ArgName -> (Name -> ExceptT e m a) -> ExceptT e m a

MonadAddContext m => MonadAddContext (IdentityT m)

Defined in Agda.TypeChecking.Monad.Context

Methods

addCtx :: Name -> Dom Type -> IdentityT m a -> IdentityT m a

addLetBinding' :: Name -> Term -> Dom Type -> IdentityT m a -> IdentityT m a

updateContext :: Substitution -> (Context -> Context) -> IdentityT m a -> IdentityT m a

withFreshName :: Range -> ArgName -> (Name -> IdentityT m a) -> IdentityT m a

MonadAddContext m => MonadAddContext (ReaderT r m)

Defined in Agda.TypeChecking.Monad.Context

Methods

addCtx :: Name -> Dom Type -> ReaderT r m a -> ReaderT r m a

addLetBinding' :: Name -> Term -> Dom Type -> ReaderT r m a -> ReaderT r m a

updateContext :: Substitution -> (Context -> Context) -> ReaderT r m a -> ReaderT r m a

withFreshName :: Range -> ArgName -> (Name -> ReaderT r m a) -> ReaderT r m a

MonadAddContext m => MonadAddContext (StateT r m)

Defined in Agda.TypeChecking.Monad.Context

Methods

addCtx :: Name -> Dom Type -> StateT r m a -> StateT r m a

addLetBinding' :: Name -> Term -> Dom Type -> StateT r m a -> StateT r m a

updateContext :: Substitution -> (Context -> Context) -> StateT r m a -> StateT r m a

withFreshName :: Range -> ArgName -> (Name -> StateT r m a) -> StateT r m a

(Monoid w, MonadAddContext m) => MonadAddContext (WriterT w m)

Defined in Agda.TypeChecking.Monad.Context

Methods

addCtx :: Name -> Dom Type -> WriterT w m a -> WriterT w m a

addLetBinding' :: Name -> Term -> Dom Type -> WriterT w m a -> WriterT w m a

updateContext :: Substitution -> (Context -> Context) -> WriterT w m a -> WriterT w m a

withFreshName :: Range -> ArgName -> (Name -> WriterT w m a) -> WriterT w m a

checkpointSubstitution :: MonadTCEnv tcm => CheckpointId -> tcm Substitution

Get the substitution from the context at a given checkpoint to the current context.

class (Functor m, Applicative m, MonadFail m) => HasBuiltins m where

Minimal complete definition

Nothing

Methods

getBuiltinThing :: String -> m (Maybe (Builtin PrimFun))

default getBuiltinThing :: (MonadTrans t, HasBuiltins n, t n ~ m) => String -> m (Maybe (Builtin PrimFun))

Instances

HasBuiltins AbsToCon

Defined in Agda.Syntax.Translation.AbstractToConcrete

Methods

getBuiltinThing :: String -> AbsToCon (Maybe (Builtin PrimFun))

HasBuiltins TerM

Defined in Agda.Termination.Monad

Methods

getBuiltinThing :: String -> TerM (Maybe (Builtin PrimFun))

HasBuiltins ReduceM

Defined in Agda.TypeChecking.Reduce.Monad

Methods

getBuiltinThing :: String -> ReduceM (Maybe (Builtin PrimFun))

HasBuiltins NLM

Defined in Agda.TypeChecking.Rewriting.NonLinMatch

Methods

getBuiltinThing :: String -> NLM (Maybe (Builtin PrimFun))

HasBuiltins m => HasBuiltins (PureConversionT m)

Defined in Agda.TypeChecking.Conversion.Pure

Methods

getBuiltinThing :: String -> PureConversionT m (Maybe (Builtin PrimFun))

HasBuiltins m => HasBuiltins (BlockT m)

Defined in Agda.TypeChecking.Monad.Builtin

Methods

getBuiltinThing :: String -> BlockT m (Maybe (Builtin PrimFun))

MonadIO m => HasBuiltins (TCMT m)

Defined in Agda.TypeChecking.Monad.Builtin

Methods

getBuiltinThing :: String -> TCMT m (Maybe (Builtin PrimFun))

HasBuiltins m => HasBuiltins (NamesT m)

Defined in Agda.TypeChecking.Names

Methods

getBuiltinThing :: String -> NamesT m (Maybe (Builtin PrimFun))

HasBuiltins m => HasBuiltins (ListT m)

Defined in Agda.TypeChecking.Monad.Builtin

Methods

getBuiltinThing :: String -> ListT m (Maybe (Builtin PrimFun))

HasBuiltins m => HasBuiltins (MaybeT m)

Defined in Agda.TypeChecking.Monad.Builtin

Methods

getBuiltinThing :: String -> MaybeT m (Maybe (Builtin PrimFun))

HasBuiltins m => HasBuiltins (ExceptT e m)

Defined in Agda.TypeChecking.Monad.Builtin

Methods

getBuiltinThing :: String -> ExceptT e m (Maybe (Builtin PrimFun))

HasBuiltins m => HasBuiltins (IdentityT m)

Defined in Agda.TypeChecking.Monad.Builtin

Methods

getBuiltinThing :: String -> IdentityT m (Maybe (Builtin PrimFun))

HasBuiltins m => HasBuiltins (ReaderT e m)

Defined in Agda.TypeChecking.Monad.Builtin

Methods

getBuiltinThing :: String -> ReaderT e m (Maybe (Builtin PrimFun))

HasBuiltins m => HasBuiltins (StateT s m)

Defined in Agda.TypeChecking.Monad.Builtin

Methods

getBuiltinThing :: String -> StateT s m (Maybe (Builtin PrimFun))

(HasBuiltins m, Monoid w) => HasBuiltins (WriterT w m)

Defined in Agda.TypeChecking.Monad.Builtin

Methods

getBuiltinThing :: String -> WriterT w m (Maybe (Builtin PrimFun))

class TraceS a where

Debug print some lines if the verbosity level for the given VerboseKey is at least VerboseLevel.

Note: In the presence of OverloadedStrings, just @ traceS key level "Literate string" gives an Ambiguous type variable error in GHC@. Use the legacy functions traceSLn and traceSDoc instead then.

Methods

traceS :: MonadDebug m => VerboseKey -> VerboseLevel -> a -> m c -> m c

Instances

TraceS Doc

Defined in Agda.TypeChecking.Monad.Debug

Methods

traceS :: MonadDebug m => VerboseKey -> VerboseLevel -> Doc -> m c -> m c

TraceS String

Defined in Agda.TypeChecking.Monad.Debug

Methods

traceS :: MonadDebug m => VerboseKey -> VerboseLevel -> String -> m c -> m c

TraceS (TCM Doc)

Defined in Agda.TypeChecking.Monad.Debug

Methods

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

TraceS [TCM Doc]

Defined in Agda.TypeChecking.Monad.Debug

Methods

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

TraceS [Doc]

Defined in Agda.TypeChecking.Monad.Debug

Methods

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

TraceS [String]

Defined in Agda.TypeChecking.Monad.Debug

Methods

traceS :: MonadDebug m => VerboseKey -> VerboseLevel -> [String] -> m c -> m c

class ReportS a where

Debug print some lines if the verbosity level for the given VerboseKey is at least VerboseLevel.

Note: In the presence of OverloadedStrings, just @ reportS key level "Literate string" gives an Ambiguous type variable error in GHC@. Use the legacy functions reportSLn and reportSDoc instead then.

Methods

reportS :: MonadDebug m => VerboseKey -> VerboseLevel -> a -> m ()

Instances

ReportS Doc

Defined in Agda.TypeChecking.Monad.Debug

Methods

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

ReportS String

Defined in Agda.TypeChecking.Monad.Debug

Methods

reportS :: MonadDebug m => VerboseKey -> VerboseLevel -> String -> m ()

ReportS (TCM Doc)

Defined in Agda.TypeChecking.Monad.Debug

Methods

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

ReportS [TCM Doc]

Defined in Agda.TypeChecking.Monad.Debug

Methods

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

ReportS [Doc]

Defined in Agda.TypeChecking.Monad.Debug

Methods

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

ReportS [String]

Defined in Agda.TypeChecking.Monad.Debug

Methods

reportS :: MonadDebug m => VerboseKey -> VerboseLevel -> [String] -> m ()

defaultGetVerbosity :: HasOptions m => m Verbosity

defaultIsDebugPrinting :: MonadTCEnv m => m Bool

defaultNowDebugPrinting :: MonadTCEnv m => m a -> m a

displayDebugMessage :: MonadDebug m => VerboseKey -> VerboseLevel -> String -> m ()

Print a debug message if switched on.

catchAndPrintImpossible :: (CatchImpossible m, Monad m) => VerboseKey -> VerboseLevel -> m String -> m String

During printing, catch internal errors of kind Impossible and print them.

reportSLn :: MonadDebug m => VerboseKey -> VerboseLevel -> String -> m ()

Conditionally println debug string.

__IMPOSSIBLE_VERBOSE__ :: (HasCallStack, MonadDebug m) => String -> m a

reportSDoc :: MonadDebug m => VerboseKey -> VerboseLevel -> TCM Doc -> m ()

Conditionally render debug Doc and print it.

reportResult :: MonadDebug m => VerboseKey -> VerboseLevel -> (a -> TCM Doc) -> m a -> m a

Debug print the result of a computation.

unlessDebugPrinting :: MonadDebug m => m () -> m ()

traceSLn :: MonadDebug m => VerboseKey -> VerboseLevel -> String -> m a -> m a

traceSDoc :: MonadDebug m => VerboseKey -> VerboseLevel -> TCM Doc -> m a -> m a

Conditionally render debug Doc, print it, and then continue.

openVerboseBracket :: MonadDebug m => VerboseKey -> VerboseLevel -> String -> m ()

closeVerboseBracket :: MonadDebug m => VerboseKey -> VerboseLevel -> m ()

closeVerboseBracketException :: MonadDebug m => VerboseKey -> VerboseLevel -> m ()

parseVerboseKey :: VerboseKey -> [String]

hasVerbosity :: MonadDebug m => VerboseKey -> VerboseLevel -> m Bool

Check whether a certain verbosity level is activated.

Precondition: The level must be non-negative.

hasExactVerbosity :: MonadDebug m => VerboseKey -> VerboseLevel -> m Bool

Check whether a certain verbosity level is activated (exact match).

whenExactVerbosity :: MonadDebug m => VerboseKey -> VerboseLevel -> m () -> m ()

Run a computation if a certain verbosity level is activated (exact match).

__CRASH_WHEN__ :: (HasCallStack, MonadTCM m, MonadDebug m) => VerboseKey -> VerboseLevel -> m ()

verboseS :: MonadDebug m => VerboseKey -> VerboseLevel -> m () -> m ()

Run a computation if a certain verbosity level is activated.

Precondition: The level must be non-negative.

applyWhenVerboseS :: MonadDebug m => VerboseKey -> VerboseLevel -> (m a -> m a) -> m a -> m a

Apply a function if a certain verbosity level is activated.

Precondition: The level must be non-negative.

verbosity :: VerboseKey -> Lens' VerboseLevel TCState

Verbosity lens.

class ReadTCState m => MonadStatistics m where

Minimal complete definition

Nothing

Methods

modifyCounter :: String -> (Integer -> Integer) -> m ()

default modifyCounter :: (MonadStatistics n, MonadTrans t, t n ~ m) => String -> (Integer -> Integer) -> m ()

Instances

MonadStatistics TerM

Defined in Agda.Termination.Monad

Methods

modifyCounter :: String -> (Integer -> Integer) -> TerM ()

MonadStatistics TCM

Defined in Agda.TypeChecking.Monad.Statistics

Methods

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

ReadTCState m => MonadStatistics (PureConversionT m)

Defined in Agda.TypeChecking.Conversion.Pure

Methods

modifyCounter :: String -> (Integer -> Integer) -> PureConversionT m ()

MonadStatistics m => MonadStatistics (MaybeT m)

Defined in Agda.TypeChecking.Monad.Statistics

Methods

modifyCounter :: String -> (Integer -> Integer) -> MaybeT m ()

MonadStatistics m => MonadStatistics (ExceptT e m)

Defined in Agda.TypeChecking.Monad.Statistics

Methods

modifyCounter :: String -> (Integer -> Integer) -> ExceptT e m ()

MonadStatistics m => MonadStatistics (ReaderT r m)

Defined in Agda.TypeChecking.Monad.Statistics

Methods

modifyCounter :: String -> (Integer -> Integer) -> ReaderT r m ()

MonadStatistics m => MonadStatistics (StateT s m)

Defined in Agda.TypeChecking.Monad.Statistics

Methods

modifyCounter :: String -> (Integer -> Integer) -> StateT s m ()

(MonadStatistics m, Monoid w) => MonadStatistics (WriterT w m)

Defined in Agda.TypeChecking.Monad.Statistics

Methods

modifyCounter :: String -> (Integer -> Integer) -> WriterT w m ()

getStatistics :: ReadTCState m => m Statistics

Get the statistics.

modifyStatistics :: (Statistics -> Statistics) -> TCM ()

Modify the statistics via given function.

tick :: MonadStatistics m => String -> m ()

Increase specified counter by 1.

tickN :: MonadStatistics m => String -> Integer -> m ()

Increase specified counter by n.

tickMax :: MonadStatistics m => String -> Integer -> m ()

Set the specified counter to the maximum of its current value and n.

printStatistics :: (MonadDebug m, MonadTCEnv m, HasOptions m) => Int -> Maybe TopLevelModuleName -> Statistics -> m ()

Print the given statistics if verbosity "profile.ticks" is given.

class (Functor m, Applicative m, MonadFail m, HasOptions m, MonadDebug m, MonadTCEnv m) => HasConstInfo m where

Minimal complete definition

Nothing

Methods

getConstInfo :: QName -> m Definition

Lookup the definition of a name. The result is a closed thing, all free variables have been abstracted over.

getConstInfo' :: QName -> m (Either SigError Definition)

Version that reports exceptions:

default getConstInfo' :: (HasConstInfo n, MonadTrans t, m ~ t n) => QName -> m (Either SigError Definition)

getRewriteRulesFor :: QName -> m RewriteRules

Lookup the rewrite rules with the given head symbol.

default getRewriteRulesFor :: (HasConstInfo n, MonadTrans t, m ~ t n) => QName -> m RewriteRules

Instances

HasConstInfo TerM

Defined in Agda.Termination.Monad

Methods

getConstInfo :: QName -> TerM Definition

getConstInfo' :: QName -> TerM (Either SigError Definition)

getRewriteRulesFor :: QName -> TerM RewriteRules

HasConstInfo ReduceM

Defined in Agda.TypeChecking.Reduce.Monad

Methods

getConstInfo :: QName -> ReduceM Definition

getConstInfo' :: QName -> ReduceM (Either SigError Definition)

getRewriteRulesFor :: QName -> ReduceM RewriteRules

HasConstInfo NLM

Defined in Agda.TypeChecking.Rewriting.NonLinMatch

Methods

getConstInfo :: QName -> NLM Definition

getConstInfo' :: QName -> NLM (Either SigError Definition)

getRewriteRulesFor :: QName -> NLM RewriteRules

HasConstInfo m => HasConstInfo (PureConversionT m)

Defined in Agda.TypeChecking.Conversion.Pure

Methods

getConstInfo :: QName -> PureConversionT m Definition

getConstInfo' :: QName -> PureConversionT m (Either SigError Definition)

getRewriteRulesFor :: QName -> PureConversionT m RewriteRules

HasConstInfo m => HasConstInfo (BlockT m)

Defined in Agda.TypeChecking.Monad.Signature

Methods

getConstInfo :: QName -> BlockT m Definition

getConstInfo' :: QName -> BlockT m (Either SigError Definition)

getRewriteRulesFor :: QName -> BlockT m RewriteRules

HasConstInfo (TCMT IO)

Defined in Agda.TypeChecking.Monad.Signature

Methods

getConstInfo :: QName -> TCMT IO Definition

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

getRewriteRulesFor :: QName -> TCMT IO RewriteRules

HasConstInfo m => HasConstInfo (NamesT m)

Defined in Agda.TypeChecking.Names

Methods

getConstInfo :: QName -> NamesT m Definition

getConstInfo' :: QName -> NamesT m (Either SigError Definition)

getRewriteRulesFor :: QName -> NamesT m RewriteRules

HasConstInfo m => HasConstInfo (ListT m)

Defined in Agda.TypeChecking.Monad.Signature

Methods

getConstInfo :: QName -> ListT m Definition

getConstInfo' :: QName -> ListT m (Either SigError Definition)

getRewriteRulesFor :: QName -> ListT m RewriteRules

HasConstInfo m => HasConstInfo (ChangeT m)

Defined in Agda.TypeChecking.Monad.Signature

Methods

getConstInfo :: QName -> ChangeT m Definition

getConstInfo' :: QName -> ChangeT m (Either SigError Definition)

getRewriteRulesFor :: QName -> ChangeT m RewriteRules

HasConstInfo m => HasConstInfo (MaybeT m)

Defined in Agda.TypeChecking.Monad.Signature

Methods

getConstInfo :: QName -> MaybeT m Definition

getConstInfo' :: QName -> MaybeT m (Either SigError Definition)

getRewriteRulesFor :: QName -> MaybeT m RewriteRules

HasConstInfo m => HasConstInfo (ExceptT err m)

Defined in Agda.TypeChecking.Monad.Signature

Methods

getConstInfo :: QName -> ExceptT err m Definition

getConstInfo' :: QName -> ExceptT err m (Either SigError Definition)

getRewriteRulesFor :: QName -> ExceptT err m RewriteRules

HasConstInfo m => HasConstInfo (IdentityT m)

Defined in Agda.TypeChecking.Monad.Signature

Methods

getConstInfo :: QName -> IdentityT m Definition

getConstInfo' :: QName -> IdentityT m (Either SigError Definition)

getRewriteRulesFor :: QName -> IdentityT m RewriteRules

HasConstInfo m => HasConstInfo (ReaderT r m)

Defined in Agda.TypeChecking.Monad.Signature

Methods

getConstInfo :: QName -> ReaderT r m Definition

getConstInfo' :: QName -> ReaderT r m (Either SigError Definition)

getRewriteRulesFor :: QName -> ReaderT r m RewriteRules

HasConstInfo m => HasConstInfo (StateT s m)

Defined in Agda.TypeChecking.Monad.Signature

Methods

getConstInfo :: QName -> StateT s m Definition

getConstInfo' :: QName -> StateT s m (Either SigError Definition)

getRewriteRulesFor :: QName -> StateT s m RewriteRules

(Monoid w, HasConstInfo m) => HasConstInfo (WriterT w m)

Defined in Agda.TypeChecking.Monad.Signature

Methods

getConstInfo :: QName -> WriterT w m Definition

getConstInfo' :: QName -> WriterT w m (Either SigError Definition)

getRewriteRulesFor :: QName -> WriterT w m RewriteRules

data SigError

Signature lookup errors.

Constructors

SigUnknown String

The name is not in the signature; default error message.

SigAbstract

The name is not available, since it is abstract.

lookupSection :: (Functor m, ReadTCState m) => ModuleName -> m Telescope

Lookup a section telescope.

If it doesn't exist, like in hierarchical top-level modules, the section telescope is empty.

inFreshModuleIfFreeParams :: TCM a -> TCM a

Unless all variables in the context are module parameters, create a fresh module to capture the non-module parameters. Used when unquoting to make sure generated definitions work properly.

class (HasBuiltins m, HasConstInfo m, MonadAddContext m, MonadDebug m, MonadReduce m, MonadTCEnv m, ReadTCState m) => PureTCM m

Instances

PureTCM TerM

Defined in Agda.Termination.Monad

PureTCM ReduceM

Defined in Agda.TypeChecking.Reduce.Monad

PureTCM TCM

Defined in Agda.TypeChecking.Monad.Pure

PureTCM NLM

Defined in Agda.TypeChecking.Rewriting.NonLinMatch

(HasBuiltins m, HasConstInfo m, MonadAddContext m, MonadReduce m) => PureTCM (PureConversionT m)

Defined in Agda.TypeChecking.Conversion.Pure

PureTCM m => PureTCM (BlockT m)

Defined in Agda.TypeChecking.Monad.Pure

(HasBuiltins m, HasConstInfo m, MonadAddContext m, MonadReduce m) => PureTCM (NamesT m)

Defined in Agda.TypeChecking.Names

PureTCM m => PureTCM (ListT m)

Defined in Agda.TypeChecking.Monad.Pure

PureTCM m => PureTCM (MaybeT m)

Defined in Agda.TypeChecking.Monad.Pure

PureTCM m => PureTCM (ExceptT e m)

Defined in Agda.TypeChecking.Monad.Pure

PureTCM m => PureTCM (IdentityT m)

Defined in Agda.TypeChecking.Monad.Pure

PureTCM m => PureTCM (ReaderT r m)

Defined in Agda.TypeChecking.Monad.Pure

PureTCM m => PureTCM (StateT s m)

Defined in Agda.TypeChecking.Monad.Pure

(PureTCM m, Monoid w) => PureTCM (WriterT w m)

Defined in Agda.TypeChecking.Monad.Pure

cachingStarts :: (MonadDebug m, MonadTCState m, ReadTCState m) => m ()

To be called before any write or restore calls.

areWeCaching :: ReadTCState m => m Bool

writeToCurrentLog :: (MonadDebug m, MonadTCState m, ReadTCState m) => TypeCheckAction -> m ()

Writes a TypeCheckAction to the current log, using the current PostScopeState

restorePostScopeState :: (MonadDebug m, MonadTCState m) => PostScopeState -> m ()

localCache :: (MonadTCState m, ReadTCState m) => m a -> m a

Runs the action and restores the current cache at the end of it.

withoutCache :: (MonadTCState m, ReadTCState m) => m a -> m a

Runs the action without cache and restores the current cache at the end of it.

readFromCachedLog :: (MonadDebug m, MonadTCState m, ReadTCState m) => m (Maybe (TypeCheckAction, PostScopeState))

Reads the next entry in the cached type check log, if present.

cleanCachedLog :: (MonadDebug m, MonadTCState m) => m ()

Empties the "to read" CachedState. To be used when it gets invalid.

activateLoadedFileCache :: (HasOptions m, MonadDebug m, MonadTCState m) => m ()

Makes sure that the stLoadedFileCache is Just, with a clean current log. Crashes is stLoadedFileCache is already active with a dirty log. Should be called when we start typechecking the current file.

cacheCurrentLog :: (MonadDebug m, MonadTCState m) => m ()

Caches the current type check log. Discardes the old cache. Does nothing if caching is inactive.

data SpeculateResult

Constructors

SpeculateAbort

SpeculateCommit

resetState :: TCM ()

Resets the non-persistent part of the type checking state.

resetAllState :: TCM ()

Resets all of the type checking state.

Keep only Benchmark and backend information.

localTCState :: TCM a -> TCM a

Restore TCState after performing subcomputation.

In contrast to localState, the Benchmark info from the subcomputation is saved.

localTCStateSaving :: TCM a -> TCM (a, TCState)

Same as localTCState but also returns the state in which we were just before reverting it.

localTCStateSavingWarnings :: TCM a -> TCM a

Same as localTCState but keep all warnings.

speculateTCState :: TCM (a, SpeculateResult) -> TCM a

Allow rolling back the state changes of a TCM computation.

speculateTCState_ :: TCM SpeculateResult -> TCM ()

freshTCM :: TCM a -> TCM (Either TCErr a)

A fresh TCM instance.

The computation is run in a fresh state, with the exception that the persistent state is preserved. If the computation changes the state, then these changes are ignored, except for changes to the persistent state. (Changes to the persistent state are also ignored if errors other than type errors or IO exceptions are encountered.)

lensPersistentState :: Lens' PersistentTCState TCState

updatePersistentState :: (PersistentTCState -> PersistentTCState) -> TCState -> TCState

modifyPersistentState :: (PersistentTCState -> PersistentTCState) -> TCM ()

lensAccumStatisticsP :: Lens' Statistics PersistentTCState

Lens for stAccumStatistics.

lensAccumStatistics :: Lens' Statistics TCState

getScope :: ReadTCState m => m ScopeInfo

Get the current scope.

setScope :: ScopeInfo -> TCM ()

Set the current scope.

modifyScope_ :: MonadTCState m => (ScopeInfo -> ScopeInfo) -> m ()

Modify the current scope without updating the inverse maps.

modifyScope :: MonadTCState m => (ScopeInfo -> ScopeInfo) -> m ()

Modify the current scope.

useScope :: ReadTCState m => Lens' a ScopeInfo -> m a

Get a part of the current scope.

locallyScope :: ReadTCState m => Lens' a ScopeInfo -> (a -> a) -> m b -> m b

Run a computation in a modified scope.

withScope :: ReadTCState m => ScopeInfo -> m a -> m (a, ScopeInfo)

Run a computation in a local scope.

withScope_ :: ReadTCState m => ScopeInfo -> m a -> m a

Same as withScope, but discard the scope from the computation.

localScope :: TCM a -> TCM a

Discard any changes to the scope by a computation.

notInScopeError :: QName -> TCM a

Scope error.

notInScopeWarning :: QName -> TCM ()

printScope :: String -> Int -> String -> TCM ()

Debug print the scope.

modifySignature :: MonadTCState m => (Signature -> Signature) -> m ()

modifyImportedSignature :: MonadTCState m => (Signature -> Signature) -> m ()

getSignature :: ReadTCState m => m Signature

modifyGlobalDefinition :: MonadTCState m => QName -> (Definition -> Definition) -> m ()

Update a possibly imported definition. Warning: changes made to imported definitions (during type checking) will not persist outside the current module. This function is currently used to update the compiled representation of a function during compilation.

setSignature :: MonadTCState m => Signature -> m ()

withSignature :: (ReadTCState m, MonadTCState m) => Signature -> m a -> m a

Run some computation in a different signature, restore original signature.

addRewriteRulesFor :: QName -> RewriteRules -> [QName] -> Signature -> Signature

setMatchableSymbols :: QName -> [QName] -> Signature -> Signature

lookupDefinition :: QName -> Signature -> Maybe Definition

updateDefinitions :: (Definitions -> Definitions) -> Signature -> Signature

updateDefinition :: QName -> (Definition -> Definition) -> Signature -> Signature

updateTheDef :: (Defn -> Defn) -> Definition -> Definition

updateDefType :: (Type -> Type) -> Definition -> Definition

updateDefArgOccurrences :: ([Occurrence] -> [Occurrence]) -> Definition -> Definition

updateDefPolarity :: ([Polarity] -> [Polarity]) -> Definition -> Definition

updateDefCompiledRep :: (CompiledRepresentation -> CompiledRepresentation) -> Definition -> Definition

addCompilerPragma :: BackendName -> CompilerPragma -> Definition -> Definition

updateFunClauses :: ([Clause] -> [Clause]) -> Defn -> Defn

updateCovering :: ([Clause] -> [Clause]) -> Defn -> Defn

updateCompiledClauses :: (Maybe CompiledClauses -> Maybe CompiledClauses) -> Defn -> Defn

updateDefCopatternLHS :: (Bool -> Bool) -> Definition -> Definition

updateDefBlocked :: (Blocked_ -> Blocked_) -> Definition -> Definition

setTopLevelModule :: QName -> TCM ()

Set the top-level module. This affects the global module id of freshly generated names.

withTopLevelModule :: QName -> TCM a -> TCM a

Use a different top-level module for a computation. Used when generating names for imported modules.

currentModuleNameHash :: ReadTCState m => m ModuleNameHash

addForeignCode :: BackendName -> String -> TCM ()

getInteractionOutputCallback :: ReadTCState m => m InteractionOutputCallback

appInteractionOutputCallback :: Response -> TCM ()

setInteractionOutputCallback :: InteractionOutputCallback -> TCM ()

getPatternSyns :: ReadTCState m => m PatternSynDefns

setPatternSyns :: PatternSynDefns -> TCM ()

modifyPatternSyns :: (PatternSynDefns -> PatternSynDefns) -> TCM ()

Lens for stPatternSyns.

getPatternSynImports :: ReadTCState m => m PatternSynDefns

getAllPatternSyns :: ReadTCState m => m PatternSynDefns

Get both local and imported pattern synonyms

lookupPatternSyn :: AmbiguousQName -> TCM PatternSynDefn

lookupSinglePatternSyn :: QName -> TCM PatternSynDefn

theBenchmark :: TCState -> Benchmark

Lens getter for Benchmark from TCState.

updateBenchmark :: (Benchmark -> Benchmark) -> TCState -> TCState

Lens map for Benchmark.

modifyBenchmark :: (Benchmark -> Benchmark) -> TCM ()

Lens modify for Benchmark.

addImportedInstances :: Signature -> TCM ()

Look through the signature and reconstruct the instance table.

updateInstanceDefs :: (TempInstanceTable -> TempInstanceTable) -> TCState -> TCState

Lens for stInstanceDefs.

modifyInstanceDefs :: (TempInstanceTable -> TempInstanceTable) -> TCM ()

getAllInstanceDefs :: TCM TempInstanceTable

getAnonInstanceDefs :: TCM (Set QName)

clearAnonInstanceDefs :: TCM ()

Remove all instances whose type is still unresolved.

addUnknownInstance :: QName -> TCM ()

Add an instance whose type is still unresolved.

addNamedInstance

Arguments

:: QName

Name of the instance.

-> QName

Name of the class.

-> TCM ()

Add instance to some `class'.

class (MonadTCEnv m, ReadTCState m) => MonadTrace m where

Minimal complete definition

traceClosureCall

Methods

traceCall :: Call -> m a -> m a

Record a function call in the trace.

traceCallM :: m Call -> m a -> m a

traceCallCPS :: Call -> ((a -> m b) -> m b) -> (a -> m b) -> m b

Reset envCall to previous value in the continuation.

Caveat: if the last traceCall did not set an interestingCall, for example, only set the Range' with Call, we will revert to the last interesting call.

traceClosureCall :: Closure Call -> m a -> m a

printHighlightingInfo :: RemoveTokenBasedHighlighting -> HighlightingInfo -> m ()

Lispify and print the given highlighting information.

default printHighlightingInfo :: (MonadTrans t, MonadTrace n, t n ~ m) => RemoveTokenBasedHighlighting -> HighlightingInfo -> m ()

Instances

MonadTrace TCM

Defined in Agda.TypeChecking.Monad.Trace

Methods

traceCall :: Call -> TCM a -> TCM a

traceCallM :: TCM Call -> TCM a -> TCM a

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

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

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

MonadTrace m => MonadTrace (ExceptT e m)

Defined in Agda.TypeChecking.Monad.Trace

Methods

traceCall :: Call -> ExceptT e m a -> ExceptT e m a

traceCallM :: ExceptT e m Call -> ExceptT e m a -> ExceptT e m a

traceCallCPS :: Call -> ((a -> ExceptT e m b) -> ExceptT e m b) -> (a -> ExceptT e m b) -> ExceptT e m b

traceClosureCall :: Closure Call -> ExceptT e m a -> ExceptT e m a

printHighlightingInfo :: RemoveTokenBasedHighlighting -> HighlightingInfo -> ExceptT e m ()

MonadTrace m => MonadTrace (IdentityT m)

Defined in Agda.TypeChecking.Monad.Trace

Methods

traceCall :: Call -> IdentityT m a -> IdentityT m a

traceCallM :: IdentityT m Call -> IdentityT m a -> IdentityT m a

traceCallCPS :: Call -> ((a -> IdentityT m b) -> IdentityT m b) -> (a -> IdentityT m b) -> IdentityT m b

traceClosureCall :: Closure Call -> IdentityT m a -> IdentityT m a

printHighlightingInfo :: RemoveTokenBasedHighlighting -> HighlightingInfo -> IdentityT m ()

MonadTrace m => MonadTrace (ReaderT r m)

Defined in Agda.TypeChecking.Monad.Trace

Methods

traceCall :: Call -> ReaderT r m a -> ReaderT r m a

traceCallM :: ReaderT r m Call -> ReaderT r m a -> ReaderT r m a

traceCallCPS :: Call -> ((a -> ReaderT r m b) -> ReaderT r m b) -> (a -> ReaderT r m b) -> ReaderT r m b

traceClosureCall :: Closure Call -> ReaderT r m a -> ReaderT r m a

printHighlightingInfo :: RemoveTokenBasedHighlighting -> HighlightingInfo -> ReaderT r m ()

MonadTrace m => MonadTrace (StateT s m)

Defined in Agda.TypeChecking.Monad.Trace

Methods

traceCall :: Call -> StateT s m a -> StateT s m a

traceCallM :: StateT s m Call -> StateT s m a -> StateT s m a

traceCallCPS :: Call -> ((a -> StateT s m b) -> StateT s m b) -> (a -> StateT s m b) -> StateT s m b

traceClosureCall :: Closure Call -> StateT s m a -> StateT s m a

printHighlightingInfo :: RemoveTokenBasedHighlighting -> HighlightingInfo -> StateT s m ()

(MonadTrace m, Monoid w) => MonadTrace (WriterT w m)

Defined in Agda.TypeChecking.Monad.Trace

Methods

traceCall :: Call -> WriterT w m a -> WriterT w m a

traceCallM :: WriterT w m Call -> WriterT w m a -> WriterT w m a

traceCallCPS :: Call -> ((a -> WriterT w m b) -> WriterT w m b) -> (a -> WriterT w m b) -> WriterT w m b

traceClosureCall :: Closure Call -> WriterT w m a -> WriterT w m a

printHighlightingInfo :: RemoveTokenBasedHighlighting -> HighlightingInfo -> WriterT w m ()

interestingCall :: Call -> Bool

getCurrentRange :: MonadTCEnv m => m Range

setCurrentRange :: (MonadTrace m, HasRange x) => x -> m a -> m a

Sets the current range (for error messages etc.) to the range of the given object, if it has a range (i.e., its range is not noRange).

highlightAsTypeChecked

Arguments

:: MonadTrace m

=> Range

rPre

-> Range

r

-> m a

-> m a

highlightAsTypeChecked rPre r m runs m and returns its result. Additionally, some code may be highlighted:

• If r is non-empty and not a sub-range of rPre (after continuousPerLine has been applied to both): r is highlighted as being type-checked while m is running (this highlighting is removed if m completes successfully).
• Otherwise: Highlighting is removed for rPre - r before m runs, and if m completes successfully, then rPre - r is highlighted as being type-checked.

noMutualBlock :: TCM a -> TCM a

inMutualBlock :: (MutualId -> TCM a) -> TCM a

Pass the current mutual block id or create a new mutual block if we are not already inside on.

setMutualBlockInfo :: MutualId -> MutualInfo -> TCM ()

Set the mutual block info for a block, possibly overwriting the existing one.

insertMutualBlockInfo :: MutualId -> MutualInfo -> TCM ()

Set the mutual block info for a block if non-existing.

setMutualBlock :: MutualId -> QName -> TCM ()

Set the mutual block for a definition.

currentOrFreshMutualBlock :: TCM MutualId

Get the current mutual block, if any, otherwise a fresh mutual block is returned.

lookupMutualBlock :: MutualId -> TCM MutualBlock

mutualBlockOf :: QName -> TCM MutualId

Reverse lookup of a mutual block id for a names.

enterClosure :: (MonadTCEnv m, ReadTCState m, LensClosure a c) => c -> (a -> m b) -> m b

withClosure :: (MonadTCEnv m, ReadTCState m) => Closure a -> (a -> m b) -> m (Closure b)

mapClosure :: (MonadTCEnv m, ReadTCState m) => (a -> m b) -> Closure a -> m (Closure b)

class (MonadTCEnv m, ReadTCState m, MonadError TCErr m, MonadBlock m, HasOptions m, MonadDebug m) => MonadConstraint m where

Monad service class containing methods for adding and solving constraints

Methods

addConstraint :: Blocker -> Constraint -> m ()

Unconditionally add the constraint.

addAwakeConstraint :: Blocker -> Constraint -> m ()

Add constraint as awake constraint.

solveConstraint :: Constraint -> m ()

solveSomeAwakeConstraints :: (ProblemConstraint -> Bool) -> Bool -> m ()

Solve awake constraints matching the predicate. If the second argument is True solve constraints even if already isSolvingConstraints.

wakeConstraints :: (ProblemConstraint -> WakeUp) -> m ()

stealConstraints :: ProblemId -> m ()

modifyAwakeConstraints :: (Constraints -> Constraints) -> m ()

modifySleepingConstraints :: (Constraints -> Constraints) -> m ()

Instances

MonadConstraint TCM

Defined in Agda.TypeChecking.Constraints

Methods

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

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

solveConstraint :: Constraint -> TCM ()

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

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

stealConstraints :: ProblemId -> TCM ()

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

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

(PureTCM m, MonadBlock m) => MonadConstraint (PureConversionT m)

Defined in Agda.TypeChecking.Conversion.Pure

Methods

addConstraint :: Blocker -> Constraint -> PureConversionT m ()

addAwakeConstraint :: Blocker -> Constraint -> PureConversionT m ()

solveConstraint :: Constraint -> PureConversionT m ()

solveSomeAwakeConstraints :: (ProblemConstraint -> Bool) -> Bool -> PureConversionT m ()

wakeConstraints :: (ProblemConstraint -> WakeUp) -> PureConversionT m ()

stealConstraints :: ProblemId -> PureConversionT m ()

modifyAwakeConstraints :: (Constraints -> Constraints) -> PureConversionT m ()

modifySleepingConstraints :: (Constraints -> Constraints) -> PureConversionT m ()

MonadConstraint m => MonadConstraint (ReaderT e m)

Defined in Agda.TypeChecking.Monad.Constraints

Methods

addConstraint :: Blocker -> Constraint -> ReaderT e m ()

addAwakeConstraint :: Blocker -> Constraint -> ReaderT e m ()

solveConstraint :: Constraint -> ReaderT e m ()

solveSomeAwakeConstraints :: (ProblemConstraint -> Bool) -> Bool -> ReaderT e m ()

wakeConstraints :: (ProblemConstraint -> WakeUp) -> ReaderT e m ()

stealConstraints :: ProblemId -> ReaderT e m ()

modifyAwakeConstraints :: (Constraints -> Constraints) -> ReaderT e m ()

modifySleepingConstraints :: (Constraints -> Constraints) -> ReaderT e m ()

data ConstraintStatus

Constructors

AwakeConstraint

SleepingConstraint

Instances

Show ConstraintStatus

Defined in Agda.TypeChecking.Monad.Constraints

Methods

showsPrec :: Int -> ConstraintStatus -> ShowS

show :: ConstraintStatus -> String

showList :: [ConstraintStatus] -> ShowS

Eq ConstraintStatus

Defined in Agda.TypeChecking.Monad.Constraints

Methods

(==) :: ConstraintStatus -> ConstraintStatus -> Bool

(/=) :: ConstraintStatus -> ConstraintStatus -> Bool

solvingProblem :: MonadConstraint m => ProblemId -> m a -> m a

solvingProblems :: MonadConstraint m => Set ProblemId -> m a -> m a

isProblemSolved :: (MonadTCEnv m, ReadTCState m) => ProblemId -> m Bool

getConstraintsForProblem :: ReadTCState m => ProblemId -> m Constraints

getAwakeConstraints :: ReadTCState m => m Constraints

Get the awake constraints

dropConstraints :: MonadConstraint m => (ProblemConstraint -> Bool) -> m ()

takeConstraints :: MonadConstraint m => (ProblemConstraint -> Bool) -> m Constraints

Takes out all constraints matching given filter. Danger! The taken constraints need to be solved or put back at some point.

putConstraintsToSleep :: MonadConstraint m => (ProblemConstraint -> Bool) -> m ()

putAllConstraintsToSleep :: MonadConstraint m => m ()

holdConstraints :: (ConstraintStatus -> ProblemConstraint -> Bool) -> TCM a -> TCM a

Suspend constraints matching the predicate during the execution of the second argument. Caution: held sleeping constraints will not be woken up by events that would normally trigger a wakeup call.

takeAwakeConstraint :: MonadConstraint m => m (Maybe ProblemConstraint)

takeAwakeConstraint' :: MonadConstraint m => (ProblemConstraint -> Bool) -> m (Maybe ProblemConstraint)

getAllConstraints :: ReadTCState m => m Constraints

withConstraint :: MonadConstraint m => (Constraint -> m a) -> ProblemConstraint -> m a

buildProblemConstraint :: (MonadTCEnv m, ReadTCState m) => Set ProblemId -> Blocker -> Constraint -> m ProblemConstraint

buildProblemConstraint_ :: (MonadTCEnv m, ReadTCState m) => Blocker -> Constraint -> m ProblemConstraint

buildConstraint :: Blocker -> Constraint -> TCM ProblemConstraint

addAndUnblocker :: MonadBlock m => Blocker -> m a -> m a

addOrUnblocker :: MonadBlock m => Blocker -> m a -> m a

addConstraint' :: Blocker -> Constraint -> TCM ()

Add new a constraint

addAwakeConstraint' :: Blocker -> Constraint -> TCM ()

addConstraintTo :: Lens' Constraints TCState -> Blocker -> Constraint -> TCM ()

nowSolvingConstraints :: MonadTCEnv m => m a -> m a

Start solving constraints

isSolvingConstraints :: MonadTCEnv m => m Bool

catchConstraint :: MonadConstraint m => Constraint -> m () -> m ()

Add constraint if the action raises a pattern violation

mapAwakeConstraints :: (Constraints -> Constraints) -> TCState -> TCState

mapSleepingConstraints :: (Constraints -> Constraints) -> TCState -> TCState

setPragmaOptions :: PragmaOptions -> TCM ()

Sets the pragma options.

setCommandLineOptions :: CommandLineOptions -> TCM ()

Sets the command line options (both persistent and pragma options are updated).

Relative include directories are made absolute with respect to the current working directory. If the include directories have changed (thus, they are Left now, and were previously Right something), then the state is reset (completely, see setIncludeDirs) .

An empty list of relative include directories (Left []) is interpreted as ["."].

setCommandLineOptions'

Arguments

:: AbsolutePath

The base directory of relative paths.

-> CommandLineOptions

-> TCM ()

getAgdaLibFiles :: FilePath -> TCM [AgdaLibFile]

getLibraryOptions :: FilePath -> TCM [OptionsPragma]

setLibraryPaths

Arguments

:: AbsolutePath

The base directory of relative paths.

-> CommandLineOptions

-> TCM CommandLineOptions

setLibraryIncludes :: CommandLineOptions -> TCM CommandLineOptions

addDefaultLibraries

Arguments

:: AbsolutePath

The base directory of relative paths.

-> CommandLineOptions

-> TCM CommandLineOptions

addTrustedExecutables :: CommandLineOptions -> TCM CommandLineOptions

setOptionsFromPragma :: OptionsPragma -> TCM ()

enableDisplayForms :: MonadTCEnv m => m a -> m a

Disable display forms.

disableDisplayForms :: MonadTCEnv m => m a -> m a

Disable display forms.

displayFormsEnabled :: MonadTCEnv m => m Bool

Check if display forms are enabled.

setIncludeDirs

Arguments

:: [FilePath]

New include directories.

-> AbsolutePath

The base directory of relative paths.

-> TCM ()

Makes the given directories absolute and stores them as include directories.

If the include directories change, then the state is reset (completely, except for the include directories and some other things).

An empty list is interpreted as ["."].

isPropEnabled :: HasOptions m => m Bool

isTwoLevelEnabled :: HasOptions m => m Bool

hasUniversePolymorphism :: HasOptions m => m Bool

showImplicitArguments :: HasOptions m => m Bool

showIrrelevantArguments :: HasOptions m => m Bool

showIdentitySubstitutions :: HasOptions m => m Bool

withShowAllArguments :: ReadTCState m => m a -> m a

Switch on printing of implicit and irrelevant arguments. E.g. for reification in with-function generation.

Restores all PragmaOptions after completion. Thus, do not attempt to make persistent PragmaOptions changes in a withShowAllArguments bracket.

withShowAllArguments' :: ReadTCState m => Bool -> m a -> m a

withPragmaOptions :: ReadTCState m => (PragmaOptions -> PragmaOptions) -> m a -> m a

Change PragmaOptions for a computation and restore afterwards.

positivityCheckEnabled :: HasOptions m => m Bool

typeInType :: HasOptions m => m Bool

etaEnabled :: HasOptions m => m Bool

maxInstanceSearchDepth :: HasOptions m => m Int

maxInversionDepth :: HasOptions m => m Int

getLanguage :: HasOptions m => m Language

Returns the Language currently in effect.

makeOpen :: (ReadTCState m, MonadTCEnv m) => a -> m (Open a)

Create an open term in the current context.

getOpen :: (TermSubst a, MonadTCEnv m) => Open a -> m a

Extract the value from an open term. The checkpoint at which it was created must be in scope.

tryGetOpen :: (TermSubst a, ReadTCState m, MonadTCEnv m) => (Substitution -> a -> Maybe a) -> Open a -> m (Maybe a)

Extract the value from an open term. If the checkpoint is no longer in scope use the provided function to pull the object to the most recent common checkpoint. The function is given the substitution from the common ancestor to the checkpoint of the thing.

isClosed :: Open a -> Bool

An Open is closed if it has checkpoint 0.

newtype KeepNames a

Wrapper to tell addContext not to mark names as TypeError. Used when adding a user-provided, but already type checked, telescope to the context.

Constructors

KeepNames a

Instances

AddContext (KeepNames Telescope)

Defined in Agda.TypeChecking.Monad.Context

Methods

addContext :: MonadAddContext m => KeepNames Telescope -> m a -> m a

contextSize :: KeepNames Telescope -> Nat

AddContext (KeepNames String, Dom Type)

Defined in Agda.TypeChecking.Monad.Context

Methods

addContext :: MonadAddContext m => (KeepNames String, Dom Type) -> m a -> m a

contextSize :: (KeepNames String, Dom Type) -> Nat

class AddContext b where

Various specializations of addCtx.

Methods

addContext :: MonadAddContext m => b -> m a -> m a

contextSize :: b -> Nat

Instances

AddContext Name

Defined in Agda.TypeChecking.Monad.Context

Methods

addContext :: MonadAddContext m => Name -> m a -> m a

contextSize :: Name -> Nat

AddContext Telescope

Defined in Agda.TypeChecking.Monad.Context

Methods

addContext :: MonadAddContext m => Telescope -> m a -> m a

contextSize :: Telescope -> Nat

AddContext String

Defined in Agda.TypeChecking.Monad.Context

Methods

addContext :: MonadAddContext m => String -> m a -> m a

contextSize :: String -> Nat

AddContext (Dom Type)

Defined in Agda.TypeChecking.Monad.Context

Methods

addContext :: MonadAddContext m => Dom Type -> m a -> m a

contextSize :: Dom Type -> Nat

AddContext (Dom (Name, Type))

Defined in Agda.TypeChecking.Monad.Context

Methods

addContext :: MonadAddContext m => Dom (Name, Type) -> m a -> m a

contextSize :: Dom (Name, Type) -> Nat

AddContext (Dom (String, Type))

Defined in Agda.TypeChecking.Monad.Context

Methods

addContext :: MonadAddContext m => Dom (String, Type) -> m a -> m a

contextSize :: Dom (String, Type) -> Nat

AddContext (KeepNames Telescope)

Defined in Agda.TypeChecking.Monad.Context

Methods

addContext :: MonadAddContext m => KeepNames Telescope -> m a -> m a

contextSize :: KeepNames Telescope -> Nat

AddContext a => AddContext [a]

Defined in Agda.TypeChecking.Monad.Context

Methods

addContext :: MonadAddContext m => [a] -> m a0 -> m a0

contextSize :: [a] -> Nat

AddContext (Name, Dom Type)

Defined in Agda.TypeChecking.Monad.Context

Methods

addContext :: MonadAddContext m => (Name, Dom Type) -> m a -> m a

contextSize :: (Name, Dom Type) -> Nat

AddContext (KeepNames String, Dom Type)

Defined in Agda.TypeChecking.Monad.Context

Methods

addContext :: MonadAddContext m => (KeepNames String, Dom Type) -> m a -> m a

contextSize :: (KeepNames String, Dom Type) -> Nat

AddContext (List1 Name, Dom Type)

Defined in Agda.TypeChecking.Monad.Context

Methods

addContext :: MonadAddContext m => (List1 Name, Dom Type) -> m a -> m a

contextSize :: (List1 Name, Dom Type) -> Nat

AddContext (List1 (Arg Name), Type)

Defined in Agda.TypeChecking.Monad.Context

Methods

addContext :: MonadAddContext m => (List1 (Arg Name), Type) -> m a -> m a

contextSize :: (List1 (Arg Name), Type) -> Nat

AddContext (List1 (NamedArg Name), Type)

Defined in Agda.TypeChecking.Monad.Context

Methods

addContext :: MonadAddContext m => (List1 (NamedArg Name), Type) -> m a -> m a

contextSize :: (List1 (NamedArg Name), Type) -> Nat

AddContext (List1 (WithHiding Name), Dom Type)

Defined in Agda.TypeChecking.Monad.Context

Methods

addContext :: MonadAddContext m => (List1 (WithHiding Name), Dom Type) -> m a -> m a

contextSize :: (List1 (WithHiding Name), Dom Type) -> Nat

AddContext (String, Dom Type)

Defined in Agda.TypeChecking.Monad.Context

Methods

addContext :: MonadAddContext m => (String, Dom Type) -> m a -> m a

contextSize :: (String, Dom Type) -> Nat

AddContext ([Name], Dom Type)

Defined in Agda.TypeChecking.Monad.Context

Methods

addContext :: MonadAddContext m => ([Name], Dom Type) -> m a -> m a

contextSize :: ([Name], Dom Type) -> Nat

AddContext ([Arg Name], Type)

Defined in Agda.TypeChecking.Monad.Context

Methods

addContext :: MonadAddContext m => ([Arg Name], Type) -> m a -> m a

contextSize :: ([Arg Name], Type) -> Nat

AddContext ([NamedArg Name], Type)

Defined in Agda.TypeChecking.Monad.Context

Methods

addContext :: MonadAddContext m => ([NamedArg Name], Type) -> m a -> m a

contextSize :: ([NamedArg Name], Type) -> Nat

AddContext ([WithHiding Name], Dom Type)

Defined in Agda.TypeChecking.Monad.Context

Methods

addContext :: MonadAddContext m => ([WithHiding Name], Dom Type) -> m a -> m a

contextSize :: ([WithHiding Name], Dom Type) -> Nat

unsafeModifyContext :: MonadTCEnv tcm => (Context -> Context) -> tcm a -> tcm a

Modify a Context in a computation. Warning: does not update the checkpoints. Use updateContext instead.

modifyContextInfo :: MonadTCEnv tcm => (forall e. Dom e -> Dom e) -> tcm a -> tcm a

Modify the Dom' part of context entries.

inTopContext :: (MonadTCEnv tcm, ReadTCState tcm) => tcm a -> tcm a

Change to top (=empty) context. Resets the checkpoints.

unsafeInTopContext :: (MonadTCEnv m, ReadTCState m) => m a -> m a

Change to top (=empty) context, but don't update the checkpoints. Totally not safe!

unsafeEscapeContext :: MonadTCM tcm => Int -> tcm a -> tcm a

Delete the last n bindings from the context.

Doesn't update checkpoints! Use escapeContext or `updateContext rho (drop n)` instead, for an appropriate substitution rho.

escapeContext :: MonadAddContext m => Impossible -> Int -> m a -> m a

Delete the last n bindings from the context. Any occurrences of these variables are replaced with the given err.

checkpoint :: (MonadDebug tcm, MonadTCM tcm, MonadFresh CheckpointId tcm, ReadTCState tcm) => Substitution -> tcm a -> tcm a

Add a new checkpoint. Do not use directly!

checkpointSubstitution' :: MonadTCEnv tcm => CheckpointId -> tcm (Maybe Substitution)

Get the substitution from the context at a given checkpoint to the current context.

getModuleParameterSub :: (MonadTCEnv m, ReadTCState m) => ModuleName -> m (Maybe Substitution)

Get substitution Γ ⊢ ρ : Γm where Γ is the current context and Γm is the module parameter telescope of module m.

Returns Nothing in case the we don't have a checkpoint for m.

defaultAddCtx :: MonadAddContext m => Name -> Dom Type -> m a -> m a

Default implementation of addCtx in terms of updateContext

withFreshName_ :: MonadAddContext m => ArgName -> (Name -> m a) -> m a

withShadowingNameTCM :: Name -> TCM b -> TCM b

Run the given TCM action, and register the given variable as being shadowed by all the names with the same root that are added to the context during this TCM action.

addRecordNameContext :: (MonadAddContext m, MonadFresh NameId m) => Dom Type -> m b -> m b

underAbstraction :: (Subst a, MonadAddContext m) => Dom Type -> Abs a -> (a -> m b) -> m b

Go under an abstraction. Do not extend context in case of NoAbs.

underAbstraction' :: (Subst a, MonadAddContext m, AddContext (name, Dom Type)) => (String -> name) -> Dom Type -> Abs a -> (a -> m b) -> m b

underAbstractionAbs :: (Subst a, MonadAddContext m) => Dom Type -> Abs a -> (a -> m b) -> m b

Go under an abstraction, treating NoAbs as Abs.

underAbstractionAbs' :: (Subst a, MonadAddContext m, AddContext (name, Dom Type)) => (String -> name) -> Dom Type -> Abs a -> (a -> m b) -> m b

underAbstraction_ :: (Subst a, MonadAddContext m) => Abs a -> (a -> m b) -> m b

Go under an abstract without worrying about the type to add to the context.

mapAbstraction :: (Subst a, Subst b, MonadAddContext m) => Dom Type -> (a -> m b) -> Abs a -> m (Abs b)

Map a monadic function on the thing under the abstraction, adding the abstracted variable to the context.

getLetBindings :: MonadTCM tcm => tcm [(Name, (Term, Dom Type))]

defaultAddLetBinding' :: (ReadTCState m, MonadTCEnv m) => Name -> Term -> Dom Type -> m a -> m a

Add a let bound variable

addLetBinding :: MonadAddContext m => ArgInfo -> Name -> Term -> Type -> m a -> m a

Add a let bound variable

getContext :: MonadTCEnv m => m [Dom (Name, Type)]

Get the current context.

getContextSize :: (Applicative m, MonadTCEnv m) => m Nat

Get the size of the current context.

getContextArgs :: (Applicative m, MonadTCEnv m) => m Args

Generate [var (n - 1), ..., var 0] for all declarations in the context.

getContextTerms :: (Applicative m, MonadTCEnv m) => m [Term]

Generate [var (n - 1), ..., var 0] for all declarations in the context.

getContextTelescope :: (Applicative m, MonadTCEnv m) => m Telescope

Get the current context as a Telescope.

getContextNames :: (Applicative m, MonadTCEnv m) => m [Name]

Get the names of all declarations in the context.

lookupBV' :: MonadTCEnv m => Nat -> m (Maybe (Dom (Name, Type)))

get type of bound variable (i.e. deBruijn index)

lookupBV :: (MonadFail m, MonadTCEnv m) => Nat -> m (Dom (Name, Type))

domOfBV :: (Applicative m, MonadFail m, MonadTCEnv m) => Nat -> m (Dom Type)

typeOfBV :: (Applicative m, MonadFail m, MonadTCEnv m) => Nat -> m Type

nameOfBV' :: (Applicative m, MonadFail m, MonadTCEnv m) => Nat -> m (Maybe Name)

nameOfBV :: (Applicative m, MonadFail m, MonadTCEnv m) => Nat -> m Name

getVarInfo :: (MonadFail m, MonadTCEnv m) => Name -> m (Term, Dom Type)

Get the term corresponding to a named variable. If it is a lambda bound variable the deBruijn index is returned and if it is a let bound variable its definition is returned.

data SortKit

Sort primitives.

Constructors

SortKit

Fields

• nameOfSet :: QName
• nameOfProp :: QName
• nameOfSSet :: QName
• nameOfSetOmega :: IsFibrant -> QName

data CoinductionKit

The coinductive primitives.

Constructors

CoinductionKit

Fields

• nameOfInf :: QName
• nameOfSharp :: QName
• nameOfFlat :: QName

litType :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => Literal -> m Type

setBuiltinThings :: BuiltinThings PrimFun -> TCM ()

bindBuiltinName :: String -> Term -> TCM ()

bindPrimitive :: String -> PrimFun -> TCM ()

getBuiltin :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => String -> m Term

getBuiltin' :: HasBuiltins m => String -> m (Maybe Term)

getPrimitive' :: HasBuiltins m => String -> m (Maybe PrimFun)

getPrimitive :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => String -> m PrimFun

getPrimitiveTerm :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => String -> m Term

getPrimitiveTerm' :: HasBuiltins m => String -> m (Maybe Term)

getTerm' :: HasBuiltins m => String -> m (Maybe Term)

getName' :: HasBuiltins m => String -> m (Maybe QName)

getTerm :: HasBuiltins m => String -> String -> m Term

getTerm use name looks up name as a primitive or builtin, and throws an error otherwise. The use argument describes how the name is used for the sake of the error message.

constructorForm :: HasBuiltins m => Term -> m Term

Rewrite a literal to constructor form if possible.

constructorForm' :: Applicative m => m Term -> m Term -> Term -> m Term

primInteger :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primIntegerPos :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primIntegerNegSuc :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primFloat :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primChar :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primString :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primBool :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primSigma :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primUnit :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primUnitUnit :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primTrue :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primFalse :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primList :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primNil :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primCons :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primMaybe :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primNothing :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primJust :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primIO :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primId :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primConId :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primIdElim :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primPath :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primPathP :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primInterval :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primIZero :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primIOne :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primIMin :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primIMax :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primINeg :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primPartial :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primPartialP :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primIsOne :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primItIsOne :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primTrans :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primHComp :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primEquiv :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primEquivFun :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primEquivProof :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primTranspProof :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

prim_glueU :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

prim_unglueU :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primGlue :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

prim_glue :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

prim_unglue :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primFaceForall :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primIsOne1 :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primIsOne2 :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primIsOneEmpty :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primSub :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primSubIn :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primSubOut :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primNat :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primSuc :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primZero :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primNatPlus :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primNatMinus :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primNatTimes :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primNatDivSucAux :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primNatModSucAux :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primNatEquality :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primNatLess :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primWord64 :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primSizeUniv :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primSize :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primSizeLt :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primSizeSuc :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primSizeInf :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primSizeMax :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primInf :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primSharp :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primFlat :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primEquality :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primRefl :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primRewrite :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primLevel :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primLevelZero :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primLevelSuc :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primLevelMax :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primSet :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primProp :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primSetOmega :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primLockUniv :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primSSetOmega :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primStrictSet :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primFromNat :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primFromNeg :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primFromString :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primQName :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primArg :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primArgArg :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAbs :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAbsAbs :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaSort :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primHiding :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primHidden :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primInstance :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primVisible :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primRelevance :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primRelevant :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primIrrelevant :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primQuantity :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primQuantity0 :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primQuantityω :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primModality :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primModalityConstructor :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAssoc :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAssocLeft :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAssocRight :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAssocNon :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primPrecedence :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primPrecRelated :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primPrecUnrelated :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primFixity :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primFixityFixity :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primArgInfo :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primArgArgInfo :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaSortSet :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaSortLit :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaSortProp :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaSortPropLit :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaSortInf :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaSortUnsupported :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaTerm :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaTermVar :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaTermLam :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaTermExtLam :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaTermDef :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaTermCon :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaTermPi :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaTermSort :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaTermLit :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaTermUnsupported :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaTermMeta :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaErrorPart :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaErrorPartString :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaErrorPartTerm :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaErrorPartName :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaLiteral :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaLitNat :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaLitWord64 :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaLitFloat :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaLitChar :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaLitString :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaLitQName :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaLitMeta :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaPattern :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaPatCon :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaPatVar :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaPatDot :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaPatLit :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaPatProj :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaPatAbsurd :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaClause :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaClauseClause :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaClauseAbsurd :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaDefinitionFunDef :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaDefinitionDataDef :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaDefinitionRecordDef :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaDefinitionDataConstructor :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaDefinitionPostulate :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaDefinitionPrimitive :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaDefinition :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaMeta :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaTCM :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaTCMReturn :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaTCMBind :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaTCMUnify :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaTCMTypeError :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaTCMInferType :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaTCMCheckType :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaTCMNormalise :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaTCMReduce :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaTCMCatchError :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaTCMGetContext :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaTCMExtendContext :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaTCMInContext :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaTCMFreshName :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaTCMDeclareDef :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaTCMDeclarePostulate :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaTCMDefineFun :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaTCMGetType :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaTCMGetDefinition :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaTCMQuoteTerm :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaTCMQuoteOmegaTerm :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaTCMUnquoteTerm :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaTCMBlockOnMeta :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaTCMCommit :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaTCMIsMacro :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaTCMWithNormalisation :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaTCMWithReconsParams :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaTCMDebugPrint :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaTCMOnlyReduceDefs :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaTCMDontReduceDefs :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaTCMNoConstraints :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaTCMRunSpeculative :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

primAgdaTCMExec :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => m Term

coinductionKit' :: TCM CoinductionKit

Tries to build a CoinductionKit.

coinductionKit :: TCM (Maybe CoinductionKit)

sortKit :: HasBuiltins m => m SortKit

getPrimName :: Term -> QName

getBuiltinName' :: HasBuiltins m => String -> m (Maybe QName)

getPrimitiveName' :: HasBuiltins m => String -> m (Maybe QName)

isPrimitive :: HasBuiltins m => String -> QName -> m Bool

intervalView' :: HasBuiltins m => m (Term -> IntervalView)

intervalView :: HasBuiltins m => Term -> m IntervalView

intervalUnview :: HasBuiltins m => IntervalView -> m Term

intervalUnview' :: HasBuiltins m => m (IntervalView -> Term)

pathView :: HasBuiltins m => Type -> m PathView

Check whether the type is actually an path (lhs ≡ rhs) and extract lhs, rhs, and their type.

Precondition: type is reduced.

pathView' :: HasBuiltins m => m (Type -> PathView)

idViewAsPath :: HasBuiltins m => Type -> m PathView

Non dependent Path

boldPathView :: Type -> PathView

pathUnview :: PathView -> Type

Revert the PathView.

Postcondition: type is reduced.

primEqualityName :: TCM QName

Get the name of the equality type.

equalityView :: Type -> TCM EqualityView

Check whether the type is actually an equality (lhs ≡ rhs) and extract lhs, rhs, and their type.

Precondition: type is reduced.

equalityUnview :: EqualityView -> Type

Revert the EqualityView.

Postcondition: type is reduced.

constrainedPrims :: [String]

Primitives with typechecking constrants.

getNameOfConstrained :: HasBuiltins m => String -> m (Maybe QName)

type SizeMaxView' = [DeepSizeView]

type SizeMaxView = NonEmpty DeepSizeView

data SizeViewComparable a

Constructors

NotComparable

YesAbove DeepSizeView a

YesBelow DeepSizeView a

Instances

Functor SizeViewComparable

Defined in Agda.TypeChecking.Monad.SizedTypes

Methods

fmap :: (a -> b) -> SizeViewComparable a -> SizeViewComparable b

(<$) :: a -> SizeViewComparable b -> SizeViewComparable a

data DeepSizeView

A deep view on sizes.

Constructors

DSizeInf

DSizeVar ProjectedVar Offset

DSizeMeta MetaId Elims Offset

DOtherSize Term

Instances

Pretty DeepSizeView

Defined in Agda.TypeChecking.Monad.SizedTypes

Methods

pretty :: DeepSizeView -> Doc

prettyPrec :: Int -> DeepSizeView -> Doc

prettyList :: [DeepSizeView] -> Doc

Show DeepSizeView

Defined in Agda.TypeChecking.Monad.SizedTypes

Methods

showsPrec :: Int -> DeepSizeView -> ShowS

show :: DeepSizeView -> String

showList :: [DeepSizeView] -> ShowS

type Offset = Nat

data ProjectedVar

A de Bruijn index under some projections.

Constructors

ProjectedVar

Fields

• pvIndex :: Int
• prProjs :: [(ProjOrigin, QName)]

Instances

Show ProjectedVar

Defined in Agda.TypeChecking.Monad.SizedTypes

Methods

showsPrec :: Int -> ProjectedVar -> ShowS

show :: ProjectedVar -> String

showList :: [ProjectedVar] -> ShowS

Eq ProjectedVar

Ignore ProjOrigin in equality test.

Defined in Agda.TypeChecking.Monad.SizedTypes

Methods

(==) :: ProjectedVar -> ProjectedVar -> Bool

(/=) :: ProjectedVar -> ProjectedVar -> Bool

data SizeView

A useful view on sizes.

Constructors

SizeInf

SizeSuc Term

OtherSize Term

class IsSizeType a where

Check if a type is the primSize type. The argument should be reduced.

Methods

isSizeType :: (HasOptions m, HasBuiltins m) => a -> m (Maybe BoundedSize)

Instances

IsSizeType Term

Defined in Agda.TypeChecking.Monad.SizedTypes

Methods

isSizeType :: (HasOptions m, HasBuiltins m) => Term -> m (Maybe BoundedSize)

IsSizeType CompareAs

Defined in Agda.TypeChecking.Monad.SizedTypes

Methods

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

IsSizeType a => IsSizeType (Dom a)

Defined in Agda.TypeChecking.Monad.SizedTypes

Methods

isSizeType :: (HasOptions m, HasBuiltins m) => Dom a -> m (Maybe BoundedSize)

IsSizeType a => IsSizeType (Type' a)

Defined in Agda.TypeChecking.Monad.SizedTypes

Methods

isSizeType :: (HasOptions m, HasBuiltins m) => Type' a -> m (Maybe BoundedSize)

IsSizeType a => IsSizeType (b, a)

Defined in Agda.TypeChecking.Monad.SizedTypes

Methods

isSizeType :: (HasOptions m, HasBuiltins m) => (b, a) -> m (Maybe BoundedSize)

data BoundedSize

Result of querying whether size variable i is bounded by another size.

Constructors

BoundedLt Term

yes i : Size< t

BoundedNo

Instances

Show BoundedSize

Defined in Agda.TypeChecking.Monad.SizedTypes

Methods

showsPrec :: Int -> BoundedSize -> ShowS

show :: BoundedSize -> String

showList :: [BoundedSize] -> ShowS

Eq BoundedSize

Defined in Agda.TypeChecking.Monad.SizedTypes

Methods

(==) :: BoundedSize -> BoundedSize -> Bool

(/=) :: BoundedSize -> BoundedSize -> Bool

isSizeTypeTest :: (HasOptions m, HasBuiltins m) => m (Term -> Maybe BoundedSize)

getBuiltinDefName :: HasBuiltins m => String -> m (Maybe QName)

getBuiltinSize :: HasBuiltins m => m (Maybe QName, Maybe QName)

isSizeNameTest :: (HasOptions m, HasBuiltins m) => m (QName -> Bool)

isSizeNameTestRaw :: (HasOptions m, HasBuiltins m) => m (QName -> Bool)

haveSizedTypes :: TCM Bool

Test whether OPTIONS --sized-types and whether the size built-ins are defined.

haveSizeLt :: TCM Bool

Test whether the SIZELT builtin is defined.

builtinSizeHook :: String -> QName -> Type -> TCM ()

Add polarity info to a SIZE builtin.

sizeSort :: Sort

The sort of built-in types SIZE and SIZELT.

sizeUniv :: Type

The type of built-in types SIZE and SIZELT.

sizeType_ :: QName -> Type

The built-in type SIZE with user-given name.

sizeType :: (HasBuiltins m, MonadTCEnv m, ReadTCState m) => m Type

The built-in type SIZE.

sizeSucName :: (HasBuiltins m, HasOptions m) => m (Maybe QName)

The name of SIZESUC.

sizeSuc :: HasBuiltins m => Nat -> Term -> m Term

sizeSuc_ :: QName -> Term -> Term

sizeMax :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => NonEmpty Term -> m Term

Transform list of terms into a term build from binary maximum.

sizeView :: (HasBuiltins m, MonadTCEnv m, ReadTCState m) => Term -> m SizeView

Expects argument to be reduced.

viewProjectedVar :: Term -> Maybe ProjectedVar

unviewProjectedVar :: ProjectedVar -> Term

sizeViewComparable :: DeepSizeView -> DeepSizeView -> SizeViewComparable ()

sizeViewComparable v w checks whether v >= w (then Left) or v <= w (then Right). If uncomparable, it returns NotComparable.

sizeViewSuc_ :: QName -> DeepSizeView -> DeepSizeView

sizeViewPred :: Nat -> DeepSizeView -> DeepSizeView

sizeViewPred k v decrements v by k (must be possible!).

sizeViewOffset :: DeepSizeView -> Maybe Offset

sizeViewOffset v returns the number of successors or Nothing when infty.

removeSucs :: (DeepSizeView, DeepSizeView) -> (DeepSizeView, DeepSizeView)

Remove successors common to both sides.

unSizeView :: SizeView -> TCM Term

Turn a size view into a term.

unDeepSizeView :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => DeepSizeView -> m Term

maxViewMax :: SizeMaxView -> SizeMaxView -> SizeMaxView

maxViewCons :: DeepSizeView -> SizeMaxView -> SizeMaxView

maxViewCons v ws = max v ws. It only adds v to ws if it is not subsumed by an element of ws.

sizeViewComparableWithMax :: DeepSizeView -> SizeMaxView -> SizeViewComparable SizeMaxView'

sizeViewComparableWithMax v ws tries to find w in ws that compares with v and singles this out. Precondition: v /= DSizeInv.

maxViewSuc_ :: QName -> SizeMaxView -> SizeMaxView

unMaxView :: (HasBuiltins m, MonadError TCErr m, MonadTCEnv m, ReadTCState m) => SizeMaxView -> m Term

addConstant :: QName -> Definition -> TCM ()

Add a constant to the signature. Lifts the definition to top level.

addConstant' :: QName -> ArgInfo -> QName -> Type -> Defn -> TCM ()

A combination of addConstant and defaultDefn. The Language does not need to be supplied.

setTerminates :: QName -> Bool -> TCM ()

Set termination info of a defined function symbol.

setCompiledClauses :: QName -> CompiledClauses -> TCM ()

Set CompiledClauses of a defined function symbol.

setSplitTree :: QName -> SplitTree -> TCM ()

Set SplitTree of a defined function symbol.

modifyFunClauses :: QName -> ([Clause] -> [Clause]) -> TCM ()

Modify the clauses of a function.

addClauses :: QName -> [Clause] -> TCM ()

Lifts clauses to the top-level and adds them to definition. Also adjusts the funCopatternLHS field if necessary.

mkPragma :: String -> TCM CompilerPragma

addPragma :: BackendName -> QName -> String -> TCM ()

Add a compiler pragma `{-# COMPILE backend name text #-}`

getUniqueCompilerPragma :: BackendName -> QName -> TCM (Maybe CompilerPragma)

setFunctionFlag :: FunctionFlag -> Bool -> QName -> TCM ()

markStatic :: QName -> TCM ()

markInline :: Bool -> QName -> TCM ()

markInjective :: QName -> TCM ()

unionSignatures :: [Signature] -> Signature

addSection :: ModuleName -> TCM ()

Add a section to the signature.

The current context will be stored as the cumulative module parameters for this section.

setModuleCheckpoint :: ModuleName -> TCM ()

Sets the checkpoint for the given module to the current checkpoint.

getSection :: (Functor m, ReadTCState m) => ModuleName -> m (Maybe Section)

Get a section.

Why Maybe? The reason is that we look up all prefixes of a module to compute number of parameters, and for hierarchical top-level modules, A.B.C say, A and A.B do not exist.

addDisplayForms :: QName -> TCM ()

Add display forms for a name f copied by a module application. Essentially if f can reduce to

λ xs → A.B.C.f vs

by unfolding module application copies (defCopy), then we add a display form

A.B.C.f vs ==> f xs

applySection

Arguments

:: ModuleName

Name of new module defined by the module macro.

-> Telescope

Parameters of new module.

-> ModuleName

Name of old module applied to arguments.

-> Args

Arguments of module application.

-> ScopeCopyInfo

Imported names and modules

-> TCM ()

Module application (followed by module parameter abstraction).

applySection' :: ModuleName -> Telescope -> ModuleName -> Args -> ScopeCopyInfo -> TCM ()

addDisplayForm :: QName -> DisplayForm -> TCM ()

Add a display form to a definition (could be in this or imported signature).

isLocal :: ReadTCState m => QName -> m Bool

getDisplayForms :: (HasConstInfo m, ReadTCState m) => QName -> m [LocalDisplayForm]

chaseDisplayForms :: QName -> TCM (Set QName)

Find all names used (recursively) by display forms of a given name.

hasLoopingDisplayForm :: QName -> TCM Bool

Check if a display form is looping.

canonicalName :: HasConstInfo m => QName -> m QName

sameDef :: HasConstInfo m => QName -> QName -> m (Maybe QName)

whatInduction :: MonadTCM tcm => QName -> tcm Induction

Can be called on either a (co)datatype, a record type or a (co)constructor.

singleConstructorType :: QName -> TCM Bool

Does the given constructor come from a single-constructor type?

Precondition: The name has to refer to a constructor.

sigError :: (String -> a) -> a -> SigError -> a

Standard eliminator for SigError.

getOriginalConstInfo :: (ReadTCState m, HasConstInfo m) => QName -> m Definition

The computation getConstInfo sometimes tweaks the returned Definition, depending on the current Language and the Language of the Definition. This variant of getConstInfo does not perform any tweaks.

defaultGetRewriteRulesFor :: (ReadTCState m, MonadTCEnv m) => QName -> m RewriteRules

getOriginalProjection :: HasConstInfo m => QName -> m QName

Get the original name of the projection (the current one could be from a module application).

defaultGetConstInfo :: (HasOptions m, MonadDebug m, MonadTCEnv m) => TCState -> TCEnv -> QName -> m (Either SigError Definition)

getConInfo :: HasConstInfo m => ConHead -> m Definition

getPolarity :: HasConstInfo m => QName -> m [Polarity]

Look up the polarity of a definition.

getPolarity' :: HasConstInfo m => Comparison -> QName -> m [Polarity]

Look up polarity of a definition and compose with polarity represented by Comparison.

setPolarity :: (MonadTCState m, MonadDebug m) => QName -> [Polarity] -> m ()

Set the polarity of a definition.

getForcedArgs :: HasConstInfo m => QName -> m [IsForced]

Look up the forced arguments of a definition.

getArgOccurrence :: QName -> Nat -> TCM Occurrence

Get argument occurrence info for argument i of definition d (never fails).

setArgOccurrences :: MonadTCState m => QName -> [Occurrence] -> m ()

Sets the defArgOccurrences for the given identifier (which should already exist in the signature).

modifyArgOccurrences :: MonadTCState m => QName -> ([Occurrence] -> [Occurrence]) -> m ()

setTreeless :: QName -> TTerm -> TCM ()

setCompiledArgUse :: QName -> [ArgUsage] -> TCM ()

getCompiled :: HasConstInfo m => QName -> m (Maybe Compiled)

getErasedConArgs :: HasConstInfo m => QName -> m [Bool]

Returns a list of length conArity. If no erasure analysis has been performed yet, this will be a list of Falses.

setErasedConArgs :: QName -> [Bool] -> TCM ()

getTreeless :: HasConstInfo m => QName -> m (Maybe TTerm)

getCompiledArgUse :: HasConstInfo m => QName -> m (Maybe [ArgUsage])

addDataCons :: QName -> [QName] -> TCM ()

add data constructors to a datatype

getMutual :: QName -> TCM (Maybe [QName])

Get the mutually recursive identifiers of a symbol from the signature.

getMutual_ :: Defn -> Maybe [QName]

Get the mutually recursive identifiers from a Definition.

setMutual :: QName -> [QName] -> TCM ()

Set the mutually recursive identifiers.

mutuallyRecursive :: QName -> QName -> TCM Bool

Check whether two definitions are mutually recursive.

definitelyNonRecursive_ :: Defn -> Bool

A functiondatarecord definition is nonRecursive if it is not even mutually recursive with itself.

getCurrentModuleFreeVars :: TCM Nat

Get the number of parameters to the current module.

getDefModule :: HasConstInfo m => QName -> m (Either SigError ModuleName)

getDefFreeVars :: (Functor m, Applicative m, ReadTCState m, MonadTCEnv m) => QName -> m Nat

Compute the number of free variables of a defined name. This is the sum of number of parameters shared with the current module and the number of anonymous variables (if the name comes from a let-bound module).

freeVarsToApply :: (Functor m, HasConstInfo m, HasOptions m, ReadTCState m, MonadTCEnv m, MonadDebug m) => QName -> m Args

getModuleFreeVars :: (Functor m, Applicative m, MonadTCEnv m, ReadTCState m) => ModuleName -> m Nat

moduleParamsToApply :: (Functor m, Applicative m, HasOptions m, MonadTCEnv m, ReadTCState m, MonadDebug m) => ModuleName -> m Args

Compute the context variables to apply a definition to.

We have to insert the module telescope of the common prefix of the current module and the module where the definition comes from. (Properly raised to the current context.)

Example: module M₁ Γ where module M₁ Δ where f = ... module M₃ Θ where ... M₁.M₂.f [insert Γ raised by Θ]

instantiateDef :: (Functor m, HasConstInfo m, HasOptions m, ReadTCState m, MonadTCEnv m, MonadDebug m) => Definition -> m Definition

Instantiate a closed definition with the correct part of the current context.

instantiateRewriteRule :: (Functor m, HasConstInfo m, HasOptions m, ReadTCState m, MonadTCEnv m, MonadDebug m) => RewriteRule -> m RewriteRule

instantiateRewriteRules :: (Functor m, HasConstInfo m, HasOptions m, ReadTCState m, MonadTCEnv m, MonadDebug m) => RewriteRules -> m RewriteRules

makeAbstract :: Definition -> Maybe Definition

Give the abstract view of a definition.

inAbstractMode :: MonadTCEnv m => m a -> m a

Enter abstract mode. Abstract definition in the current module are transparent.

inConcreteMode :: MonadTCEnv m => m a -> m a

Not in abstract mode. All abstract definitions are opaque.

ignoreAbstractMode :: MonadTCEnv m => m a -> m a

Ignore abstract mode. All abstract definitions are transparent.

inConcreteOrAbstractMode :: (MonadTCEnv m, HasConstInfo m) => QName -> (Definition -> m a) -> m a

Enter concrete or abstract mode depending on whether the given identifier is concrete or abstract.

treatAbstractly :: MonadTCEnv m => QName -> m Bool

Check whether a name might have to be treated abstractly (either if we're inAbstractMode or it's not a local name). Returns true for things not declared abstract as well, but for those makeAbstract will have no effect.

treatAbstractly' :: QName -> TCEnv -> Bool

Andreas, 2015-07-01: If the current module is a weak suffix of the identifier module, we can see through its abstract definition if we are abstract. (Then treatAbstractly' returns False).

If I am not mistaken, then we cannot see definitions in the where block of an abstract function from the perspective of the function, because then the current module is a strict prefix of the module of the local identifier. This problem is fixed by removing trailing anonymous module name parts (underscores) from both names.

typeOfConst :: (HasConstInfo m, ReadTCState m) => QName -> m Type

Get type of a constant, instantiated to the current context.

relOfConst :: HasConstInfo m => QName -> m Relevance

Get relevance of a constant.

modalityOfConst :: HasConstInfo m => QName -> m Modality

Get modality of a constant.

droppedPars :: Definition -> Int

The number of dropped parameters for a definition. 0 except for projection(-like) functions and constructors.

isProjection :: HasConstInfo m => QName -> m (Maybe Projection)

Is it the name of a record projection?

isProjection_ :: Defn -> Maybe Projection

isRelevantProjection :: HasConstInfo m => QName -> m (Maybe Projection)

Is it the name of a non-irrelevant record projection?

isRelevantProjection_ :: Definition -> Maybe Projection

isStaticFun :: Defn -> Bool

Is it a function marked STATIC?

isInlineFun :: Defn -> Bool

Is it a function marked INLINE?

isProperProjection :: Defn -> Bool

Returns True if we are dealing with a proper projection, i.e., not a projection-like function nor a record field value (projection applied to argument).

projectionArgs :: Definition -> Int

Number of dropped initial arguments of a projection(-like) function.

usesCopatterns :: HasConstInfo m => QName -> m Bool

Check whether a definition uses copatterns.

applyDef :: HasConstInfo m => ProjOrigin -> QName -> Arg Term -> m Term

Apply a function f to its first argument, producing the proper postfix projection if f is a projection which is not irrelevant.

class UnFreezeMeta a where

Unfreeze meta and its type if this is a meta again. Does not unfreeze deep occurrences of metas.

Methods

unfreezeMeta :: MonadMetaSolver m => a -> m ()

Instances

UnFreezeMeta MetaId

Defined in Agda.TypeChecking.Monad.MetaVars

Methods

unfreezeMeta :: MonadMetaSolver m => MetaId -> m ()

UnFreezeMeta Level

Defined in Agda.TypeChecking.Monad.MetaVars

Methods

unfreezeMeta :: MonadMetaSolver m => Level -> m ()

UnFreezeMeta PlusLevel

Defined in Agda.TypeChecking.Monad.MetaVars

Methods

unfreezeMeta :: MonadMetaSolver m => PlusLevel -> m ()

UnFreezeMeta Sort

Defined in Agda.TypeChecking.Monad.MetaVars

Methods

unfreezeMeta :: MonadMetaSolver m => Sort -> m ()

UnFreezeMeta Term

Defined in Agda.TypeChecking.Monad.MetaVars

Methods

unfreezeMeta :: MonadMetaSolver m => Term -> m ()

UnFreezeMeta Type

Defined in Agda.TypeChecking.Monad.MetaVars

Methods

unfreezeMeta :: MonadMetaSolver m => Type -> m ()

UnFreezeMeta a => UnFreezeMeta (Abs a)

Defined in Agda.TypeChecking.Monad.MetaVars

Methods

unfreezeMeta :: MonadMetaSolver m => Abs a -> m ()

UnFreezeMeta a => UnFreezeMeta [a]

Defined in Agda.TypeChecking.Monad.MetaVars

Methods

unfreezeMeta :: MonadMetaSolver m => [a] -> m ()

class IsInstantiatedMeta a where

Check whether all metas are instantiated. Precondition: argument is a meta (in some form) or a list of metas.

Methods

isInstantiatedMeta :: (MonadFail m, ReadTCState m) => a -> m Bool

Instances

IsInstantiatedMeta MetaId

Defined in Agda.TypeChecking.Monad.MetaVars

Methods

isInstantiatedMeta :: (MonadFail m, ReadTCState m) => MetaId -> m Bool

IsInstantiatedMeta Level

Defined in Agda.TypeChecking.Monad.MetaVars

Methods

isInstantiatedMeta :: (MonadFail m, ReadTCState m) => Level -> m Bool

IsInstantiatedMeta PlusLevel

Defined in Agda.TypeChecking.Monad.MetaVars

Methods

isInstantiatedMeta :: (MonadFail m, ReadTCState m) => PlusLevel -> m Bool

IsInstantiatedMeta Term

Defined in Agda.TypeChecking.Monad.MetaVars

Methods

isInstantiatedMeta :: (MonadFail m, ReadTCState m) => Term -> m Bool

IsInstantiatedMeta a => IsInstantiatedMeta (Arg a)

Defined in Agda.TypeChecking.Monad.MetaVars

Methods

isInstantiatedMeta :: (MonadFail m, ReadTCState m) => Arg a -> m Bool

IsInstantiatedMeta a => IsInstantiatedMeta (Abs a)

Does not worry about raising.

Defined in Agda.TypeChecking.Monad.MetaVars

Methods

isInstantiatedMeta :: (MonadFail m, ReadTCState m) => Abs a -> m Bool

IsInstantiatedMeta a => IsInstantiatedMeta (Maybe a)

Defined in Agda.TypeChecking.Monad.MetaVars

Methods

isInstantiatedMeta :: (MonadFail m, ReadTCState m) => Maybe a -> m Bool

IsInstantiatedMeta a => IsInstantiatedMeta [a]

Defined in Agda.TypeChecking.Monad.MetaVars

Methods

isInstantiatedMeta :: (MonadFail m, ReadTCState m) => [a] -> m Bool

class (MonadConstraint m, MonadReduce m, MonadAddContext m, MonadTCEnv m, ReadTCState m, HasBuiltins m, HasConstInfo m, MonadDebug m) => MonadMetaSolver m where

Monad service class for creating, solving and eta-expanding of metavariables.

Methods

newMeta' :: MetaInstantiation -> Frozen -> MetaInfo -> MetaPriority -> Permutation -> Judgement a -> m MetaId

Generate a new meta variable with some instantiation given. For instance, the instantiation could be a PostponedTypeCheckingProblem.

assignV :: CompareDirection -> MetaId -> Args -> Term -> CompareAs -> m ()

Assign to an open metavar which may not be frozen. First check that metavar args are in pattern fragment. Then do extended occurs check on given thing.

Assignment is aborted by throwing a PatternErr via a call to patternViolation. This error is caught by catchConstraint during equality checking (compareAtom) and leads to restoration of the original constraints.

assignTerm' :: MonadMetaSolver m => MetaId -> [Arg ArgName] -> Term -> m ()

Directly instantiate the metavariable. Skip pattern check, occurs check and frozen check. Used for eta expanding frozen metas.

etaExpandMeta :: [MetaKind] -> MetaId -> m ()

Eta expand a metavariable, if it is of the specified kind. Don't do anything if the metavariable is a blocked term.

updateMetaVar :: MetaId -> (MetaVariable -> MetaVariable) -> m ()

Update the status of the metavariable

speculateMetas :: m () -> m KeepMetas -> m ()

'speculateMetas fallback m' speculatively runs m, but if the result is RollBackMetas any changes to metavariables are rolled back and fallback is run instead.

Instances

MonadMetaSolver TCM

Defined in Agda.TypeChecking.MetaVars

Methods

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

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

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

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

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

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

(PureTCM m, MonadBlock m) => MonadMetaSolver (PureConversionT m)

Defined in Agda.TypeChecking.Conversion.Pure

Methods

newMeta' :: MetaInstantiation -> Frozen -> MetaInfo -> MetaPriority -> Permutation -> Judgement a -> PureConversionT m MetaId

assignV :: CompareDirection -> MetaId -> Args -> Term -> CompareAs -> PureConversionT m ()

assignTerm' :: MetaId -> [Arg ArgName] -> Term -> PureConversionT m ()

etaExpandMeta :: [MetaKind] -> MetaId -> PureConversionT m ()

updateMetaVar :: MetaId -> (MetaVariable -> MetaVariable) -> PureConversionT m ()

speculateMetas :: PureConversionT m () -> PureConversionT m KeepMetas -> PureConversionT m ()

data KeepMetas

Constructors

KeepMetas

RollBackMetas

data MetaKind

Various kinds of metavariables.

Constructors

Records

Meta variables of record type.

SingletonRecords

Meta variables of "hereditarily singleton" record type.

Levels

Meta variables of level type, if type-in-type is activated.

Instances

Bounded MetaKind

Defined in Agda.TypeChecking.Monad.MetaVars

Methods

minBound :: MetaKind

maxBound :: MetaKind

Enum MetaKind

Defined in Agda.TypeChecking.Monad.MetaVars

Methods

succ :: MetaKind -> MetaKind

pred :: MetaKind -> MetaKind

toEnum :: Int -> MetaKind

fromEnum :: MetaKind -> Int

enumFrom :: MetaKind -> [MetaKind]

enumFromThen :: MetaKind -> MetaKind -> [MetaKind]

enumFromTo :: MetaKind -> MetaKind -> [MetaKind]

enumFromThenTo :: MetaKind -> MetaKind -> MetaKind -> [MetaKind]

Show MetaKind

Defined in Agda.TypeChecking.Monad.MetaVars

Methods

showsPrec :: Int -> MetaKind -> ShowS

show :: MetaKind -> String

showList :: [MetaKind] -> ShowS

Eq MetaKind

Defined in Agda.TypeChecking.Monad.MetaVars

Methods

(==) :: MetaKind -> MetaKind -> Bool

(/=) :: MetaKind -> MetaKind -> Bool

allMetaKinds :: [MetaKind]

All possible metavariable kinds.

dontAssignMetas :: (MonadTCEnv m, HasOptions m, MonadDebug m) => m a -> m a

Switch off assignment of metas.

getMetaStore :: ReadTCState m => m MetaStore

Get the meta store.

modifyMetaStore :: (MetaStore -> MetaStore) -> TCM ()

metasCreatedBy :: ReadTCState m => m a -> m (a, MetaStore)

Run a computation and record which new metas it created.

lookupMeta' :: ReadTCState m => MetaId -> m (Maybe MetaVariable)

Lookup a meta variable.

lookupMeta :: (MonadFail m, ReadTCState m) => MetaId -> m MetaVariable

metaType :: (MonadFail m, ReadTCState m) => MetaId -> m Type

Type of a term or sort meta.

updateMetaVarTCM :: MetaId -> (MetaVariable -> MetaVariable) -> TCM ()

Update the information associated with a meta variable.

insertMetaVar :: MetaId -> MetaVariable -> TCM ()

Insert a new meta variable with associated information into the meta store.

getMetaPriority :: (MonadFail m, ReadTCState m) => MetaId -> m MetaPriority

isSortMeta :: (MonadFail m, ReadTCState m) => MetaId -> m Bool

isSortMeta_ :: MetaVariable -> Bool

getMetaType :: (MonadFail m, ReadTCState m) => MetaId -> m Type

getMetaContextArgs :: MonadTCEnv m => MetaVariable -> m Args

Compute the context variables that a meta should be applied to, accounting for pruning.

getMetaTypeInContext :: (MonadFail m, MonadTCEnv m, ReadTCState m, MonadReduce m, HasBuiltins m) => MetaId -> m Type

Given a meta, return the type applied to the current context.

isGeneralizableMeta :: (ReadTCState m, MonadFail m) => MetaId -> m DoGeneralize

Is it a meta that might be generalized?

isInstantiatedMeta' :: (MonadFail m, ReadTCState m) => MetaId -> m (Maybe Term)

constraintMetas :: Constraint -> TCM (Set MetaId)

Returns all metavariables in a constraint. Slightly complicated by the fact that blocked terms are represented by two meta variables. To find the second one we need to look up the meta listeners for the one in the UnBlock constraint. This is used for the purpose of deciding if a metavariable is constrained or if it can be generalized over (see Agda.TypeChecking.Generalize).

createMetaInfo :: (MonadTCEnv m, ReadTCState m) => m MetaInfo

Create MetaInfo in the current environment.

createMetaInfo' :: (MonadTCEnv m, ReadTCState m) => RunMetaOccursCheck -> m MetaInfo

setValueMetaName :: MonadMetaSolver m => Term -> MetaNameSuggestion -> m ()

getMetaNameSuggestion :: (MonadFail m, ReadTCState m) => MetaId -> m MetaNameSuggestion

setMetaNameSuggestion :: MonadMetaSolver m => MetaId -> MetaNameSuggestion -> m ()

setMetaGeneralizableArgInfo :: MonadMetaSolver m => MetaId -> ArgInfo -> m ()

Change the ArgInfo that will be used when generalizing over this meta.

updateMetaVarRange :: MonadMetaSolver m => MetaId -> Range -> m ()

setMetaOccursCheck :: MonadMetaSolver m => MetaId -> RunMetaOccursCheck -> m ()

registerInteractionPoint :: forall m. MonadInteractionPoints m => Bool -> Range -> Maybe Nat -> m InteractionId

Register an interaction point during scope checking. If there is no interaction id yet, create one.

findInteractionPoint_ :: Range -> InteractionPoints -> Maybe InteractionId

Find an interaction point by Range' by searching the whole map. Issue 3000: Don't consider solved interaction points.

O(n): linear in the number of registered interaction points.

connectInteractionPoint :: MonadInteractionPoints m => InteractionId -> MetaId -> m ()

Hook up meta variable to interaction point.

removeInteractionPoint :: MonadInteractionPoints m => InteractionId -> m ()

Mark an interaction point as solved.

getInteractionPoints :: ReadTCState m => m [InteractionId]

Get a list of interaction ids.

getInteractionMetas :: ReadTCState m => m [MetaId]

Get all metas that correspond to unsolved interaction ids.

getUniqueMetasRanges :: (MonadFail m, ReadTCState m) => [MetaId] -> m [Range]

getUnsolvedMetas :: (MonadFail m, ReadTCState m) => m [Range]

getUnsolvedInteractionMetas :: (MonadFail m, ReadTCState m) => m [Range]

getInteractionIdsAndMetas :: ReadTCState m => m [(InteractionId, MetaId)]

Get all metas that correspond to unsolved interaction ids.

isInteractionMeta :: ReadTCState m => MetaId -> m (Maybe InteractionId)

Does the meta variable correspond to an interaction point?

Time: O(log n) where n is the number of interaction metas.

lookupInteractionPoint :: (MonadFail m, ReadTCState m, MonadError TCErr m) => InteractionId -> m InteractionPoint

Get the information associated to an interaction point.

lookupInteractionId :: (MonadFail m, ReadTCState m, MonadError TCErr m, MonadTCEnv m) => InteractionId -> m MetaId

Get MetaId for an interaction point. Precondition: interaction point is connected.

lookupInteractionMeta :: ReadTCState m => InteractionId -> m (Maybe MetaId)

Check whether an interaction id is already associated with a meta variable.

lookupInteractionMeta_ :: InteractionId -> InteractionPoints -> Maybe MetaId

newMeta :: MonadMetaSolver m => Frozen -> MetaInfo -> MetaPriority -> Permutation -> Judgement a -> m MetaId

Generate new meta variable.

newMetaTCM' :: MetaInstantiation -> Frozen -> MetaInfo -> MetaPriority -> Permutation -> Judgement a -> TCM MetaId

Generate a new meta variable with some instantiation given. For instance, the instantiation could be a PostponedTypeCheckingProblem.

getInteractionRange :: (MonadInteractionPoints m, MonadFail m, MonadError TCErr m) => InteractionId -> m Range

Get the Range' for an interaction point.

getMetaRange :: (MonadFail m, ReadTCState m) => MetaId -> m Range

Get the Range' for a meta variable.

getInteractionScope :: (MonadFail m, ReadTCState m, MonadError TCErr m, MonadTCEnv m) => InteractionId -> m ScopeInfo

withMetaInfo' :: (MonadTCEnv m, ReadTCState m, MonadTrace m) => MetaVariable -> m a -> m a

withMetaInfo :: (MonadTCEnv m, ReadTCState m, MonadTrace m) => Closure Range -> m a -> m a

withInteractionId :: (MonadFail m, ReadTCState m, MonadError TCErr m, MonadTCEnv m, MonadTrace m) => InteractionId -> m a -> m a

withMetaId :: (MonadFail m, MonadTCEnv m, ReadTCState m, MonadTrace m) => MetaId -> m a -> m a

getMetaVariables :: ReadTCState m => (MetaVariable -> Bool) -> m [MetaId]

getOpenMetas :: ReadTCState m => m [MetaId]

isOpenMeta :: MetaInstantiation -> Bool

listenToMeta :: MonadMetaSolver m => Listener -> MetaId -> m ()

listenToMeta l m: register l as a listener to m. This is done when the type of l is blocked by m.

unlistenToMeta :: MonadMetaSolver m => Listener -> MetaId -> m ()

Unregister a listener.

getMetaListeners :: (MonadFail m, ReadTCState m) => MetaId -> m [Listener]

Get the listeners to a meta.

clearMetaListeners :: MonadMetaSolver m => MetaId -> m ()

freezeMetas :: MetaStore -> TCM IntSet

Freeze the given meta-variables and return those that were not already frozen.

unfreezeMetas :: TCM ()

Thaw all meta variables.

isFrozen :: (MonadFail m, ReadTCState m) => MetaId -> m Bool

data CheckResult where

The result and associated parameters of a type-checked file, when invoked directly via interaction or a backend. Note that the constructor is not exported.

Bundled Patterns

pattern CheckResult :: Interface -> [TCWarning] -> ModuleCheckMode -> Source -> CheckResult

Flattened unidirectional pattern for CheckResult for destructuring inside the ModuleInfo field.

crInterface :: CheckResult -> Interface

crWarnings :: CheckResult -> [TCWarning]

crMode :: CheckResult -> ModuleCheckMode

activeBackendMayEraseType :: QName -> TCM Bool

Ask the active backend whether a type may be erased. See issue #3732.

backendInteraction :: AbsolutePath -> [Backend] -> TCM () -> (AbsolutePath -> TCM CheckResult) -> TCM ()

parseBackendOptions :: [Backend] -> [String] -> CommandLineOptions -> OptM ([Backend], CommandLineOptions)

callBackend :: String -> IsMain -> CheckResult -> TCM ()

Call the compilerMain function of the given backend.

lookupBackend :: BackendName -> TCM (Maybe Backend)

Look for a backend of the given name.

activeBackend :: TCM (Maybe Backend)

Get the currently active backend (if any).