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

Safe HaskellSafe
LanguageHaskell2010

Agda.Auto.NarrowingSearch

Synopsis

Documentation

type Prio = Int #

class Trav a blk | a -> blk where #

Minimal complete definition

trav

Methods

trav :: Monad m => (forall b. Trav b blk => MM b blk -> m ()) -> a -> m () #

Instances

Trav a blk => Trav (MM a blk) blk # 

Methods

trav :: Monad m => (forall b. Trav b blk => MM b blk -> m ()) -> MM a blk -> m () #

data Term blk #

Constructors

Trav a blk => Term a 

data Prop blk #

Result of type-checking.

Constructors

OK

Success.

Error String

Definite failure.

AddExtraRef String (Metavar a blk) (Int, RefCreateEnv blk a)

Experimental.

And (Maybe [Term blk]) (MetaEnv (PB blk)) (MetaEnv (PB blk))

Parallel conjunction of constraints.

Sidecondition (MetaEnv (PB blk)) (MetaEnv (PB blk))

Experimental, related to mcompoint. First arg is sidecondition.

Or Prio (MetaEnv (PB blk)) (MetaEnv (PB blk))

Forking proof on something that is not part of the term language. E.g. whether a term will reduce or not.

ConnectHandle (OKHandle blk) (MetaEnv (PB blk))

Obsolete.

data OKVal #

Constructors

OKVal 

Instances

Refinable OKVal blk # 

Methods

refinements :: blk -> [blk] -> Metavar OKVal blk -> IO [(Int, RefCreateEnv blk OKVal)] #

type OKHandle blk = MM OKVal blk #

type OKMeta blk = Metavar OKVal blk #

data Metavar a blk #

Agsy's meta variables.

a the type of the metavariable (what it can be instantiated with). blk the search control information (e.g. the scope of the meta).

Constructors

Metavar 

Fields

Instances

Eq (Metavar a blk) # 

Methods

(==) :: Metavar a blk -> Metavar a blk -> Bool #

(/=) :: Metavar a blk -> Metavar a blk -> Bool #

hequalMetavar :: Metavar a1 blk1 -> Metavar a2 bkl2 -> Bool #

newMeta :: IORef [SubConstraints blk] -> IO (Metavar a blk) #

initMeta :: IO (Metavar a blk) #

data CTree blk #

Constructors

CTree 

Fields

data SubConstraints blk #

Constructors

SubConstraints 

Fields

newCTree :: Maybe (CTree blk) -> IO (CTree blk) #

data PrioMeta blk #

Constructors

Refinable a blk => PrioMeta Prio (Metavar a blk) 
NoPrio Bool 

Instances

Eq (PrioMeta blk) # 

Methods

(==) :: PrioMeta blk -> PrioMeta blk -> Bool #

(/=) :: PrioMeta blk -> PrioMeta blk -> Bool #

data Restore #

Constructors

Restore (IORef a) a 

uwriteIORef :: IORef a -> a -> Undo () #

umodifyIORef :: IORef a -> (a -> a) -> Undo () #

ureadmodifyIORef :: IORef a -> (a -> a) -> Undo a #

runUndo :: Undo a -> IO a #

data Pair a b #

Constructors

Pair a b 

class Refinable a blk where #

Minimal complete definition

refinements

Methods

refinements :: blk -> [blk] -> Metavar a blk -> IO [(Int, RefCreateEnv blk a)] #

Instances

Refinable Choice blk # 

Methods

refinements :: blk -> [blk] -> Metavar Choice blk -> IO [(Int, RefCreateEnv blk Choice)] #

Refinable OKVal blk # 

Methods

refinements :: blk -> [blk] -> Metavar OKVal blk -> IO [(Int, RefCreateEnv blk OKVal)] #

type BlkInfo blk = (Bool, Prio, Maybe blk) #

data MM a blk #

Constructors

NotM a 
Meta (Metavar a blk) 

Instances

Trav a blk => Trav (MM a blk) blk # 

Methods

trav :: Monad m => (forall b. Trav b blk => MM b blk -> m ()) -> MM a blk -> m () #

type MetaEnv = IO #

data MB a blk #

Constructors

NotB a 
Refinable b blk => Blocked (Metavar b blk) (MetaEnv (MB a blk)) 
Failed String 

data PB blk #

Constructors

NotPB (Prop blk) 
Refinable b blk => PBlocked (Metavar b blk) (BlkInfo blk) (MetaEnv (PB blk)) 
(Refinable b1 blk, Refinable b2 blk) => PDoubleBlocked (Metavar b1 blk) (Metavar b2 blk) (MetaEnv (PB blk)) 

data QPB b blk #

Constructors

QPBlocked (BlkInfo blk) (MetaEnv (PB blk)) 
QPDoubleBlocked (IORef Bool) (MetaEnv (PB blk)) 

mmcase :: Refinable a blk => MM a blk -> (a -> MetaEnv (MB b blk)) -> MetaEnv (MB b blk) #

mmmcase :: MM a blk -> MetaEnv (MB b blk) -> (a -> MetaEnv (MB b blk)) -> MetaEnv (MB b blk) #

mmpcase :: Refinable a blk => BlkInfo blk -> MM a blk -> (a -> MetaEnv (PB blk)) -> MetaEnv (PB blk) #

doubleblock :: (Refinable a blk, Refinable b blk) => MM a blk -> MM b blk -> MetaEnv (PB blk) -> MetaEnv (PB blk) #

mbcase :: MetaEnv (MB a blk) -> (a -> MetaEnv (MB b blk)) -> MetaEnv (MB b blk) #

mbpcase :: Prio -> Maybe blk -> MetaEnv (MB a blk) -> (a -> MetaEnv (PB blk)) -> MetaEnv (PB blk) #

mmbpcase :: MetaEnv (MB a blk) -> (forall b. Refinable b blk => MM b blk -> MetaEnv (PB blk)) -> (a -> MetaEnv (PB blk)) -> MetaEnv (PB blk) #

waitok :: OKHandle blk -> MetaEnv (MB b blk) -> MetaEnv (MB b blk) #

mbret :: a -> MetaEnv (MB a blk) #

mbfailed :: String -> MetaEnv (MB a blk) #

mpret :: Prop blk -> MetaEnv (PB blk) #

expandbind :: MM a blk -> MetaEnv (MM a blk) #

type HandleSol = IO () #

topSearch :: forall blk. IORef Int -> IORef Int -> HandleSol -> blk -> MetaEnv (PB blk) -> Int -> Int -> IO Bool #

extractblkinfos :: Metavar a blk -> IO [blk] #

recalcs :: [(QPB a blk, Maybe (CTree blk))] -> Undo Bool #

recalc :: (QPB a blk, Maybe (CTree blk)) -> Undo Bool #

reccalc :: MetaEnv (PB blk) -> Maybe (CTree blk) -> Undo Bool #

calc :: forall blk. MetaEnv (PB blk) -> Maybe (CTree blk) -> Undo (Maybe [OKMeta blk]) #

choosePrioMeta :: Bool -> PrioMeta blk -> PrioMeta blk -> PrioMeta blk #

propagatePrio :: CTree blk -> Undo [OKMeta blk] #

data Choice #

Instances

Refinable Choice blk # 

Methods

refinements :: blk -> [blk] -> Metavar Choice blk -> IO [(Int, RefCreateEnv blk Choice)] #

choose :: MM Choice blk -> Prio -> MetaEnv (PB blk) -> MetaEnv (PB blk) -> MetaEnv (PB blk) #