Get the name of the current module, if any.
ModuleAgda-2.8.0.2Haskell2010
Agda.TypeChecking.Monad.Env
Synopsis
- value currentModule
- value withCurrentModule
- value getCurrentPath
- value getAnonymousVariables
- value withAnonymousModule
- value withEnv
- value getEnv
- value withHighlightingLevel
- value doExpandLast
- value dontExpandLast
- value reallyDontExpandLast
- value performedSimplification
- value performedSimplification'
- value getSimplification
- value updateAllowedReductions
- value modifyAllowedReductions
- value putAllowedReductions
- value onlyReduceProjections
- value allowAllReductions
- value allowNonTerminatingReductions
- value onlyReduceTypes
- value typeLevelReductions
- value insideDotPattern
- value isInsideDotPattern
- value callByName
- value dontFoldLetBindings
- PackageAgda-2.8.0.2
- Exports26
- LanguageHaskell2010
- LicenceMIT
- SourceEnv.hs
Set the name of the current module.
Get the path of the currently checked file
Get the number of variables bound by anonymous modules.
Add variables bound by an anonymous module.
Set the current environment to the given
Get the current environment
Set highlighting level
Restore setting for ExpandLast to default.
If the reduced did a proper match (constructor or literal pattern), then record this as simplification step.
Controlling reduction.
Lens for AllowedReductions.
Reduce Def f vs only if f is a projection.
Allow all reductions except for non-terminating functions (default).
Allow all reductions including non-terminating functions.
Allow all reductions when reducing types. Otherwise only allow inlined functions to be unfolded.
Update allowed reductions when working on types
Concerning envInsideDotPattern
Don't use call-by-need evaluation for the given computation.
Don't fold let bindings when printing. This is a bit crude since it disables any folding of let
bindings at all. In many cases it's better to use removeLetBinding before printing to drop
the let bindings that should not be folded.