(**** DELIFT ****)
-(* the delift function takes in input an ordered list of integers [n1,...,nk]
- and a term t, and relocates rel(nk) to k. Typically, the list of integers
- is a parameter of a metavariable occurrence. *)
+(* 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 *)
+(* 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 *)
+(* of alpha convertibility. Our implementation, though, is even weaker than *)
+(* alpha convertibility, since it replace the term [tk] if and only if [tk] *)
+(* is a Rel (missing all the other cases). Does this matter in practice? *)
exception NotInTheList;;
in
C.CoFix (i, liftedfl)
in
- let res = deliftaux 0 t in
+ let res =
+ try
+ deliftaux 0 t
+ with
+ NotInTheList ->
+ (* This is the case where we fail even first order unification. *)
+ (* The reason is that our delift function is weaker than first *)
+ (* order (in the sense of alpha-conversion). See comment above *)
+ (* related to the delift function. *)
+prerr_endline "!!!!!!!!!!! First Order UnificationFailed, but maybe it could have been successful even in a first order setting (no conversion, only alpha convertibility)! Please, implement a better delift function !!!!!!!!!!!!!!!!" ;
+ raise UnificationFailed
+ in
res, restrict !to_be_restricted metasenv
;;