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

Safe HaskellNone

Agda.TypeChecking.Rewriting

Synopsis

Documentation

addRewriteRules :: QName -> RewriteRules -> TCM ()Source

Append rewrite rules to a definition.

rewriteWith :: Maybe Type -> Term -> RewriteRule -> TCM (Maybe Term)Source

rewriteWith t v rew tries to rewrite v : t with rew, returning the reduct if successful.

rewrite :: Term -> TCM (Maybe Term)Source

rewrite t tries to rewrite a reduced term.