crude but effective stratification

lib/Quox/Typechecker.idr

@@ -2,6 +2,7 @@ module Quox.Typechecker
 
 import public Quox.Typing
 import public Quox.Equal
+import Quox.Displace
 
 import Data.List
 import Data.SnocVect
@@ -107,8 +108,14 @@ mutual
            TC (CheckResult' n)
   checkC ctx sg subj ty =
     wrapErr (WhileChecking ctx sg.fst subj ty) $
-      let Element subj nc = pushSubsts subj in
-      check' ctx sg subj ty
+    checkCNoWrap ctx sg subj ty
+
+  export covering %inline
+  checkCNoWrap : (ctx : TyContext d n) -> SQty -> Term d n -> Term d n ->
+                 TC (CheckResult' n)
+  checkCNoWrap ctx sg subj ty =
+    let Element subj nc = pushSubsts subj in
+    check' ctx sg subj ty
 
   ||| "Ψ | Γ ⊢₀ s ⇐ ★ᵢ"
   |||
@@ -324,14 +331,14 @@ mutual
            (subj : Elim d n) -> (0 nc : NotClo subj) =>
            TC (InferResult' d n)
 
-  infer' ctx sg (F x loc) = do
+  infer' ctx sg (F x u loc) = do
     -- if π·x : A {≔ s} in global context
     g <- lookupFree x loc !defs
     -- if σ ≤ π
     expectCompatQ loc sg.fst g.qty.fst
     -- then Ψ | Γ ⊢ σ · x ⇒ A ⊳ 𝟎
     let Val d = ctx.dimLen; Val n = ctx.termLen
-    pure $ InfRes {type = g.type, qout = zeroFor ctx}
+    pure $ InfRes {type = displace u g.type, qout = zeroFor ctx}
 
   infer' ctx sg (B i _) =
     -- if x : A ∈ Γ