| Copyright | License : BSD3 |
|---|---|
| Maintainer | The Idris Community. |
| Safe Haskell | None |
| Language | Haskell98 |
Idris.Core.Evaluate
Contents
Description
- normalise :: Context -> Env -> TT Name -> TT Name
- normaliseTrace :: Bool -> Context -> Env -> TT Name -> TT Name
- normaliseC :: Context -> Env -> TT Name -> TT Name
- normaliseAll :: Context -> Env -> TT Name -> TT Name
- normaliseBlocking :: Context -> Env -> [Name] -> TT Name -> TT Name
- toValue :: Context -> Env -> TT Name -> Value
- quoteTerm :: Value -> TT Name
- rt_simplify :: Context -> Env -> TT Name -> TT Name
- simplify :: Context -> Env -> TT Name -> TT Name
- specialise :: Context -> Env -> [(Name, Int)] -> TT Name -> (TT Name, [(Name, Int)])
- hnf :: Context -> Env -> TT Name -> TT Name
- convEq :: Context -> [Name] -> TT Name -> TT Name -> StateT UCs TC Bool
- convEq' :: Context -> [Name] -> TT Name -> TT Name -> TC Bool
- data Def
- data CaseInfo = CaseInfo {}
- data CaseDefs = CaseDefs {
- cases_totcheck :: !([Name], SC)
- cases_compiletime :: !([Name], SC)
- cases_inlined :: !([Name], SC)
- cases_runtime :: !([Name], SC)
- data Accessibility
- type Injectivity = Bool
- data Totality
- data PReason
- = Other [Name]
- | Itself
- | NotCovering
- | NotPositive
- | UseUndef Name
- | ExternalIO
- | BelieveMe
- | Mutual [Name]
- | NotProductive
- data MetaInformation
- data Context
- initContext :: Context
- ctxtAlist :: Context -> [(Name, Def)]
- next_tvar :: Context -> Int
- addToCtxt :: Name -> Term -> Type -> Context -> Context
- setAccess :: Name -> Accessibility -> Context -> Context
- setInjective :: Name -> Injectivity -> Context -> Context
- setTotal :: Name -> Totality -> Context -> Context
- setMetaInformation :: Name -> MetaInformation -> Context -> Context
- addCtxtDef :: Name -> Def -> Context -> Context
- addTyDecl :: Name -> NameType -> Type -> Context -> Context
- addDatatype :: Datatype Name -> Context -> Context
- addCasedef :: Name -> ErasureInfo -> CaseInfo -> Bool -> SC -> Bool -> Bool -> [(Type, Bool)] -> [Int] -> [Either Term (Term, Term)] -> [([Name], Term, Term)] -> [([Name], Term, Term)] -> [([Name], Term, Term)] -> [([Name], Term, Term)] -> Type -> Context -> TC Context
- simplifyCasedef :: Name -> ErasureInfo -> Context -> TC Context
- addOperator :: Name -> Type -> Int -> ([Value] -> Maybe Value) -> Context -> Context
- lookupNames :: Name -> Context -> [Name]
- lookupTyName :: Name -> Context -> [(Name, Type)]
- lookupTyNameExact :: Name -> Context -> Maybe (Name, Type)
- lookupTy :: Name -> Context -> [Type]
- lookupTyExact :: Name -> Context -> Maybe Type
- lookupP :: Name -> Context -> [Term]
- lookupP_all :: Bool -> Bool -> Name -> Context -> [Term]
- lookupDef :: Name -> Context -> [Def]
- lookupNameDef :: Name -> Context -> [(Name, Def)]
- lookupDefExact :: Name -> Context -> Maybe Def
- lookupDefAcc :: Name -> Bool -> Context -> [(Def, Accessibility)]
- lookupDefAccExact :: Name -> Bool -> Context -> Maybe (Def, Accessibility)
- lookupVal :: Name -> Context -> [Value]
- mapDefCtxt :: (Def -> Def) -> Context -> Context
- lookupTotal :: Name -> Context -> [Totality]
- lookupTotalExact :: Name -> Context -> Maybe Totality
- lookupInjectiveExact :: Name -> Context -> Maybe Injectivity
- lookupNameTotal :: Name -> Context -> [(Name, Totality)]
- lookupMetaInformation :: Name -> Context -> [MetaInformation]
- lookupTyEnv :: Name -> Env -> Maybe (Int, Type)
- isTCDict :: Name -> Context -> Bool
- isCanonical :: Type -> Context -> Bool
- isDConName :: Name -> Context -> Bool
- canBeDConName :: Name -> Context -> Bool
- isTConName :: Name -> Context -> Bool
- isConName :: Name -> Context -> Bool
- isFnName :: Name -> Context -> Bool
- data Value
- class Quote a where
- initEval :: EvalState
- uniqueNameCtxt :: Context -> Name -> [Name] -> Name
- uniqueBindersCtxt :: Context -> [Name] -> TT Name -> TT Name
- definitions :: Context -> Ctxt (Def, Injectivity, Accessibility, Totality, MetaInformation)
- isUniverse :: Term -> Bool
Documentation
normaliseC :: Context -> Env -> TT Name -> TT Name Source #
Normalise fully type checked terms (so, assume all names/let bindings resolved)
normaliseAll :: Context -> Env -> TT Name -> TT Name Source #
Normalise everything, whether abstract, private or public
normaliseBlocking :: Context -> Env -> [Name] -> TT Name -> TT Name Source #
As normaliseAll, but with an explicit list of names *not* to reduce
rt_simplify :: Context -> Env -> TT Name -> TT Name Source #
Simplify for run-time (i.e. basic inlining)
simplify :: Context -> Env -> TT Name -> TT Name Source #
Like normalise, but we only reduce functions that are marked as okay to inline (and probably shouldn't reduce lets?) 20130908: now only used to reduce for totality checking. Inlining should be done elsewhere.
A definition is either a simple function (just an expression with a type), a constant, which could be a data or type constructor, an axiom or as an yet undefined function, or an Operator. An Operator is a function which explains how to reduce. A CaseOp is a function defined by a simple case tree
Constructors
| CaseInfo | |
Fields
| |
Constructors
| CaseDefs | |
Fields
| |
data Accessibility Source #
Instances
type Injectivity = Bool Source #
The result of totality checking
Reasons why a function may not be total
Constructors
| Other [Name] | |
| Itself | |
| NotCovering | |
| NotPositive | |
| UseUndef Name | |
| ExternalIO | |
| BelieveMe | |
| Mutual [Name] | |
| NotProductive |
data MetaInformation Source #
Constructors
| EmptyMI | No meta-information |
| DataMI [Int] | Meta information for a data declaration with position of parameters |
Instances
Contexts used for global definitions and for proof state. They contain universe constraints and existing definitions.
initContext :: Context Source #
The initial empty context
setInjective :: Name -> Injectivity -> Context -> Context Source #
setMetaInformation :: Name -> MetaInformation -> Context -> Context Source #
addCasedef :: Name -> ErasureInfo -> CaseInfo -> Bool -> SC -> Bool -> Bool -> [(Type, Bool)] -> [Int] -> [Either Term (Term, Term)] -> [([Name], Term, Term)] -> [([Name], Term, Term)] -> [([Name], Term, Term)] -> [([Name], Term, Term)] -> Type -> Context -> TC Context Source #
simplifyCasedef :: Name -> ErasureInfo -> Context -> TC Context Source #
lookupTyName :: Name -> Context -> [(Name, Type)] Source #
Get the list of pairs of fully-qualified names and their types that match some name
lookupTyNameExact :: Name -> Context -> Maybe (Name, Type) Source #
Get the pair of a fully-qualified name and its type, if there is a unique one matching the name used as a key.
lookupTyExact :: Name -> Context -> Maybe Type Source #
Get the single type that matches some name precisely
lookupDefAcc :: Name -> Bool -> Context -> [(Def, Accessibility)] Source #
lookupDefAccExact :: Name -> Bool -> Context -> Maybe (Def, Accessibility) Source #
lookupInjectiveExact :: Name -> Context -> Maybe Injectivity Source #
lookupMetaInformation :: Name -> Context -> [MetaInformation] Source #
isCanonical :: Type -> Context -> Bool Source #
Return true if the given type is a concrete type familyor primitive False it it's a function to compute a type or a variable
isDConName :: Name -> Context -> Bool Source #
Check whether a resolved name is certainly a data constructor
canBeDConName :: Name -> Context -> Bool Source #
Check whether any overloading of a name is a data constructor
A HOAS representation of values
Minimal complete definition
uniqueNameCtxt :: Context -> Name -> [Name] -> Name Source #
Create a unique name given context and other existing names
definitions :: Context -> Ctxt (Def, Injectivity, Accessibility, Totality, MetaInformation) Source #
isUniverse :: Term -> Bool Source #