open Printf
-exception Elim_failure of string
+exception Elim_failure of string Lazy.t
exception Can_t_eliminate
let debug_print = fun _ -> ()
+(*let debug_print s = prerr_endline (Lazy.force s) *)
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
add_params (fun b s t -> Cic.Lambda (b, s, t)) leftno ty cic
in
(*
-debug_print (CicPp.ppterm eliminator_type);
-debug_print (CicPp.ppterm eliminator_body);
+debug_print (lazy (CicPp.ppterm eliminator_type));
+debug_print (lazy (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 (lazy (CicPp.ppterm eliminator_type));
+debug_print (lazy (CicPp.ppterm eliminator_body));
*)
let (computed_type, ugraph) =
try
CicTypeChecker.type_of_aux' [] [] eliminator_body CicUniv.empty_ugraph
with CicTypeChecker.TypeCheckerFailure msg ->
- raise (Elim_failure (sprintf
+ raise (Elim_failure (lazy (sprintf
"type checker failure while type checking:\n%s\nerror:\n%s"
- (CicPp.ppterm eliminator_body) msg))
+ (CicPp.ppterm eliminator_body) (Lazy.force msg))))
in
if not (fst (CicReduction.are_convertible []
eliminator_type computed_type ugraph))