(* kernel version: complete, relative, global *)
(* note : fragment of complete lambda-delta serving as abstract layer *)
+module C = Cps
module E = Entity
module N = Level
(* helpers ******************************************************************)
+let rec tshift t = function
+ | ESort -> t
+ | EBind (e, a, b) -> tshift (TBind (a, b, t)) e
+ | EProj (e, a, d) -> tshift (TProj (a, d, t)) e
+
+let tshift c t = tshift t c
+
+let rec eshift f c = function
+ | ESort -> f c
+ | EBind (e, a, b) -> let f ee = f (EBind (ee, a, b)) in eshift f c e
+ | EProj (e, a, d) -> let f ee = f (EProj (ee, a, d)) in eshift f c e
+
let empty_lenv = ESort
let push_bind f lenv a b = f (EBind (lenv, a, b))
let err kk = aux f (succ i) (k + kk) tl in
let f j = f i j (k + j) in
E.resolve err f id a
- | EProj _ -> assert false (* TODO *)
+ | EProj (tl, _, d) -> aux f i k (eshift C.start tl d)
in
aux f 0 0 lenv
if E.count_names a > j then f (k + j) else err i
| EBind (tl, a, _) ->
aux f (pred i) (k + E.count_names a) tl
- | EProj _ -> assert false (* TODO *)
+ | EProj (tl, _, d) -> aux f i k (eshift C.start tl d)
in
aux f i 0 lenv
| EBind (e, _, Void 0) -> get i e
| EBind (e, a, b) when i = 0 -> e, a, b
| EBind (e, _, _) -> get (pred i) e
- | EProj _ -> assert false (* TODO *)
+ | EProj (e, _, d) -> get i (eshift C.start e d)
let get e i = get i e