Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Synopsis
- isType :: Expr -> Sort -> TCM Type
- isType' :: Comparison -> Expr -> Sort -> TCM Type
- isType_ :: Expr -> TCM Type
- checkLevel :: NamedArg Expr -> TCM Level
- isTypeEqualTo :: Expr -> Type -> TCM Type
- leqType_ :: Type -> Type -> TCM ()
- checkGeneralizeTelescope :: GeneralizeTelescope -> ([Maybe Name] -> Telescope -> TCM a) -> TCM a
- checkTelescope :: Telescope -> (Telescope -> TCM a) -> TCM a
- checkPiTelescope :: Telescope -> (Telescope -> TCM a) -> TCM a
- data LamOrPi
- checkTelescope' :: LamOrPi -> Telescope -> (Telescope -> TCM a) -> TCM a
- checkDomain :: (LensLock a, LensModality a) => LamOrPi -> List1 a -> Expr -> TCM Type
- checkPiDomain :: (LensLock a, LensModality a) => List1 a -> Expr -> TCM Type
- checkTypedBindings :: LamOrPi -> TypedBinding -> (Telescope -> TCM a) -> TCM a
- addTypedPatterns :: List1 (NamedArg Binder) -> TCM a -> TCM a
- checkTacticAttribute :: LamOrPi -> Expr -> TCM Term
- ifPath :: Type -> TCM a -> TCM a -> TCM a
- checkPath :: TypedBinding -> Expr -> Type -> TCM Term
- checkLambda :: Comparison -> TypedBinding -> Expr -> Type -> TCM Term
- checkLambda' :: Comparison -> TypedBinding -> List1 (NamedArg Binder) -> Expr -> Expr -> Type -> TCM Term
- lambdaModalityCheck :: (LensAnnotation dom, LensModality dom) => dom -> ArgInfo -> TCM ArgInfo
- lambdaIrrelevanceCheck :: LensRelevance dom => dom -> ArgInfo -> TCM ArgInfo
- lambdaQuantityCheck :: LensQuantity dom => dom -> ArgInfo -> TCM ArgInfo
- lambdaAnnotationCheck :: LensAnnotation dom => dom -> ArgInfo -> TCM ArgInfo
- lambdaCohesionCheck :: LensCohesion dom => dom -> ArgInfo -> TCM ArgInfo
- lambdaAddContext :: Name -> ArgName -> Dom Type -> TCM a -> TCM a
- checkPostponedLambda :: Comparison -> Arg (List1 (WithHiding Name), Maybe Type) -> Expr -> Type -> TCM Term
- checkPostponedLambda0 :: Comparison -> Arg ([WithHiding Name], Maybe Type) -> Expr -> Type -> TCM Term
- insertHiddenLambdas :: Hiding -> Type -> (Blocker -> Type -> TCM Term) -> (Type -> TCM Term) -> TCM Term
- checkAbsurdLambda :: Comparison -> ExprInfo -> Hiding -> Expr -> Type -> TCM Term
- checkExtendedLambda :: Comparison -> ExprInfo -> DefInfo -> Erased -> QName -> List1 Clause -> Expr -> Type -> TCM Term
- catchIlltypedPatternBlockedOnMeta :: TCM a -> ((TCErr, Blocker) -> TCM a) -> TCM a
- expandModuleAssigns :: [Either Assign ModuleName] -> [Name] -> TCM Assigns
- checkRecordExpression :: Comparison -> RecordAssigns -> Expr -> Type -> TCM Term
- checkRecordUpdate :: Comparison -> ExprInfo -> Expr -> Assigns -> Expr -> Type -> TCM Term
- checkLiteral :: Literal -> Type -> TCM Term
- scopedExpr :: Expr -> TCM Expr
- checkExpr :: Expr -> Type -> TCM Term
- checkExpr' :: Comparison -> Expr -> Type -> TCM Term
- doQuoteTerm :: Comparison -> Term -> Type -> TCM Term
- unquoteM :: Expr -> Term -> Type -> TCM ()
- unquoteTactic :: Term -> Term -> Type -> TCM ()
- checkQuestionMark :: (Comparison -> Type -> TCM (MetaId, Term)) -> Comparison -> Type -> MetaInfo -> InteractionId -> TCM Term
- checkUnderscore :: Comparison -> Type -> MetaInfo -> TCM Term
- checkMeta :: (Comparison -> Type -> TCM (MetaId, Term)) -> Comparison -> Type -> MetaInfo -> TCM Term
- inferMeta :: (Comparison -> Type -> TCM (MetaId, Term)) -> MetaInfo -> TCM (Elims -> Term, Type)
- checkOrInferMeta :: (Comparison -> Type -> TCM (MetaId, Term)) -> Maybe (Comparison, Type) -> MetaInfo -> TCM (Term, Type)
- domainFree :: ArgInfo -> Binder' Name -> LamBinding
- checkKnownArguments :: [NamedArg Expr] -> Args -> Type -> TCM (Args, Type)
- checkKnownArgument :: NamedArg Expr -> Args -> Type -> TCM (Args, Type)
- checkNamedArg :: NamedArg Expr -> Type -> TCM Term
- inferExpr :: Expr -> TCM (Term, Type)
- inferExpr' :: ExpandHidden -> Expr -> TCM (Term, Type)
- defOrVar :: Expr -> Bool
- checkDontExpandLast :: Comparison -> Expr -> Type -> TCM Term
- isModuleFreeVar :: Int -> TCM Bool
- inferExprForWith :: Arg Expr -> TCM (Term, Type)
- checkLetBindings :: Foldable t => t LetBinding -> TCM a -> TCM a
- checkLetBinding :: LetBinding -> TCM a -> TCM a
Types
isType' :: Comparison -> Expr -> Sort -> TCM Type Source #
Check that an expression is a type.
* If c == CmpEq
, the given sort must be the minimal sort.
* If c == CmpLeq
, the given sort may be any bigger sort.
isType_ :: Expr -> TCM Type Source #
Check that an expression is a type and infer its (minimal) sort.
isTypeEqualTo :: Expr -> Type -> TCM Type Source #
Ensure that a (freshly created) function type does not inhabit SizeUniv
.
Precondition: When noFunctionsIntoSize t tBlame
is called,
we are in the context of tBlame
in order to print it correctly.
Not being in context of t
should not matter, as we are only
checking whether its sort reduces to SizeUniv
.
Currently UNUSED since SizeUniv is turned off (as of 2016).
Check that an expression is a type which is equal to a given type.
Telescopes
checkGeneralizeTelescope :: GeneralizeTelescope -> ([Maybe Name] -> Telescope -> TCM a) -> TCM a Source #
checkTelescope :: Telescope -> (Telescope -> TCM a) -> TCM a Source #
Type check a (module) telescope. Binds the variables defined by the telescope.
checkPiTelescope :: Telescope -> (Telescope -> TCM a) -> TCM a Source #
Type check the telescope of a dependent function type. Binds the resurrected variables defined by the telescope. The returned telescope is unmodified (not resurrected).
Flag to control resurrection on domains.
LamNotPi | We are checking a module telescope. We pass into the type world to check the domain type. This resurrects the whole context. |
PiNotLam | We are checking a telescope in a Pi-type. We stay in the term world, but add resurrected domains to the context to check the remaining domains and codomain of the Pi-type. |
Instances
checkTelescope' :: LamOrPi -> Telescope -> (Telescope -> TCM a) -> TCM a Source #
Type check a telescope. Binds the variables defined by the telescope.
checkDomain :: (LensLock a, LensModality a) => LamOrPi -> List1 a -> Expr -> TCM Type Source #
Check the domain of a function type.
Used in checkTypedBindings
and to typecheck A.Fun
cases.
checkPiDomain :: (LensLock a, LensModality a) => List1 a -> Expr -> TCM Type Source #
checkTypedBindings :: LamOrPi -> TypedBinding -> (Telescope -> TCM a) -> TCM a Source #
Check a typed binding and extends the context with the bound variables. The telescope passed to the continuation is valid in the original context.
Parametrized by a flag wether we check a typed lambda or a Pi. This flag is needed for irrelevance.
addTypedPatterns :: List1 (NamedArg Binder) -> TCM a -> TCM a Source #
After a typed binding has been checked, add the patterns it binds
checkTacticAttribute :: LamOrPi -> Expr -> TCM Term Source #
Check a tactic attribute. Should have type Term → TC ⊤.
Lambda abstractions
checkLambda :: Comparison -> TypedBinding -> Expr -> Type -> TCM Term Source #
Type check a lambda expression. "checkLambda bs e ty" means ( bs -> e) : ty
:: Comparison | cmp |
-> TypedBinding | TBind _ _ xps typ |
-> List1 (NamedArg Binder) | xps |
-> Expr | typ |
-> Expr | body |
-> Type | target |
-> TCM Term |
lambdaModalityCheck :: (LensAnnotation dom, LensModality dom) => dom -> ArgInfo -> TCM ArgInfo Source #
Check that modality info in lambda is compatible with modality coming from the function type. If lambda has no user-given modality, copy that of function type.
lambdaIrrelevanceCheck :: LensRelevance dom => dom -> ArgInfo -> TCM ArgInfo Source #
Check that irrelevance info in lambda is compatible with irrelevance coming from the function type. If lambda has no user-given relevance, copy that of function type.
lambdaQuantityCheck :: LensQuantity dom => dom -> ArgInfo -> TCM ArgInfo Source #
Check that quantity info in lambda is compatible with quantity coming from the function type. If lambda has no user-given quantity, copy that of function type.
lambdaAnnotationCheck :: LensAnnotation dom => dom -> ArgInfo -> TCM ArgInfo Source #
lambdaCohesionCheck :: LensCohesion dom => dom -> ArgInfo -> TCM ArgInfo Source #
Check that cohesion info in lambda is compatible with cohesion coming from the function type. If lambda has no user-given cohesion, copy that of function type.
checkPostponedLambda :: Comparison -> Arg (List1 (WithHiding Name), Maybe Type) -> Expr -> Type -> TCM Term Source #
Checking a lambda whose domain type has already been checked.
checkPostponedLambda0 :: Comparison -> Arg ([WithHiding Name], Maybe Type) -> Expr -> Type -> TCM Term Source #
:: Hiding | Expected hiding. |
-> Type | Expected to be a function type. |
-> (Blocker -> Type -> TCM Term) | Continuation on blocked type. |
-> (Type -> TCM Term) | Continuation when expected hiding found.
The continuation may assume that the |
-> TCM Term | Term with hidden lambda inserted. |
Insert hidden lambda until the hiding info of the domain type
matches the expected hiding info.
Throws WrongHidingInLambda
checkAbsurdLambda :: Comparison -> ExprInfo -> Hiding -> Expr -> Type -> TCM Term Source #
checkAbsurdLambda i h e t
checks absurd lambda against type t
.
Precondition: e = AbsurdLam i h
checkExtendedLambda :: Comparison -> ExprInfo -> DefInfo -> Erased -> QName -> List1 Clause -> Expr -> Type -> TCM Term Source #
checkExtendedLambda i di erased qname cs e t
check pattern matching lambda.
Precondition: e = ExtendedLam i di erased qname cs
catchIlltypedPatternBlockedOnMeta :: TCM a -> ((TCErr, Blocker) -> TCM a) -> TCM a Source #
Run a computation.
- If successful, that's it, we are done.
- If
NotADatatype a
orCannotEliminateWithPattern p a
is thrown and typea
is blocked on some metax
, reset any changes to the state and pass (the error and)x
to the handler. - If
SplitError (UnificationStuck c tel us vs _)
is thrown and the unification problemus =?= vs : tel
is blocked on some metax
passx
to the handler. - If another error was thrown or the type
a
is not blocked, reraise the error.
Note that the returned meta might only exists in the state where the error was
thrown, thus, be an invalid MetaId
in the current state.
Records
:: [Either Assign ModuleName] | Modules and field assignments. |
-> [Name] | Names of fields of the record type. |
-> TCM Assigns | Completed field assignments from modules. |
Picks up record field assignments from modules that export a definition that has the same name as the missing field.
checkRecordExpression Source #
:: Comparison | How do we related the inferred type of the record expression to the expected type? Subtype or equal type? |
-> RecordAssigns |
|
-> Expr | Must be |
-> Type | Expected type of record expression. |
-> TCM Term | Record value in internal syntax. |
checkRecordExpression fs e t
checks record construction against type t
.
Precondition e = Rec _ fs
.
:: Comparison | cmp |
-> ExprInfo | ei |
-> Expr | recexpr |
-> Assigns | fs |
-> Expr | e = RecUpdate ei recexpr fs |
-> Type | Need not be reduced. |
-> TCM Term |
checkRecordUpdate cmp ei recexpr fs e t
Preconditions: e = RecUpdate ei recexpr fs
and t
is reduced.
Literal
Terms
scopedExpr :: Expr -> TCM Expr Source #
Remove top layers of scope info of expression and set the scope accordingly
in the TCState
.
:: Comparison | |
-> Expr | |
-> Type | Unreduced! |
-> TCM Term |
Reflection
doQuoteTerm :: Comparison -> Term -> Type -> TCM Term Source #
unquoteTactic :: Term -> Term -> Type -> TCM () Source #
Run a tactic `tac : Term → TC ⊤` in a hole (second argument) of the type given by the third argument. Runs the continuation if successful.
Meta variables
:: (Comparison -> Type -> TCM (MetaId, Term)) | |
-> Comparison | |
-> Type | Not reduced! |
-> MetaInfo | |
-> InteractionId | |
-> TCM Term |
Check an interaction point without arguments.
checkUnderscore :: Comparison -> Type -> MetaInfo -> TCM Term Source #
Check an underscore without arguments.
checkMeta :: (Comparison -> Type -> TCM (MetaId, Term)) -> Comparison -> Type -> MetaInfo -> TCM Term Source #
Type check a meta variable.
inferMeta :: (Comparison -> Type -> TCM (MetaId, Term)) -> MetaInfo -> TCM (Elims -> Term, Type) Source #
Infer the type of a meta variable. If it is a new one, we create a new meta for its type.
checkOrInferMeta :: (Comparison -> Type -> TCM (MetaId, Term)) -> Maybe (Comparison, Type) -> MetaInfo -> TCM (Term, Type) Source #
Type check a meta variable. If its type is not given, we return its type, or a fresh one, if it is a new meta. If its type is given, we check that the meta has this type, and we return the same type.
domainFree :: ArgInfo -> Binder' Name -> LamBinding Source #
Turn a domain-free binding (e.g. lambda) into a domain-full one, by inserting an underscore for the missing type.
:: [NamedArg Expr] | User-supplied arguments (hidden ones may be missing). |
-> Args | Inferred arguments (including hidden ones). |
-> Type | Type of the head (must be Pi-type with enough domains). |
-> TCM (Args, Type) | Remaining inferred arguments, remaining type. |
Check arguments whose value we already know.
This function can be used to check user-supplied parameters we have already computed by inference.
Precondition: The type t
of the head has enough domains.
:: NamedArg Expr | User-supplied argument. |
-> Args | Inferred arguments (including hidden ones). |
-> Type | Type of the head (must be Pi-type with enough domains). |
-> TCM (Args, Type) | Remaining inferred arguments, remaining type. |
Check an argument whose value we already know.
inferExpr :: Expr -> TCM (Term, Type) Source #
Infer the type of an expression. Implemented by checking against a meta variable. Except for neutrals, for them a polymorphic type is inferred.
inferExpr' :: ExpandHidden -> Expr -> TCM (Term, Type) Source #
checkDontExpandLast :: Comparison -> Expr -> Type -> TCM Term Source #
Used to check aliases f = e
.
Switches off ExpandLast
for the checking of top-level application.
isModuleFreeVar :: Int -> TCM Bool Source #
Check whether a de Bruijn index is bound by a module telescope.
inferExprForWith :: Arg Expr -> TCM (Term, Type) Source #
Infer the type of an expression, and if it is of the form
{tel} -> D vs
for some datatype D
then insert the hidden
arguments. Otherwise, leave the type polymorphic.
Let bindings
checkLetBindings :: Foldable t => t LetBinding -> TCM a -> TCM a Source #
checkLetBinding :: LetBinding -> TCM a -> TCM a Source #