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

Safe HaskellNone

Agda.TypeChecking.Pretty

Contents

Synopsis

Wrappers for pretty printing combinators

type Doc = DocSource

pretty :: (Monad m, Pretty a) => a -> m DocSource

prettyA :: (Pretty c, ToConcrete a c) => a -> TCM DocSource

prettyAs :: (Pretty c, ToConcrete a [c]) => a -> TCM DocSource

text :: String -> TCM DocSource

pwords :: Monad m => String -> [m Doc]Source

fwords :: Monad m => String -> m DocSource

hcat :: (Monad f, Functor f) => [f Doc] -> f DocSource

nest :: Functor f => Int -> f Doc -> f DocSource

braces :: Functor f => f Doc -> f DocSource

dbraces :: Functor f => f Doc -> f DocSource

brackets :: Functor f => f Doc -> f DocSource

parens :: Functor f => f Doc -> f DocSource

prettyList :: [TCM Doc] -> TCMT IO DocSource

The PrettyTCM class

class PrettyTCM a whereSource

Methods

prettyTCM :: a -> TCM DocSource

Instances

PrettyTCM Bool 
PrettyTCM Permutation 
PrettyTCM Range 
PrettyTCM Interval 
PrettyTCM Position 
PrettyTCM Nat 
PrettyTCM Relevance 
PrettyTCM Name 
PrettyTCM ModuleName 
PrettyTCM QName 
PrettyTCM Name 
PrettyTCM Literal 
PrettyTCM Expr 
PrettyTCM Pattern 
PrettyTCM ClauseBody 
PrettyTCM MetaId 
PrettyTCM Level 
PrettyTCM Sort 
PrettyTCM Telescope 
PrettyTCM Type 
PrettyTCM Elim 
PrettyTCM Term 
PrettyTCM ConHead 
PrettyTCM TCErr 
PrettyTCM TypeError 
PrettyTCM SplitError 
PrettyTCM CallInfo 
PrettyTCM Context 
PrettyTCM Call 
PrettyTCM Occurrence 
PrettyTCM RewriteRule 
PrettyTCM DisplayTerm 
PrettyTCM TypeCheckingProblem 
PrettyTCM Comparison 
PrettyTCM Constraint 
PrettyTCM ProblemConstraint 
PrettyTCM NamedClause 
PrettyTCM PrettyContext 
PrettyTCM AsBinding 
PrettyTCM DotPatternInst 
PrettyTCM DeBruijnPat 
PrettyTCM Node 
PrettyTCM OccursWhere 
PrettyTCM HypSizeConstraint 
PrettyTCM SizeConstraint

Assumes we are in the right context.

PrettyTCM SizeMeta 
PrettyTCM a => PrettyTCM [a] 
(Reify a e, ToConcrete e c, Pretty c) => PrettyTCM (Named_ a) 
PrettyTCM a => PrettyTCM (Blocked a) 
(Reify a e, ToConcrete e c, Pretty c) => PrettyTCM (Dom a) 
(Reify a e, ToConcrete e c, Pretty c) => PrettyTCM (Arg a) 
PrettyTCM a => PrettyTCM (MaybeReduced a) 
PrettyTCM a => PrettyTCM (Closure a) 
PrettyTCM a => PrettyTCM (HomHet a) 
(PrettyTCM a, PrettyTCM b) => PrettyTCM (a, b) 
(PrettyTCM n, PrettyTCM (WithNode n e)) => PrettyTCM (Graph n e) 
(PrettyTCM a, PrettyTCM b) => PrettyTCM (Judgement a b) 
PrettyTCM n => PrettyTCM (WithNode n Occurrence) 
PrettyTCM n => PrettyTCM (WithNode n Edge)