Agda-2.4.0: 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