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

Safe Haskell None Haskell98

Agda.TypeChecking.Rewriting

Contents

Description

Rewriting with arbitrary rules.

The user specifies a relation symbol by the pragma  {--}  where rel should be of type Δ → (lhs rhs : A) → Set i.

Then the user can add rewrite rules by the pragma  {--}  where q should be a closed term of type Γ → rel us lhs rhs.

We then intend to add a rewrite rule  Γ ⊢ lhs ↦ rhs : B  to the signature where B = A[us/Δ].

To this end, we normalize lhs, which should be of the form  f ts  for a Def-symbol f (postulate, function, data, record, constructor). Further, FV(ts) = dom(Γ). The rule q :: Γ ⊢ f ts ↦ rhs : B is added to the signature to the definition of f.

When reducing a term Ψ ⊢ f vs is stuck, we try the rewrites for f, by trying to unify vs with ts. This is for now done by substituting fresh metas Xs for the bound variables in ts and checking equality with vs  Ψ ⊢ (f ts)[XsΓ] = f vs : B[XsΓ]  If successful (no open metas/constraints), we replace f vs by rhs[Xs/Γ] and continue reducing.

Synopsis

# Documentation

Check that the name given to the BUILTIN REWRITE is actually a relation symbol. I.e., its type should be of the form Δ → (lhs rhs : A) → Set ℓ. Note: we do not care about hiding/non-hiding of lhs and rhs.

data RelView Source #

Deconstructing a type into Δ → t → t' → core.

Constructors

 RelView FieldsrelViewTel :: TelescopeThe whole telescope Δ, t, t'.relViewDelta :: ListTelΔ.relViewType :: Typet.relViewType' :: Typet'.relViewCore :: Typecore.

Deconstructing a type into Δ → t → t' → core. Returns Nothing if not enough argument types.

Add q : Γ → rel us lhs rhs as rewrite rule  Γ ⊢ lhs ↦ rhs : B  to the signature where B = A[us/Δ]. Remember that rel : Δ → A → A → Set i, so rel us : (lhs rhs : A[us/Δ]) → Set i.

Append rewrite rules to a definition.

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

rewrite t tries to rewrite a reduced term.

# Auxiliary functions

class NLPatVars a where Source #

Minimal complete definition

nlPatVars

Methods

nlPatVars :: a -> IntSet Source #

Instances

 Source # Methods (Foldable f, NLPatVars a) => NLPatVars (f a) Source # MethodsnlPatVars :: f a -> IntSet Source #

class KillCtxId a where Source #

Erase the CtxId's of rewrite rules

Minimal complete definition

killCtxId

Methods

killCtxId :: a -> a Source #

Instances

 Source # Methods Source # Methods (Functor f, KillCtxId a) => KillCtxId (f a) Source # MethodskillCtxId :: f a -> f a Source #