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

  • 6 classes
  • 27 values
  • PackageAgda-2.7.0.1
  • Exports39
  • LanguageHaskell2010
  • LicenceMIT
  • SourceReduce.hs
classclass Instantiate t where
#

Instantiate something. Results in an open meta variable or a non meta. Doesn't do any reduction, and preserves blocking tags (when blocking meta is uninstantiated).

Instances25Instantiate, …
classclass InstantiateFull t where
#

instantiateFull' instantiates metas everywhere (and recursively) but does not reduce.

Instances65InstantiateFull, …
classclass IsMeta a where
#

Is something (an elimination of) a meta variable? Does not perform any reductions.

Instances8IsMeta, …
classclass Reduce t where
#
Instances24Reduce, …
  • Reduce DeBruijnPatternDefined in Agda-2.7.0.1 · Agda.TypeChecking.Reduce
  • Reduce ElimDefined in Agda-2.7.0.1 · Agda.TypeChecking.Reduce
  • Reduce EqualityViewDefined in Agda-2.7.0.1 · Agda.TypeChecking.Reduce
  • Reduce LevelDefined in Agda-2.7.0.1 · Agda.TypeChecking.Reduce
  • Reduce PlusLevelDefined in Agda-2.7.0.1 · Agda.TypeChecking.Reduce
  • Reduce SortDefined in Agda-2.7.0.1 · Agda.TypeChecking.Reduce
  • Reduce TelescopeDefined in Agda-2.7.0.1 · Agda.TypeChecking.Reduce
  • Reduce TermDefined in Agda-2.7.0.1 · Agda.TypeChecking.Reduce
  • Reduce TypeDefined in Agda-2.7.0.1 · Agda.TypeChecking.Reduce
  • Reduce CandidateDefined in Agda-2.7.0.1 · Agda.TypeChecking.Reduce
  • Reduce CompareAsDefined in Agda-2.7.0.1 · Agda.TypeChecking.Reduce
  • Reduce ConstraintDefined in Agda-2.7.0.1 · Agda.TypeChecking.Reduce
  • Reduce UnifyStateDefined in Agda-2.7.0.1 · Agda.TypeChecking.Rules.LHS.Unify.Types

    Don't ever reduce the whole varTel, as it will destroy readability of the context in interactive editing! To make sure this insight is not lost, the following dummy instance should prevent a proper Reduce instance for UnifyState.

  • Reduce a => Reduce (Closure a)Defined in Agda-2.7.0.1 · Agda.TypeChecking.Reduce
  • Reduce a => Reduce (FamilyOrNot a)Defined in Agda-2.7.0.1 · Agda.TypeChecking.Primitive.Cubical.Base
  • Reduce t => Reduce (Arg t)Defined in Agda-2.7.0.1 · Agda.TypeChecking.Reduce
  • Reduce t => Reduce (Dom t)Defined in Agda-2.7.0.1 · Agda.TypeChecking.Reduce
  • Reduce t => Reduce (IPBoundary' t)Defined in Agda-2.7.0.1 · Agda.TypeChecking.Reduce
  • Reduce t => Reduce (Maybe t)Defined in Agda-2.7.0.1 · Agda.TypeChecking.Reduce
  • Reduce t => Reduce [t]Defined in Agda-2.7.0.1 · Agda.TypeChecking.Reduce
  • (Subst a, Reduce a) => Reduce (Abs a)Defined in Agda-2.7.0.1 · Agda.TypeChecking.Reduce
  • Reduce e => Reduce (Map k e)Defined in Agda-2.7.0.1 · Agda.TypeChecking.Reduce
  • (Reduce a, Reduce b) => Reduce (a, b)Defined in Agda-2.7.0.1 · Agda.TypeChecking.Reduce
  • (Reduce a, Reduce b, Reduce c) => Reduce (a, b, c)Defined in Agda-2.7.0.1 · Agda.TypeChecking.Reduce
valuefromBlocked :: MonadBlock m => Blocked a -> m a
#

Throw a pattern violation if the argument is Blocked, otherwise return the value embedded in the NotBlocked.

classclass Simplify t where
#

Only unfold definitions if this leads to simplification which means that a constructor/literal pattern is matched. We include reduction of IApply patterns, as `p i0` is akin to matcing on the i0 constructor of interval.

Instances26Simplify, …
classclass Normalise t where
#
Instances32Normalise, …