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

Safe Haskell | Safe
Language | Haskell2010

Agda.Auto.SearchControl

Contents

- Orphan instances

# Documentation

data ExpRefInfo o #

Constructors

ExpRefInfo |
Fields eriMain :: Maybe (RefInfo o) eriUnifs :: [RefInfo o] eriInfTypeUnknown, eriIsEliminand :: Bool eriUsedVars :: Maybe ([UId o], [Elr o]) eriIotaStep :: Maybe Bool eriPickSubsVar :: Bool eriEqRState :: Maybe EqReasoningState

getinfo :: [RefInfo o] -> ExpRefInfo o #

univar :: [CAction o] -> Nat -> Maybe Nat #

subsvars :: [CAction o] -> [Nat] #

extraref :: UId o -> [Maybe (UId o)] -> ConstRef o -> (Int, StateT (IORef [SubConstraints (RefInfo o)], Int) IO (Exp o)) #

costIncrease :: Int #

costUnificationOccurs :: Int #

costUnification :: Int #

costAppVar :: Int #

costAppVarUsed :: Int #

costAppHint :: Int #

costAppHintUsed :: Int #

costAppRecCall :: Int #

costAppRecCallUsed :: Int #

costAppConstructor :: Int #

costAppConstructorSingle :: Int #

costAppExtraRef :: Int #

costLam :: Int #

costLamUnfold :: Int #

costPi :: Int #

costSort :: Int #

costIotaStep :: Int #

costInferredTypeUnkown :: Int #

costAbsurdLam :: Int #

costEqStep :: Int #

costEqEnd :: Int #

costEqSym :: Int #

costEqCong :: Int #

prioNo :: Int #

prioTypeUnknown :: Int #

prioTypecheckArgList :: Int #

prioInferredTypeUnknown :: Int #

prioCompBeta :: Int #

prioCompBetaStructured :: Int #

prioCompareArgList :: Int #

prioCompIota :: Int #

prioCompChoice :: Int #

prioCompUnif :: Int #

prioCompCopy :: Int #

prioNoIota :: Int #

prioAbsurdLambda :: Int #

prioProjIndex :: Int #

prioTypecheck :: Bool -> Int #

# Orphan instances

Trav a blk => Trav [a] blk # |
Methods trav :: Monad m => (forall b. Trav b blk => MM b blk -> m ()) -> [a] -> m () #
Refinable (ICExp o) (RefInfo o) # |
Methods refinements :: RefInfo o -> [RefInfo o] -> Metavar (ICExp o) (RefInfo o) -> IO [(Int, RefCreateEnv (RefInfo o) (ICExp o))] #
Refinable (ArgList o) (RefInfo o) # |
Methods refinements :: RefInfo o -> [RefInfo o] -> Metavar (ArgList o) (RefInfo o) -> IO [(Int, RefCreateEnv (RefInfo o) (ArgList o))] #
Refinable (Exp o) (RefInfo o) # |
Methods refinements :: RefInfo o -> [RefInfo o] -> Metavar (Exp o) (RefInfo o) -> IO [(Int, RefCreateEnv (RefInfo o) (Exp o))] #
Refinable (ConstRef o) (RefInfo o) # |
Methods refinements :: RefInfo o -> [RefInfo o] -> Metavar (ConstRef o) (RefInfo o) -> IO [(Int, RefCreateEnv (RefInfo o) (ConstRef o))] #
Trav (ArgList o) (RefInfo o) # |
Methods trav :: Monad m => (forall b. Trav b (RefInfo o) => MM b (RefInfo o) -> m ()) -> ArgList o -> m () #
Trav (Exp o) (RefInfo o) # |
Methods trav :: Monad m => (forall b. Trav b (RefInfo o) => MM b (RefInfo o) -> m ()) -> Exp o -> m () #
Trav (MId, CExp o) (RefInfo o) # |
Methods trav :: Monad m => (forall b. Trav b (RefInfo o) => MM b (RefInfo o) -> m ()) -> (MId, CExp o) -> m () #
Trav (TrBr a o) (RefInfo o) # |
Methods trav :: Monad m => (forall b. Trav b (RefInfo o) => MM b (RefInfo o) -> m ()) -> TrBr a o -> m () #