HORIZON HASKELLDocslts/ghc-9.10.xc74966e2026-09-27Search names, modules, packages, or :: a typeCtrl K

GHC 9.10.3 · lts/ghc-9.10.x · c74966e · 2026-09-27

ModuleAgda-2.7.0.1Haskell2010

Agda.TypeChecking.Monad.Builtin

  • 3 types
  • 2 classes
  • 259 values
  • PackageAgda-2.7.0.1
  • Exports264
  • LanguageHaskell2010
  • LicenceMIT
  • SourceBuiltin.hs
classclass (Functor m, Applicative m, MonadFail m) => HasBuiltins (m :: Type -> Type) where
#
Instances17HasBuiltins, …
newtypenewtype BuiltinAccess a
#

The trivial implementation of HasBuiltins, using a constant TCState.

This may be used instead of TCMT/ReduceM where builtins must be accessed in a pure context.

Instances5Monad, Functor, MonadFail, Applicative, HasBuiltins
valuegetTerm :: (HasBuiltins m, IsBuiltin a) => String -> a -> 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.

Compute a SortKit in contexts that do not support failure (e.g. Reify). This should only be used when we are sure that the primitive sorts have been bound, i.e. because it is "after" type checking.

valuepathView :: 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.

Check whether the type is actually an equality (lhs ≡ rhs) and extract lhs, rhs, and their type.

Precondition: type is reduced.