exception Can_t_eliminate
let debug_print = fun _ -> ()
+(*let debug_print = prerr_endline *)
let counter = ref ~-1 ;;
-let fresh_binder () =
+let fresh_binder () = Cic.Name "matita_dummy"
+(*
incr counter;
- Cic.Name ("e" ^ string_of_int !counter)
+ Cic.Name ("e" ^ string_of_int !counter) *)
(** verifies if a given inductive type occurs in a term in target position *)
let rec recursive uri typeno = function
(shift + 1, b :: branches))
constructors (1, [])
in
+ let shiftno = conslen + rightno + 2 + recshift in
+ let outtype =
+ if dependent then
+ Cic.Rel shiftno
+ else
+ let head =
+ if rightno = 0 then
+ CicSubstitution.lift 1 (Cic.Rel shiftno)
+ else
+ Cic.Appl
+ ((CicSubstitution.lift (rightno + 1) (Cic.Rel shiftno)) ::
+ mk_rels 1 rightno)
+ in
+ add_right_lambda true leftno shiftno 1 rightno indty head ty
+ in
let mutcase =
- Cic.MutCase (uri, typeno, Cic.Rel (conslen + rightno + 2 + recshift),
- Cic.Rel 1, branches)
+ Cic.MutCase (uri, typeno, outtype, Cic.Rel 1, branches)
in
let body =
if is_recursive then
(*
debug_print (CicPp.ppterm eliminator_type);
debug_print (CicPp.ppterm eliminator_body);
+*)
+ let eliminator_type =
+ FreshNamesGenerator.mk_fresh_names [] [] [] eliminator_type in
+ let eliminator_body =
+ FreshNamesGenerator.mk_fresh_names [] [] [] eliminator_body in
+(*
+debug_print (CicPp.ppterm eliminator_type);
+debug_print (CicPp.ppterm eliminator_body);
*)
let (computed_type, ugraph) =
try