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

Safe HaskellNone

Agda.Auto.Convert

Documentation

norm :: Normalise t => t -> TCM tSource

data TMode Source

Constructors

TMAll 

Instances

type MapS a b = (Map a b, [a])Source

initMapS :: (Map k a, [a1])Source

popMapS :: MonadState s m => (s -> (t, [a])) -> ((t, [a]) -> s -> s) -> m (Maybe a)Source

type TOM = StateT S TCMSource

tomyClauses :: [Clause] -> StateT S TCM [([Pat O], MExp O)]Source

tomyClause :: Clause -> StateT S TCM (Maybe ([Pat O], MExp O))Source

tomyPat :: Arg Pattern -> StateT S TCM (Pat O)Source

tomyBody :: Num t => ClauseBody -> StateT S (TCMT IO) (Maybe (MExp O, t))Source

tomyExps :: [Arg Term] -> StateT S TCM (MM (ArgList O) (RefInfo O))Source