Replace subst overloading with interfaces too (mostly)
This commit is contained in:
parent
cb5bd6c98c
commit
1a7efc104e
6 changed files with 84 additions and 154 deletions
|
|
@ -5,62 +5,60 @@ import Data.Vect
|
|||
|
||||
%default total
|
||||
|
||||
namespace CanDSubst
|
||||
public export
|
||||
interface CanDSubst (0 tm : Nat -> Nat -> Type) where
|
||||
(//) : tm dfrom n -> Lazy (DSubst dfrom dto) -> tm dto n
|
||||
|
||||
infixl 8 ///
|
||||
mutual
|
||||
namespace Term
|
||||
||| does the minimal reasonable work:
|
||||
||| - deletes the closure around an atomic constant like `TYPE`
|
||||
||| - deletes an identity substitution
|
||||
||| - composes (lazily) with an existing top-level dim-closure
|
||||
||| - otherwise, wraps in a new closure
|
||||
export
|
||||
(///) : Term q dfrom n -> DSubst dfrom dto -> Term q dto n
|
||||
s /// Shift SZ = s
|
||||
TYPE l /// _ = TYPE l
|
||||
DCloT s ph /// th = DCloT s $ ph . th
|
||||
s /// th = DCloT s th
|
||||
||| does the minimal reasonable work:
|
||||
||| - deletes the closure around an atomic constant like `TYPE`
|
||||
||| - deletes an identity substitution
|
||||
||| - composes (lazily) with an existing top-level dim-closure
|
||||
||| - otherwise, wraps in a new closure
|
||||
export
|
||||
CanDSubst (Term q) where
|
||||
s // Shift SZ = s
|
||||
TYPE l // _ = TYPE l
|
||||
DCloT s ph // th = DCloT s $ ph . th
|
||||
s // th = DCloT s th
|
||||
|
||||
namespace Elim
|
||||
private
|
||||
subDArgs : Elim q dfrom n -> DSubst dfrom dto -> Elim q dto n
|
||||
subDArgs (f :% d) th = subDArgs f th :% (d // th)
|
||||
subDArgs e th = DCloE e th
|
||||
private
|
||||
subDArgs : Elim q dfrom n -> DSubst dfrom dto -> Elim q dto n
|
||||
subDArgs (f :% d) th = subDArgs f th :% (d // th)
|
||||
subDArgs e th = DCloE e th
|
||||
|
||||
||| does the minimal reasonable work:
|
||||
||| - deletes the closure around a term variable
|
||||
||| - deletes an identity substitution
|
||||
||| - composes (lazily) with an existing top-level dim-closure
|
||||
||| - immediately looks up bound variables in a
|
||||
||| top-level sequence of dimension applications
|
||||
||| - otherwise, wraps in a new closure
|
||||
export
|
||||
(///) : Elim q dfrom n -> DSubst dfrom dto -> Elim q dto n
|
||||
e /// Shift SZ = e
|
||||
F x /// _ = F x
|
||||
B i /// _ = B i
|
||||
f :% d /// th = subDArgs (f :% d) th
|
||||
DCloE e ph /// th = DCloE e $ ph . th
|
||||
e /// th = DCloE e th
|
||||
||| does the minimal reasonable work:
|
||||
||| - deletes the closure around a term variable
|
||||
||| - deletes an identity substitution
|
||||
||| - composes (lazily) with an existing top-level dim-closure
|
||||
||| - immediately looks up bound variables in a
|
||||
||| top-level sequence of dimension applications
|
||||
||| - otherwise, wraps in a new closure
|
||||
export
|
||||
CanDSubst (Elim q) where
|
||||
e // Shift SZ = e
|
||||
F x // _ = F x
|
||||
B i // _ = B i
|
||||
f :% d // th = subDArgs (f :% d) th
|
||||
DCloE e ph // th = DCloE e $ ph . th
|
||||
e // th = DCloE e th
|
||||
|
||||
namespace ScopeTermN
|
||||
export
|
||||
(///) : ScopeTermN s q dfrom n -> DSubst dfrom dto -> ScopeTermN s q dto n
|
||||
TUsed body /// th = TUsed $ body /// th
|
||||
TUnused body /// th = TUnused $ body /// th
|
||||
export
|
||||
CanDSubst (ScopeTermN s q) where
|
||||
TUsed body // th = TUsed $ body // th
|
||||
TUnused body // th = TUnused $ body // th
|
||||
|
||||
namespace DScopeTermN
|
||||
export
|
||||
(///) : {s : Nat} ->
|
||||
DScopeTermN s q dfrom n -> DSubst dfrom dto ->
|
||||
DScopeTermN s q dto n
|
||||
DUsed body /// th = DUsed $ body /// pushN s th
|
||||
DUnused body /// th = DUnused $ body /// th
|
||||
export
|
||||
{s : Nat} -> CanDSubst (DScopeTermN s q) where
|
||||
DUsed body // th = DUsed $ body // pushN s th
|
||||
DUnused body // th = DUnused $ body // th
|
||||
|
||||
|
||||
export %inline FromVar (Elim q d) where fromVar = B
|
||||
export %inline FromVar (Term q d) where fromVar = E . fromVar
|
||||
|
||||
|
||||
||| does the minimal reasonable work:
|
||||
||| - deletes the closure around a *free* name
|
||||
||| - deletes an identity substitution
|
||||
|
|
@ -68,7 +66,7 @@ export %inline FromVar (Term q d) where fromVar = E . fromVar
|
|||
||| - immediately looks up a bound variable
|
||||
||| - otherwise, wraps in a new closure
|
||||
export
|
||||
CanSubst (Elim q d) (Elim q d) where
|
||||
CanSubstSelf (Elim q d) where
|
||||
F x // _ = F x
|
||||
B i // th = th !! i
|
||||
CloE e ph // th = assert_total CloE e $ ph . th
|
||||
|
|
@ -76,6 +74,11 @@ CanSubst (Elim q d) (Elim q d) where
|
|||
Shift SZ => e
|
||||
th => CloE e th
|
||||
|
||||
namespace CanTSubst
|
||||
public export
|
||||
interface CanTSubst (0 tm : TermLike) where
|
||||
(//) : tm q d from -> Lazy (TSubst q d from to) -> tm q d to
|
||||
|
||||
||| does the minimal reasonable work:
|
||||
||| - deletes the closure around an atomic constant like `TYPE`
|
||||
||| - deletes an identity substitution
|
||||
|
|
@ -83,7 +86,7 @@ CanSubst (Elim q d) (Elim q d) where
|
|||
||| - goes inside `E` in case it is a simple variable or something
|
||||
||| - otherwise, wraps in a new closure
|
||||
export
|
||||
CanSubst (Elim q d) (Term q d) where
|
||||
CanTSubst Term where
|
||||
TYPE l // _ = TYPE l
|
||||
E e // th = E $ e // th
|
||||
CloT s ph // th = CloT s $ ph . th
|
||||
|
|
@ -92,114 +95,45 @@ CanSubst (Elim q d) (Term q d) where
|
|||
th => CloT s th
|
||||
|
||||
export %inline
|
||||
{s : Nat} -> CanSubst (Elim q d) (ScopeTermN s q d) where
|
||||
{s : Nat} -> CanTSubst (ScopeTermN s) where
|
||||
TUsed body // th = TUsed $ body // pushN s th
|
||||
TUnused body // th = TUnused $ body // th
|
||||
|
||||
export %inline
|
||||
{s : Nat} -> CanSubst (Elim q d) (DScopeTermN s q d) where
|
||||
DUsed body // th = DUsed $ body // map (/// shift s) th
|
||||
{s : Nat} -> CanTSubst (DScopeTermN s) where
|
||||
DUsed body // th = DUsed $ body // map (// shift s) th
|
||||
DUnused body // th = DUnused $ body // th
|
||||
|
||||
export %inline CanSubst Var (Term q d) where s // th = s // map (B {q, d}) th
|
||||
export %inline CanSubst Var (Elim q d) where e // th = e // map (B {q, d}) th
|
||||
|
||||
export %inline
|
||||
{s : Nat} -> CanSubst Var (ScopeTermN s q d) where
|
||||
b // th = b // map (B {q, d}) th
|
||||
|
||||
export %inline
|
||||
{s : Nat} -> CanSubst Var (DScopeTermN s q d) where
|
||||
b // th = b // map (B {q, d}) th
|
||||
|
||||
|
||||
infixl 8 //., ///
|
||||
mutual
|
||||
namespace Term
|
||||
||| applies a term substitution with a less ambiguous type
|
||||
export %inline
|
||||
(//.) : Term q d from -> TSubst q d from to -> Term q d to
|
||||
t //. th = t // th
|
||||
|
||||
||| applies a term and dimension substitution
|
||||
public export %inline
|
||||
subs : Term q dfrom from -> DSubst dfrom dto -> TSubst q dto from to ->
|
||||
Term q dto to
|
||||
subs s th ph = s /// th // ph
|
||||
|
||||
namespace Elim
|
||||
||| applies a term substitution with a less ambiguous type
|
||||
export %inline
|
||||
(//.) : Elim q d from -> TSubst q d from to -> Elim q d to
|
||||
e //. th = e // th
|
||||
|
||||
||| applies a term and dimension substitution
|
||||
public export %inline
|
||||
subs : Elim q dfrom from -> DSubst dfrom dto -> TSubst q dto from to ->
|
||||
Elim q dto to
|
||||
subs e th ph = e /// th // ph
|
||||
|
||||
namespace ScopeTermN
|
||||
||| applies a term substitution with a less ambiguous type
|
||||
export %inline
|
||||
(//.) : {s : Nat} ->
|
||||
ScopeTermN s q d from -> TSubst q d from to ->
|
||||
ScopeTermN s q d to
|
||||
body //. th = body // th
|
||||
|
||||
||| applies a term and dimension substitution
|
||||
public export %inline
|
||||
subs : {s : Nat} ->
|
||||
ScopeTermN s q dfrom from ->
|
||||
DSubst dfrom dto -> TSubst q dto from to ->
|
||||
ScopeTermN s q dto to
|
||||
subs body th ph = body /// th // ph
|
||||
|
||||
namespace DScopeTermN
|
||||
||| applies a term substitution with a less ambiguous type
|
||||
export %inline
|
||||
(//.) : {s : Nat} -> DScopeTermN s q d from -> TSubst q d from to ->
|
||||
DScopeTermN s q d to
|
||||
body //. th = body // th
|
||||
|
||||
||| applies a term and dimension substitution
|
||||
public export %inline
|
||||
subs : {s : Nat} ->
|
||||
DScopeTermN s q dfrom from ->
|
||||
DSubst dfrom dto -> TSubst q dto from to ->
|
||||
DScopeTermN s q dto to
|
||||
subs body th ph = body /// th // ph
|
||||
|
||||
export %inline CanShift (Term q d) where s // by = s //. Shift by
|
||||
export %inline CanShift (Elim q d) where e // by = e //. Shift by
|
||||
export %inline CanShift (Term q d) where s // by = s // Shift by
|
||||
export %inline CanShift (Elim q d) where e // by = e // Shift by
|
||||
|
||||
export %inline
|
||||
{s : Nat} -> CanShift (ScopeTermN s q d) where
|
||||
b // by = b //. Shift by
|
||||
b // by = b // Shift by
|
||||
|
||||
|
||||
export %inline
|
||||
comp : DSubst dfrom dto -> TSubst q dfrom from mid -> TSubst q dto mid to ->
|
||||
TSubst q dto from to
|
||||
comp th ps ph = map (/// th) ps . ph
|
||||
comp th ps ph = map (// th) ps . ph
|
||||
|
||||
|
||||
public export %inline
|
||||
dweakT : {by : Nat} -> Term q d n -> Term q (by + d) n
|
||||
dweakT t = t /// shift by
|
||||
dweakT t = t // shift by
|
||||
|
||||
public export %inline
|
||||
dweakE : {by : Nat} -> Elim q d n -> Elim q (by + d) n
|
||||
dweakE t = t /// shift by
|
||||
dweakE t = t // shift by
|
||||
|
||||
|
||||
public export %inline
|
||||
weakT : {default 1 by : Nat} -> Term q d n -> Term q d (by + n)
|
||||
weakT t = t //. shift by
|
||||
weakT t = t // shift by
|
||||
|
||||
public export %inline
|
||||
weakE : {default 1 by : Nat} -> Elim q d n -> Elim q d (by + n)
|
||||
weakE t = t //. shift by
|
||||
weakE t = t // shift by
|
||||
|
||||
|
||||
namespace ScopeTermN
|
||||
|
|
@ -226,7 +160,7 @@ sub1 t e = subN t [e]
|
|||
|
||||
export %inline
|
||||
dsubN : DScopeTermN s q d n -> Vect s (Dim d) -> Term q d n
|
||||
dsubN (DUsed body) ps = body /// fromVect ps
|
||||
dsubN (DUsed body) ps = body // fromVect ps
|
||||
dsubN (DUnused body) _ = body
|
||||
|
||||
export %inline
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue