Agda-2.6.0.1: A dependently typed functional programming language and proof assistant

Safe HaskellNone
LanguageHaskell2010

Agda.TypeChecking.Reduce.Monad

Contents

Synopsis

Documentation

enterClosure :: Closure a -> (a -> ReduceM b) -> ReduceM b Source #

underAbstraction :: (MonadReduce m, Subst t a) => Dom Type -> Abs a -> (a -> m b) -> m b Source #

underAbstraction_ :: (MonadReduce m, Subst t a) => Abs a -> (a -> m b) -> m b Source #

addCtxTel :: MonadReduce m => Telescope -> m a -> m a Source #

getConstInfo :: HasConstInfo m => QName -> m Definition Source #

Lookup the definition of a name. The result is a closed thing, all free variables have been abstracted over.

applyWhenVerboseS :: HasOptions m => VerboseKey -> Int -> (m a -> m a) -> m a -> m a Source #

Apply a function if a certain verbosity level is activated.

Precondition: The level must be non-negative.

Orphan instances