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

Safe Haskell | None
Language | Haskell2010

Agda.TypeChecking.Reduce.Monad

Contents

- Orphan instances

Synopsis

- constructorForm :: Term -> ReduceM Term
- enterClosure :: Closure a -> (a -> ReduceM b) -> ReduceM b
- underAbstraction_ :: Subst t a => Abs a -> (a -> ReduceM b) -> ReduceM b
- getConstInfo :: HasConstInfo m => QName -> m Definition
- isInstantiatedMeta :: MetaId -> ReduceM Bool
- lookupMeta :: MetaId -> ReduceM MetaVariable
- traceSLn :: HasOptions m => VerboseKey -> Int -> String -> m a -> m a
- traceSDoc :: VerboseKey -> Int -> TCM Doc -> ReduceM a -> ReduceM a
- askR :: ReduceM ReduceEnv
- applyWhenVerboseS :: HasOptions m => VerboseKey -> Int -> (m a -> m a) -> m a -> m a

# Documentation

constructorForm :: Term -> ReduceM Term #

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

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

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

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

isInstantiatedMeta :: MetaId -> ReduceM Bool #

lookupMeta :: MetaId -> ReduceM MetaVariable #

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

traceSDoc :: VerboseKey -> Int -> TCM Doc -> ReduceM a -> ReduceM a #

askR :: ReduceM ReduceEnv #

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

Apply a function if a certain verbosity level is activated.

Precondition: The level must be non-negative.

# Orphan instances

HasOptions ReduceM # |
Methods pragmaOptions :: ReduceM PragmaOptions # commandLineOptions :: ReduceM CommandLineOptions #
HasBuiltins ReduceM # |
Methods getBuiltinThing :: String -> ReduceM (Maybe (Builtin PrimFun)) #
HasConstInfo ReduceM # |
Methods getConstInfo :: QName -> ReduceM Definition # getRewriteRulesFor :: QName -> ReduceM RewriteRules #