if m <=k then
C.Rel m (*CSC: che succede se c'e' un Def? Dovrebbe averlo gia' *)
(*CSC: deliftato la regola per il LetIn *)
+ (*CSC: FALSO! La regola per il LetIn non lo fa *)
else
(match List.nth context (m-k-1) with
- Some (_,C.Def (t,_)) -> deliftaux k (S.lift m t)
+ Some (_,C.Def (t,_)) ->
+ (*CSC: Hmmm. This bit of reduction is not in the spirit of *)
+ (*CSC: first order unification. Does it help or does it harm? *)
+ deliftaux k (S.lift m t)
| Some (_,C.Decl t) ->
(* It may augment to_be_restricted *)
+ (*CSC: Really? Even in the case of well-typed terms? *)
+ (*CSC: I am no longer sure of the usefulness of the check *)
ignore (deliftaux k (S.lift m t)) ;
C.Rel ((position (m-k) l) + k)
| None -> raise RelToHiddenHypothesis)