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

Safe HaskellNone
LanguageHaskell2010

Agda.TypeChecking.Unquote

Synopsis

Documentation

data Dirty Source #

Constructors

Dirty 
Clean 

Instances

Eq Dirty Source # 

Methods

(==) :: Dirty -> Dirty -> Bool #

(/=) :: Dirty -> Dirty -> Bool #

class Unquote a where Source #

Minimal complete definition

unquote

Methods

unquote :: Term -> UnquoteM a Source #

Instances

Unquote Bool Source # 
Unquote Char Source # 
Unquote Double Source # 
Unquote Integer Source # 
Unquote Str Source # 
Unquote MetaId Source # 
Unquote ArgInfo Source # 
Unquote Relevance Source # 
Unquote Hiding Source # 
Unquote QName Source # 
Unquote Literal Source # 
Unquote Clause Source # 
Unquote Pattern Source # 
Unquote Sort Source # 
Unquote Term Source # 
Unquote Elim Source # 
Unquote ErrorPart Source # 
Unquote a => Unquote [a] Source # 

Methods

unquote :: Term -> UnquoteM [a] Source #

Unquote a => Unquote (Dom a) Source # 

Methods

unquote :: Term -> UnquoteM (Dom a) Source #

Unquote a => Unquote (Arg a) Source # 

Methods

unquote :: Term -> UnquoteM (Arg a) Source #

Unquote a => Unquote (Abs a) Source # 

Methods

unquote :: Term -> UnquoteM (Abs a) Source #

choice :: Monad m => [(m Bool, m a)] -> m a -> m a Source #

unquoteTCM :: Term -> Term -> UnquoteM Term Source #

Argument should be a term of type Term → TCM A for some A. Returns the resulting term of type A. The second argument is the term for the hole, which will typically be a metavariable. This is passed to the computation (quoted).