Hoogle Search
Within LTS Haskell 24.32 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
Agda Agda.TypeChecking.Rules.Data Ensure that the type is a sort. If it is not directly a sort, compare it to a newSortMetaBelowInf.
-
Agda Agda.TypeChecking.Rules.LHS No documentation available.
checkTelePiSort :: Type -> TCM ()Agda Agda.TypeChecking.Sort Recursively check that an iterated function type constructed by telePi is well-sorted.
hasBiggerSort :: Sort -> TCM ()Agda Agda.TypeChecking.Sort No documentation available.
ifIsSort :: (MonadReduce m, MonadBlock m) => Type -> (Sort -> m a) -> m a -> m aAgda Agda.TypeChecking.Sort No documentation available.
ifNotSort :: (MonadReduce m, MonadBlock m) => Type -> m a -> (Sort -> m a) -> m aAgda Agda.TypeChecking.Sort No documentation available.
inferFunSort :: (PureTCM m, MonadConstraint m) => Dom Type -> Sort -> m SortAgda Agda.TypeChecking.Sort As inferPiSort, but for a nondependent function type.
inferPiSort :: (PureTCM m, MonadConstraint m) => Dom Type -> Abs Sort -> m SortAgda Agda.TypeChecking.Sort Infer the sort of a Pi type. If we can compute the sort straight away, return that. Otherwise, return a PiSort and add a constraint to ensure we can compute the sort eventually.
inferUnivSort :: (PureTCM m, MonadConstraint m) => Sort -> m SortAgda Agda.TypeChecking.Sort Infer the sort of another sort. If we can compute the bigger sort straight away, return that. Otherwise, return UnivSort s and add a constraint to ensure we can compute the sort eventually.
shouldBeSort :: (PureTCM m, MonadBlock m, MonadError TCErr m) => Type -> m SortAgda Agda.TypeChecking.Sort Result is in reduced form.