(* the delift function takes in input an ordered list of optional terms *)
(* [t1,...,tn] and a term t, and substitutes every tk = Some (rel(nk)) with *)
-(* rel(k). Typically, the list of optional terms is the explicit substitution *)(* that is applied to a metavariable occurrence and the result of the delift *)
+(* rel(k). Typically, the list of optional terms is the explicit substitution *)
+(* that is applied to a metavariable occurrence and the result of the delift *)
(* function is a term the implicit variable can be substituted with to make *)
(* the term [t] unifiable with the metavariable occurrence. *)
(* In general, the problem is undecidable if we consider equivalence in place *)
(* during the unwinding the eta-expansions are undone. *)
let apply_subst_reducing subst meta_to_reduce t =
+ (* andrea: che senso ha questo ref ?? *)
let unwinded = ref subst in
let rec um_aux =
let module C = Cic in