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

Safe HaskellNone

Agda.TypeChecking.Reduce.Monad

Synopsis

Documentation

underAbstraction_ :: Subst a => Abs a -> (a -> ReduceM b) -> ReduceM bSource

getConstInfo :: HasConstInfo m => QName -> m DefinitionSource

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

traceSLn :: HasOptions m => VerboseKey -> Int -> String -> m a -> m aSource